The Computational Complexity of Avoiding Strict Saddle Points in Constrained OptimizationResearch Paper
Nonconvex optimization over a polytope, with , is the basic model behind constrained training problems and many operations-research formulations. Gradient methods reach first-order stationary points, but these include strict saddle points, which degrade solutions in practice. The usual remedy…