Global performance of the Newton method
Abstract
In this talk we present different strategies for regularization of the pure Newton method
(minimization problems)and of the Gauss-Newton method (systems of nonlinear equations).
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.