Cubic regularization of Newton method and its global performance¶
Authors: Yurii Nesterov, B.T. Polyak
Published: 2006 (Journal Paper)
Source: Mathematical Programming
Algorithm: Cubic Regularized Newton
DOI: 10.1007/s10107-006-0706-8
Summary¶
Abstract¶
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local convergence results. However, the main contribution of the paper is related to global worst-case complexity bounds for different problem classes including some nonconvex cases. It is shown that the search direction can be computed by standard linear algebra technique.