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

DOI10.1007/BF02247967zbMATH Open0696.65068MaRDI QIDQ911233FDOQ911233

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

Publication date: 1990

Published in: Computing (Search for Journal in Brave)

Recommendations

• scientific article
• 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

zbMATH Keywords

curvilinear searchglobal convergenceGauss-Newton methodnonlinear least squares problemtrust-region strategy

Mathematics Subject Classification ID

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

Cites Work

• Testing Unconstrained Optimization Software
• Title not available (Why is that?)
• An algorithm for solving sparse nonlinear least squares problems

Cited In (9)

• Title not available (Why is that?)
• A variant of the Levenberg-Marquardt algorithm for solving a least squares problem
• A curvilinear method based on minimal-memory BFGS updates
• Advances in trust region algorithms for constrained optimization
• A multi-step curve search algorithm in nonlinear optimization
• Global line search strategies for nonlinear least squares problems based on curvature and projected curvature
• Using negative curvature in solving nonlinear programs
• A parallel projection method for overdetermined nonlinear systems of equations
• A new linesearch algorithm for nonlinear least squares problems

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)