On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems 2: Newton's Method Can Need ε^(−2+τ) Iterations to Reach ‖g‖ ≤ εResearch Paper
Newton's method is the reference second-order method for unconstrained minimization of a smooth function . Near a nondegenerate local minimizer it converges quadratically, and in practice it often works well far from one. Its global behaviour on nonconvex functions is a different matter. The pure method may fail outright when the…