Some remarks on conjugate gradient methods without line search
From MaRDI portal
Recommendations
- Global convergence of a two-parameter family of conjugate gradient methods without line search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- scientific article; zbMATH DE number 7071347
- Global convergence of conjugate gradient methods without line search
- scientific article; zbMATH DE number 179266
Cites work
- A combined conjugate-gradient quasi-Newton minimization algorithm
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Relationship between the BFGS and Conjugate Gradient Algorithms and Its Implications for New Algorithms
- Conjugate Gradient Methods with Inexact Searches
- Function minimization by conjugate gradients
- Global convergence of a two-parameter family of conjugate gradient methods without line search
- Global convergence of conjugate gradient methods without line search
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 3591315 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- Methods of conjugate gradients for solving linear systems
- On the Convergence of a New Conjugate Gradient Algorithm
- QN-like variable storage conjugate gradients
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- Testing Unconstrained Optimization Software
- Two-Point Step Size Gradient Methods
- Updating Quasi-Newton Matrices with Limited Storage
Cited in
(2)
This page was built for publication: Some remarks on conjugate gradient methods without line search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q945376)