Stable factorized quasi-Newton methods for nonlinear least-squares problems

DOI10.1016/S0377-0427(00)00539-2zbMath0983.65071OpenAlexW2069416093MaRDI QIDQ5936067

Xiaofang Ma, Richard Ying Kit Fung, Cheng-Xian Xu

Publication date: 7 April 2002

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(00)00539-2

zbMATH Keywords

convergencenumerical experimentsnonlinear least-squares problemQR decompositionquasi-Newton methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Numerical computation of solutions to systems of equations (65H10) Methods of quasi-Newton type (90C53)

Related Items (1)

Newton-Krylov type algorithm for solving nonlinear least squares problems

Uses Software

• ve08
• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient line search for nonlinear least squares
• Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
• More test examples for nonlinear programming codes
• Hybrid method for nonlinear least-square problems without calculating derivatives
• Factorized quasi-Newton methods for nonlinear least squares problems
• Local convergence analysis for partitioned quasi-Newton updates
• Variational Methods for Non-Linear Least-Squares
• Hybrid Methods for Nonlinear Least Squares
• Testing Unconstrained Optimization Software
• The estimation of the hessian matrix in nonlinear least squares problems with non-zero residuals
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods

This page was built for publication: Stable factorized quasi-Newton methods for nonlinear least-squares problems