Open Problem: The Oracle Complexity of Smooth Convex Optimization in Nonstandard Settings.
Cristobal GuzmanPublished in: COLT (2015)
Keyphrases
- convex optimization
- interior point methods
- low rank
- total variation
- primal dual
- convex relaxation
- computational complexity
- augmented lagrangian
- convex optimization problems
- convex constraints
- image denoising
- semidefinite program
- alternating direction method of multipliers
- worst case
- semi definite programming
- convex formulation