A truncated nonmonotone Gauss-Newton method for large-scale nonlinear least-squares problems
From MaRDI portal
Publication:853562
DOI10.1007/s10589-006-6444-2zbMath1122.90094MaRDI QIDQ853562
Publication date: 17 November 2006
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2158/256050
large-scale problems; nonlinear least-squares; nonmonotone line search techniques; truncated Gauss-Newton method
65K10: Numerical optimization and variational techniques
65F10: Iterative numerical methods for linear systems
90C55: Methods of successive quadratic programming type
Related Items
Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations, Truncated regularized Newton method for convex minimizations, Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems, Convergence analysis of nonmonotone Levenberg-Marquardt algorithms for complementarity problem, Nonmonotone Learning of Recurrent Neural Networks in Symbolic Sequence Processing Applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method
- A truncated Newton method with non-monotone line search for unconstrained optimization
- A survey of truncated-Newton methods
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Testing Unconstrained Optimization Software
- Inexact Newton Methods
- Algorithms for the Solution of the Nonlinear Least-Squares Problem
- Numerical Optimization
- Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
