A hybrid steepest descent method for constrained convex optimization.
Mathieu GerardBart De SchutterMichel VerhaegenPublished in: Autom. (2009)
Keyphrases
- convex optimization
- steepest descent method
- interior point methods
- step size
- total variation
- convex optimization problems
- convergence speed
- primal dual
- convex formulation
- low rank
- pairwise
- norm minimization
- semi definite programming
- computer vision
- basis pursuit
- higher order
- neural network
- multiresolution
- high quality
- similarity measure