An efficient line search for nonlinear least squares

DOI10.1007/BF00940566zbMath0562.90074OpenAlexW2050786966MaRDI QIDQ1057187

Roger Fletcher, Mehiddin Al-Baali

Publication date: 1986

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

unconstrained optimizationnonlinear least squaresline search subproblemsectioning

Mathematics Subject Classification ID

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

Related Items (15)

Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization ⋮ Least squares approximation by splines with free knots ⋮ The global convergence of a modified BFGS method for nonconvex functions ⋮ Hybrid method for nonlinear least-square problems without calculating derivatives ⋮ An Optimal Broyden Updating Formula And Its Application To Nonliner Least Squares ⋮ Multiple shooting-local linearization method for the identification of dynamical systems ⋮ Distribution of event times in time-resolved fluorescence: The exponential series approach --- algorithm, regularization, analysis ⋮ Modification of the Wolfe line search rules to satisfy the descent condition in the Polak-Ribière-Polyak conjugate gradient method ⋮ Stable factorized quasi-Newton methods for nonlinear least-squares problems ⋮ A globalization scheme for the generalized Gauss-Newton method ⋮ Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search ⋮ Comparison between structural and residual error formulations of an optimum design mechanism problem ⋮ A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method ⋮ MERLIN-3. 0. A multidimensional optimization environment ⋮ Variational quasi-Newton methods for unconstrained optimization

Uses Software

• BRENT

Cites Work

• Variational Methods for Non-Linear Least-Squares
• Convergence Conditions for Ascent Methods
• On Steepest Descent
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient line search for nonlinear least squares