Global line search strategies for nonlinear least squares problems based on curvature and projected curvature

DOI10.1080/17415970600573684MaRDI QIDQ5481764zbMATH OpenOpenAlexFDO

Authors Philippe al Khoury, Guy Chavent

Publication date 10 August 2006

Published in Inverse Problems in Science and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/17415970600573684

zbMATH Keywords

algorithmsconvergencenonlinear programmingnumerical resultsLevenberg-Marquardt methodsteepest descent methodcomparison of methodsGauss-Newton methodmaximum projected curvature step

Mathematics Subject Classification ID

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

Recommendations

• An efficient line search for nonlinear least squares
• An algorithm for solving nonlinear least-squares problems with a new curvilinear search
• A two-dimensional search used with a nonlinear least-squares solver
• Some global convergence properties of the Levenberg-Marquardt methods with line search
• Curved search methods for unconstrained optimization

This page was built for publication: Global line search strategies for nonlinear least squares problems based on curvature and projected curvature

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