Hostname: page-component-74656f9884-8r8nv Total loading time: 0 Render date: 2026-11-08T13:42:00.073Z Has data issue: false hasContentIssue false

Nonlinear least squares — the Levenberg algorithm revisited*

Published online by Cambridge University Press:  17 February 2009

M. R. Osborne
Affiliation:
Computer Centre, Australian National University, Canberra, A. C. T. 2601, Australia.
Rights & Permissions [Opens in a new window]

Abstract

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.

One of the most succesful algorithims for nonlinear least squares calculations is that associated with the names of Levenberg, Marquardt, and Morrison. This algorithim gives a method which depends nonlinearly on a parameter γ for computing the correction to the current point. In this paper an attempt is made to give a rule for choosing γ which (a) permits a satisfactory convergence theorem to be proved, and (b) is capable of satisfactory computer implementation. It is beleieved that the stated aims have been met with reasonable success. The convergence theorem is both simple and global in character, and a computer code is given which appears to be at least competitive with existing alternatives.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1976