Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness.
Ankit GargRobin KothariPraneeth NetrapalliSuhail SherifPublished in: NeurIPS (2021)
Keyphrases
- convex optimization
- lower bound
- objective function
- upper bound
- low rank
- interior point methods
- convex programming
- np hard
- optimal solution
- cost function
- total variation
- worst case
- primal dual
- norm minimization
- convex optimization problems
- convex formulation
- machine learning
- interior point
- convex relaxation
- convex constraints
- semidefinite program
- linear programming
- multiscale
- face recognition