On the Successive Projections Approach to Least-Squares Problems

DOI10.1137/0723047MaRDI QIDQ4721543zbMATH OpenOpenAlexFDO

Authors Trond Steihaug, J. E. jun. Dennis

Publication date 1986

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1911/101559

zbMATH Keywords

Gauss-Seidelinexact Gauss-NewtonJacobian matrixnonlinear least-squares problemssparse finite-differencing processsuccessive overrelaxation

Mathematics Subject Classification ID

General nonlinear regression (62J02) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of solutions to systems of equations (65H10) Numerical mathematical programming methods (65K05)

Recommendations

• An algorithm for solving sparse nonlinear least squares problems
• scientific article; zbMATH DE number 778128
• scientific article; zbMATH DE number 4211385
• scientific article; zbMATH DE number 3896208
• An inexact Levenberg-Marquardt method for large sparse nonlinear least squres

Cited in

(8)

• A parallel projection method for solving generalized linear least-squares problems
• A chordal preconditioner for large-scale optimization
• Gauss-Seidel method for least-distance problems
• On convergence of minimization methods: Attraction, repulsion, and selection
• Optimal direct determination of sparse Jacobian matrices
• Inexact trust region PGC method for large sparse unconstrained optimization
• scientific article; zbMATH DE number 778128 (Why is no real title available?)
• Computing projections with LSQR

This page was built for publication: On the Successive Projections Approach to Least-Squares Problems

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