On the projected subgradient method for nonsmooth convex optimization in a Hilbert space.
Ya. I. AlberAlfredo N. IusemMikhail V. SolodovPublished in: Math. Program. (1998)
Keyphrases
- convex optimization
- convex sets
- variational inequalities
- interior point methods
- finite dimensional
- low rank
- total variation
- convex programming
- primal dual
- convex optimization problems
- augmented lagrangian
- regularization term
- reproducing kernel hilbert space
- dual formulation
- image segmentation
- linear program
- image denoising
- dynamic programming
- special case
- multiscale