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

Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint. On the Complexity of Steepest Descent, Newton s and Regularized Newton s Methods for Nonconvex Unconstrained Optimization Problems. SIAM Journal on Optimization, 20(6):2833-2852, 2010. [doi]

Abstract

Abstract is missing.