On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems.

Cartis C, Gould NIM, Toint PL
No abstract available