On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization.
Andrzej RuszczynskiPublished in: Math. Oper. Res. (1995)
Keyphrases
- convex optimization
- decomposition method
- augmented lagrangian
- alternating direction
- basis pursuit
- total variation
- group lasso
- low rank
- decomposition algorithm
- primal dual
- interior point methods
- sparse representation
- high dimensional
- image restoration
- total variation regularization
- image denoising
- convergence rate
- constrained optimization
- convergence speed
- constrained optimization problems
- natural images
- denoising
- motion estimation
- dynamic programming