A globalization scheme for the generalized Gauss-Newton method

Numerische Mathematik

Volumn 56, Issue 6, 1989, Pages 591-607

  Knoth, O ^a  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

Subject Classifications: AMS(MOS): 65K10, 90C30, CR: G 1.6

Indexed keywords

EID: 0343507766     PISSN: 0029599X     EISSN: 09453245     Source Type: Journal    
DOI: 10.1007/BF01396345     Document Type: Article

References (25)

1. An efficient line search for non-linear least squares
2. Recent advances in parameteridentification techniques for o.d.e.
3. The estimation of parameters in nonlinear implicit models
4. An underrelaxed Gauss-Newton method for equality constrained nonlinear least squares problems
5. An l1 penalty method for nonlinear constraints
6. A globally convergent method for nonlinear programming
7. A new linesearch algorithm for nonlinear least squares problems
8. A first order, exact penalty function algorithm for equality constrained optimization problems
9. Sequential gradient restoration algorithm for the minimization of constrained functions — ordinary and conjugate gradient versions
10. Stationarity and superlinear convergence of an algorithm for univariate locally Lipschitz constrained minimization
11. On the use of approximations in algorithms for optimization problem with equality and inequality constraints
12. A fast algorithm for nonlinearly constrained optimization calculations
13. Variable metric methods for constrained optimization
14. A comparison of some algorithms for the nonlinear least squares problem
15. Construction of nonlinear programming test problems