Autori: Emil Catinas

Editorial: Mathematics of Computation, 74, no. 249, p.291-301, 2005.

Rezumat:

A classical model of Newton iterations which takes into account some error terms is given by the quasi-Newton method, which assumes perturbed Jacobians at each step. Its high convergence orders were characterized by Dennis and Moré [Math. Comp. 28 (1974), 549-560]. The inexact Newton method constitutes another such model, since it assumes that at each step the linear systems are only approximately solved; the high convergence orders of these iterations were characterized by Dembo, Eisenstat and Steihaug [SIAM J. Numer. Anal. 19 (1982), 400-408]. We have recently considered the inexact perturbed Newton method [J. Optim. Theory Appl. 108 (2001), 543-570] which assumes that at each step the linear systems are perturbed and then they are only approximately solved; we have characterized the high convergence orders of these iterates in terms of the perturbations and residuals.

In the present paper we show that these three models are in fact equivalent, in the sense that each one may be used to characterize the high convergence orders of the other two. We also study the relationship in the case of linear convergence and we deduce a new convergence result.

Cuvinte cheie: metode Newton inexacte, inexacte si perturbate, quasi-Newton, convergenta locala // inexact, inexact and perturbed, quasi-Newton methods, local convergence

URL: http://www.ams.org/mcom/2005-74-249/S0025-5718-04-01646-1/home.html