full
search.png

Search

close.png

Cancel

arrow
Volume 6, Issue 4
A Memoryless Augmented Gauss-Newton Method for Nonlinear Least-Squares Problems

Dennis J. E. Jr, Song-Bai Sheng & Phuong Anh Vu

J. Comp. Math., 6 (1988), pp. 355-374.

Published online: 1988-06

Preview Full PDF 2559 25349

Cited by

google scholar semantic scholar
Export citation
  • Abstract

In this paper, we develop, analyze, and test a new algorithm for nonlinear least-squares problems. The algorithm uses a BFGS update of the Gauss-Newton Hessian when some heuristics indicate that the Gauss-Newton method may not make a good step. Some important elements are that the secant or quasi-Newton equations considered are not the obvious ones, and the method does not build up a Hessian approximation over several steps. The algorithm can be implemented easily as a modification of any Gauss-Newton code, and it seems to be useful for large residual problems.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-6-355, author = {Jr , Dennis J. E.Sheng , Song-Bai and Vu , Phuong Anh}, title = {A Memoryless Augmented Gauss-Newton Method for Nonlinear Least-Squares Problems}, journal = {Journal of Computational Mathematics}, year = {1988}, volume = {6}, number = {4}, pages = {355--374}, abstract = {

In this paper, we develop, analyze, and test a new algorithm for nonlinear least-squares problems. The algorithm uses a BFGS update of the Gauss-Newton Hessian when some heuristics indicate that the Gauss-Newton method may not make a good step. Some important elements are that the secant or quasi-Newton equations considered are not the obvious ones, and the method does not build up a Hessian approximation over several steps. The algorithm can be implemented easily as a modification of any Gauss-Newton code, and it seems to be useful for large residual problems.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9524.html} }
TY - JOUR T1 - A Memoryless Augmented Gauss-Newton Method for Nonlinear Least-Squares Problems AU - Jr , Dennis J. E. AU - Sheng , Song-Bai AU - Vu , Phuong Anh JO - Journal of Computational Mathematics VL - 4 SP - 355 EP - 374 PY - 1988 DA - 1988/06 SN - 6 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/9524.html KW - AB -

In this paper, we develop, analyze, and test a new algorithm for nonlinear least-squares problems. The algorithm uses a BFGS update of the Gauss-Newton Hessian when some heuristics indicate that the Gauss-Newton method may not make a good step. Some important elements are that the secant or quasi-Newton equations considered are not the obvious ones, and the method does not build up a Hessian approximation over several steps. The algorithm can be implemented easily as a modification of any Gauss-Newton code, and it seems to be useful for large residual problems.

Jr , Dennis J. E.Sheng , Song-Bai and Vu , Phuong Anh. (1988). A Memoryless Augmented Gauss-Newton Method for Nonlinear Least-Squares Problems. Journal of Computational Mathematics. 6 (4). 355-374. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard