On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems.
Kuangyu DingXin Yee LamKim-Chuan TohPublished in: Comput. Optim. Appl. (2023)
Keyphrases
- decomposition methods
- augmented lagrangian
- duality gap
- convex optimization
- constrained optimization problems
- primal dual
- linear programming problems
- convex programming
- constraint satisfaction problems
- constrained optimization
- multiple objectives
- database theory
- decomposition method
- total variation
- open problems
- databases
- convergence rate
- linear programming
- computational complexity
- search algorithm
- feature extraction