Algorithms and matching lower bounds for approximately-convex optimization.
Andrej RisteskiYuanzhi LiPublished in: NIPS (2016)
Keyphrases
- convex optimization
- lower bound
- convex optimization problems
- optimization problems
- upper bound
- interior point
- interior point methods
- online algorithms
- computational complexity
- multiresolution
- motion estimation
- total variation
- learning algorithm
- computationally intensive
- primal dual
- semidefinite programming
- convex relaxation
- machine learning