An Improvement of the Pivoting Strategy in the Bunch and Kaufman Decomposition, Within Truncated Newton Methods
From MaRDI portal
Publication:6165044
DOI10.1007/978-3-030-95380-5_5OpenAlexW4285105992MaRDI QIDQ6165044
Publication date: 31 July 2023
Published in: AIRO Springer Series (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/10278/5012203
large-scale optimizationtruncated Newton methodBunch and Kaufman decompositiongradient-related directions
Cites Work
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization
- Assessing a search direction within a truncated Newton method
- Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems
- A truncated Newton method with non-monotone line search for unconstrained optimization
- A survey of truncated-Newton methods
- Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation
- An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization
- Preconditioned nonlinear conjugate gradient methods based on a modified secant equation
- Iterative computation of negative curvature directions in large scale optimization
- On solving sparse symmetric linear systems whose definiteness is unknown
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Inexact Newton Methods
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Trust Region Methods
