Abstract
We consider a truncated Gauss-Newton method for solving nonlinear least squares problems (NLSP) for the underdetermined case. Under some mild conditions, the method converges to a solution at rate of ν when the involved parameter ν in the truncated method satisfies ν ∈ (1,2], and superlinearly when ν = 1 and θk → 0. It should be remarked that our techniques for convergence analysis are quite different from that used in [Appl. Numer. Math., Ill, 92-110 (2017)].
| Original language | English |
|---|---|
| Pages (from-to) | 2235-2246 |
| Number of pages | 12 |
| Journal | Journal of Nonlinear and Convex Analysis |
| Volume | 19 |
| Issue number | 12 |
| State | Published - 2018 |
Bibliographical note
Publisher Copyright:© 2018.
Keywords
- Inexact Levenberg-Marquardt method
- Nonlinear least squares problems
- Superlinear convergence
- Truncated Gauss-Newton method
Fingerprint
Dive into the research topics of 'On convergence of a truncated Gauss-Newton method for solving underdetermined nonlinear least squares problems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver