Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization.
Benjamin GrimmerDanlin LiPublished in: CoRR (2023)
Keyphrases
- convex optimization
- primal dual
- interior point methods
- convex optimization problems
- norm minimization
- convex programming
- low rank
- condition numbers
- convex constraints
- total variation
- linear programming problems
- linear programming
- quadratic program
- alternating direction method of multipliers
- dual formulation
- semidefinite programming
- higher order
- interior point
- augmented lagrangian
- convex relaxation
- convex sets
- optimization methods
- linear program
- image restoration
- optimization problems