A globalization scheme for the generalized Gauss-Newton method

DOI10.1007/BF01396345zbMath0691.65051MaRDI QIDQ582820

Oswald Knoth

Publication date: 1989

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133413

zbMATH Keywords

global convergencenumerical resultspenalty functionline searchGauss-Newton methodconstrained nonlinear least squares

Mathematics Subject Classification ID

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

Related Items

Least squares approximation by splines with free knots ⋮ Bayesian ODE solvers: the maximum a posteriori estimate

Uses Software

• ELSUNC_f90

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient line search for nonlinear least squares
• A globally convergent method for nonlinear programming
• Finding space-time geometries without using a metric
• Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
• Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization
• A new linesearch algorithm for nonlinear least squares problems
• A surperlinearly convergent algorithm for constrained optimization problems
• A comparison of some algorithms for the nonlinear least squares problem
• On the Use of Approximations in Algorithms for Optimization Problems with Equality and Inequality Constraints
• A first order, exact penalty function algorithm for equality constrained optimization problems
• The Estimation of Parameters in Nonlinear, Implicit Models