An algorithm for solving nonlinear least-squares problems with a new curvilinear search

DOI10.1007/BF02247967MaRDI QIDQ911233zbMATH OpenFDO

Authors Rita Filomena Santos, J. M. Martínez

Publication date 1990

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02247967

zbMATH Keywords

curvilinear searchGauss-Newton methodglobal convergencenonlinear least squares problemtrust-region strategy

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 4217828
• A two-dimensional search used with a nonlinear least-squares solver
• A new linesearch algorithm for nonlinear least squares problems
• scientific article; zbMATH DE number 773161
• scientific article; zbMATH DE number 3890598

Cites work

• An algorithm for solving sparse nonlinear least squares problems
• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• Testing Unconstrained Optimization Software

Cited in

(10)

• A parallel projection method for overdetermined nonlinear systems of equations
• Advances in trust region algorithms for constrained optimization
• Using negative curvature in solving nonlinear programs
• A two-dimensional search used with a nonlinear least-squares solver
• scientific article; zbMATH DE number 1594505 (Why is no real title available?)
• A new linesearch algorithm for nonlinear least squares problems
• A variant of the Levenberg-Marquardt algorithm for solving a least squares problem
• A multi-step curve search algorithm in nonlinear optimization
• Global line search strategies for nonlinear least squares problems based on curvature and projected curvature
• A curvilinear method based on minimal-memory BFGS updates

Describes a project that uses

Uses Software

• minpack

This page was built for publication: An algorithm for solving nonlinear least-squares problems with a new curvilinear search

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