Truncated trust region methods based on preconditioned iterative subalgorithms for large sparse systems of nonlinear equations
DOI10.1023/A:1022678023392zbMath0902.90146OpenAlexW204436159MaRDI QIDQ1379937
Publication date: 5 March 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022678023392
global convergenceresidual smoothingtrust region methodsinexact Jacobiansconjugate gradient-type methodslarge sparse systems of nonlinear equations
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Inexact trust region method for large sparse systems of nonlinear equations
- Software for estimating sparse Jacobian matrices
- Hybrid Krylov Methods for Nonlinear Systems of Equations
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- On the global convergence of trust region algorithms for unconstrained minimization
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Convergence Theory of Nonlinear Newton–Krylov Algorithms
- Globally Convergent Inexact Newton Methods
- Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian
This page was built for publication: Truncated trust region methods based on preconditioned iterative subalgorithms for large sparse systems of nonlinear equations