Date
Thu, 22 Jun 2006
Time
14:00 - 15:00
Location
Comlab
Speaker
Prof Yurii Nesterov
Organisation
Universite catholique de louvain

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.

Last updated on 6 May 2025, 2:04pm. Please contact us with feedback and comments about this page.