Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity.
Sally DongHaotian JiangYin Tat LeeSwati PadmanabhanGuanghao YePublished in: NeurIPS (2022)
Keyphrases
- convex optimization
- interior point methods
- operator splitting
- low rank matrix
- total variation
- convex relaxation
- convex sets
- low rank
- piecewise constant
- primal dual
- semidefinite
- convex optimization problems
- norm minimization
- computational complexity
- linear constraints
- worst case
- convex formulation
- basis pursuit
- semidefinite program
- computer vision
- gradient method
- high quality