Curvature and complexity: Better lower bounds for geodesically convex optimization.
Christopher CriscitielloNicolas BoumalPublished in: CoRR (2023)
Keyphrases
- convex optimization
- lower bound
- worst case
- upper bound
- interior point methods
- convex optimization problems
- total variation
- semidefinite program
- convex relaxation
- convex constraints
- low rank
- primal dual
- np hard
- norm minimization
- convex formulation
- alternating direction method of multipliers
- operator splitting
- computational complexity
- multiscale
- image denoising
- semi definite programming
- evolutionary algorithm
- computer vision
- learning algorithm