Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems.
Dinh Quoc TranCarlo SavorgnanMoritz DiehlPublished in: Comput. Optim. Appl. (2013)
Keyphrases
- convex optimization problems
- convex optimization
- dual variables
- lagrangian dual
- optimization problems
- learning problems
- structured sparsity
- primal dual
- interior point methods
- multiscale
- combinatorial optimization
- lagrangian relaxation
- integer programming
- data sets
- linear programming
- image classification
- supervised learning
- special case
- multiresolution
- evolutionary algorithm
- machine learning