Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness.
Ankit GargRobin KothariPraneeth NetrapalliSuhail SherifPublished in: CoRR (2021)
Keyphrases
- convex optimization
- lower bound
- objective function
- upper bound
- interior point methods
- cost function
- total variation
- low rank
- convex relaxation
- convex programming
- primal dual
- np hard
- worst case
- optimal solution
- norm minimization
- convex constraints
- image segmentation
- interior point
- convex optimization problems
- optimization problems
- multiresolution
- pairwise
- multiscale
- computer vision
- basis pursuit