Conjugate direction methods with variable storage
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3120437 (Why is no real title available?)
- A Relationship between the BFGS and Conjugate Gradient Algorithms and Its Implications for New Algorithms
- A combined conjugate-gradient quasi-Newton minimization algorithm
- A conjugate direction algorithm without line searches
- Conjugate Gradient Algorithms: Quadratic Termination without Linear Searches
- Conjugate Gradient Methods with Inexact Searches
- Extending the relationship between the conjugate gradient and BFGS algorithms
- Function minimization by conjugate gradients
- Methods of conjugate gradients for solving linear systems
- Quasi-Newton Methods, Motivation and Theory
- Restart procedures for the conjugate gradient method
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Updating Quasi-Newton Matrices with Limited Storage
Cited in
(5)- A nonlinearly preconditioned conjugate gradient algorithm for rank-R canonical tensor approximation.
- Updating Quasi-Newton Matrices with Limited Storage
- On diagonally-preconditioning the 2-step BFGS method with accumulated steps for linearly constrained nonlinear programming
- On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming
- Inertia-preserving secant updates
This page was built for publication: Conjugate direction methods with variable storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3941206)
