How to Globally Solve Non-convex Optimization Problems Involving an Approximate ℓ0 Penalization.
Arthur MarminMarc CastellaJean-Christophe PesquetPublished in: ICASSP (2019)
Keyphrases
- convex optimization
- problems involving
- solving complex
- convex formulation
- alternating direction method of multipliers
- interior point methods
- augmented lagrangian method
- low rank
- total variation
- convex relaxation
- optimization problems
- primal dual
- augmented lagrangian
- multiple objectives
- convex optimization problems
- image processing
- linear programming
- norm minimization
- low rank matrix
- np hard
- feature space
- high quality