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

Alexandros Hollender, Manolis Zampetakis

Finding approximate stationary points, i.e., points where the gradient is approximately zero, of non-convex but smooth objective functions $f$ over unrestricted $d$-dimensional dom…