Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T05:54:57.886Z Has data issue: false hasContentIssue false

The “global” convergence of Broyden-like methods with suitable line search

Published online by Cambridge University Press:  17 February 2009

Anderas Griewank
Affiliation:
Centre for Mathematical Analysis, Australian National University, G.P.O. Box 4, Canberra A.C.T. 2600, Australia.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Iterative methods for solving a square system of nonlinear equations g(x) = 0 often require that the sum of squares residual γ (x) ≡ ½∥g(x)∥2 be reduced at each step. Since the gradient of γ depends on the Jacobian ∇g, this stabilization strategy is not easily implemented if only approximations Bk to ∇g are available. Therefore most quasi-Newton algorithms either include special updating steps or reset Bk to a divided difference estimate of ∇g whenever no satisfactory progress is made. Here the need for such back-up devices is avoided by a derivative-free line search in the range of g. Assuming that the Bk are generated from an rbitrary B0 by fixed scale updates, we establish superlinear convergence from within any compact level set of γ on which g has a differentiable inverse function g−1.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1986