On solving nonlinear least-squares problems in case of rankdeficient Jacobians

DOI10.1007/BF02242173zbMath0578.65062MaRDI QIDQ1066623

B. George

Publication date: 1985

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

local convergenceGauss-Newton methodnonlinear least squares problemrankdeficient Jacobians

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items (3)

A relation between Newton and Gauss-Newton steps for singular nonlinear equations ⋮ Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method ⋮ An algorithm for solving sparse nonlinear least squares problems

Cites Work

• Unnamed Item
• Starlike domains of convergence for Newton's method at singularities
• Newton's method and high order singularities
• On the accurate determination of nonisolated solutions of nonlinear equations
• A Newton-Raphson method for the solution of systems of equations
• Convergence of the Newton process to multiple solutions
• Convergence Rates for Newton’s Method at Singular Points
• Newton’s Method at Singular Points. I
• Newton’s Method for Singular Problems when the Dimension of the Null Space is $>1$
• Newton’s Method at Singular Points. II
• Convergence Acceleration for Newton’s Method at Singular Points
• A Stability Analysis for Perturbed Nonlinear Iterative Methods
• The Convergence of the Ben-Israel Iteration for Nonlinear Least Squares Problems
• On Newton’s Method for Singular Problems

This page was built for publication: On solving nonlinear least-squares problems in case of rankdeficient Jacobians