Convergence of conjugate gradient methods with constant stepsizes
From MaRDI portal
Recommendations
Cites work
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Convergence properties of the Fletcher-Reeves method
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Function minimization by conjugate gradients
- Global convergence of conjugate gradient methods without line search
- Global convergence of the method of shortest residuals
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- scientific article; zbMATH DE number 3843083 (Why is no real title available?)
- scientific article; zbMATH DE number 3686229 (Why is no real title available?)
- scientific article; zbMATH DE number 1043533 (Why is no real title available?)
- Minimization of functions having Lipschitz continuous first partial derivatives
- On the convergence of conjugate gradient algorithms
- On the method of shortest residuals for unconstrained optimization
- Restart procedures for the conjugate gradient method
- The conjugate gradient method in extremal problems
Cited in
(7)- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- Convergence of conjugate gradient methods with a closed-form stepsize formula
- Global convergence of the method of shortest residuals
- Method of conjugate subgradients with constrained memory
- Convergence properties and step size estimation for MLMS algorithm
- Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method
- Two fundamental convergence theorems for nonlinear conjugate gradient methods and their applications
This page was built for publication: Convergence of conjugate gradient methods with constant stepsizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096886)
