Accelerated Gauss-Newton algorithms for nonlinear least squares problems

DOI10.1007/BF01930989MaRDI QIDQ3875243zbMATH OpenFDO

Authors Axel Ruhe

Publication date 1979

Published in BIT (Search for Journal in Brave)

zbMATH Keywords

rate of convergencesteepest descentGauss-Newton algorithmnumerical test examplesconjugate gradient accelerationnonlinear least squares parameter estimation problems

Mathematics Subject Classification ID

Point estimation (62F10) Numerical mathematical programming methods (65K05)

Cites work

• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• scientific article; zbMATH DE number 3538668 (Why is no real title available?)
• scientific article; zbMATH DE number 3257775 (Why is no real title available?)
• A comparison of some algorithms for the nonlinear least squares problem
• Accelerated Gauss-Newton algorithms for nonlinear least squares problems
• On the asymptotic directions of the s-dimensional optimum gradient method
• On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications
• Perturbation theory for pseudo-inverses

Cited in

(7)

• Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
• The minimal-norm Gauss-Newton method and some of its regularized variants
• Accelerated Gauss-Newton algorithms for nonlinear least squares problems
• Nonlinear residual minimization by iteratively reweighted least squares
• An efficient implementation of the Gauss-Newton method via generalized Krylov subspaces
• Convergence analysis of the general Gauss-Newton algorithm
• Methods and algorithms of solving spectral problems for polynomial and rational matrices

This page was built for publication: Accelerated Gauss-Newton algorithms for nonlinear least squares problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3875243)