Cubic regularization of a Newton scheme and its global performance

In this paper we suggest a cubic regularization for a Newton method as applied to unconstrained minimization problem. For this scheme we prove general convergence results. We analyze the behavior of this scheme on different problem classes, for which we get global and local worst-case complexity bounds. It is shown that the search direction can be computed by a standard linear algebra technique.