Login / Signup
Curvature and complexity: Better lower bounds for geodesically convex optimization.
Christopher Criscitiello
Nicolas Boumal
Published in:
COLT (2023)
Keyphrases
</>
convex optimization
lower bound
interior point methods
worst case
upper bound
primal dual
low rank
total variation
objective function
norm minimization
convex optimization problems
vc dimension
convex relaxation
multiscale
convex formulation
semidefinite program
scale space
np hard
computational complexity