Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T02:28:41.044Z Has data issue: false hasContentIssue false

An inexact Levenberg-Marquardt method for large sparse nonlinear least squres

Published online by Cambridge University Press:  17 February 2009

J. N. Holt
Affiliation:
Department of Mathematics, University of Queensland, St. Lucia, 4067, Queensland.
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.

A method for solving problems of the form is presented. The approach of Levenberg and Marquardt is used, except that the linear least squares subproblem arising at each iteration is not solved exactly, but only to within a certain tolerance. The method is most suited to problems in which the Jacobian matrix is sparse. Use is made of the iterative algorithm LSQR of Paige and Saunders for sparse linear least squares.

A global convergence result can be proven, and under certain conditions it can be shown that the method converges quadratically when the sum of squares at the optimal point is zero.

Numerical test results for problems of varying residual size are given.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1985