An Improvement of the Pivoting Strategy in the Bunch and Kaufman Decomposition, Within Truncated Newton Methods
From MaRDI portal
Publication:6165044
Cites work
- A survey of truncated-Newton methods
- A truncated Newton method with non-monotone line search for unconstrained optimization
- An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization
- Assessing a search direction within a truncated Newton method
- Inexact Newton Methods
- Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation
- Iterative computation of negative curvature directions in large scale optimization
- Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems
- 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
- Preconditioned nonlinear conjugate gradient methods based on a modified secant equation
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Trust Region Methods
This page was built for publication: An Improvement of the Pivoting Strategy in the Bunch and Kaufman Decomposition, Within Truncated Newton Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6165044)
