Adaptive Cubic Regularisation Methods for Unconstrained Optimization. Part II: Worst-Case Function- and Derivative-Evaluation Complexity 3: ARC(S) Reaches −λ_min(QᵀBQ) ≤ ε in O(ε^(−3)) IterationsResearch Paper
Unconstrained minimization of a smooth nonconvex function is the core subproblem of most nonlinear optimization software. Methods that only drive the gradient to zero may stall at saddle points, so a second-order guarantee (approximately nonnegative curvature) is the natural target for nonconvex problems. Worst-case evaluation…