A new linesearch algorithm for nonlinear least squares problems

DOI10.1007/BF02591997zbMath0546.90076OpenAlexW2030423024MaRDI QIDQ3337958

Per Lindström, Per-Åke Wedin

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

linesearch algorithmone-dimensional minimizationunconstrained nonlinear least squares problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

Local results for the Gauss-Newton method on constrained rank-deficient nonlinear least squares ⋮ A new linesearch algorithm for nonlinear least squares problems ⋮ A globalization scheme for the generalized Gauss-Newton method ⋮ Regularization tools for training large feed-forward neural networks using automatic differentiation^∗

Uses Software

• ELSUNC_f90
• minpack
• BRENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new linesearch algorithm for nonlinear least squares problems
• An Algorithm for Least-Squares Estimation of Nonlinear Parameters
• Some Recent Approaches to Solving Large Residual Nonlinear Least Squares Problems
• Testing Unconstrained Optimization Software
• An Adaptive Nonlinear Least-Squares Algorithm
• A comparison of some algorithms for the nonlinear least squares problem
• Algorithms for the Solution of the Nonlinear Least-Squares Problem
• An iterative method for locating turning points
• A method for the solution of certain non-linear problems in least squares