In this talk we consider different strategies for regularization of the pure Newton method as applied to unconstrained minimization problems.
For these schemes we prove general convergence results. We establish also the global and local worst-case complexity bounds. It is shown that the corresponding search directions can be computed by a standard linear algebra technique. We discuss also a possibility to accelerate the scheme on the convex problems.
