The Computational Complexity of Finding Stationary Points in Non-Convex Optimization.

Alexandros Hollender Emmanouil Zampetakis

Published in: COLT (2023)

Keyphrases

convex optimization
computational complexity
stationary points
low rank
total variation
primal dual
convex optimization problems
objective function
special case
constrained optimization
convex sets
nonlinear programming
computer vision
mathematical programming