Linear Convergence of the Conjugate Gradient Method

DOI10.1147/rd.164.0431zbMath0263.65068OpenAlexW2061127301MaRDI QIDQ5679638

Philip Wolfe, Harlan P. Crowder

Publication date: 1972

Published in: IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1147/rd.164.0431

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Related Items (17)

Nonlinear conjugate gradient methods for the optimal control of laser surface hardening ⋮ \(n\)-step quadratic convergence of a restart Liu-Storey type method ⋮ The convergence rate of a restart MFR conjugate gradient method with inexact line search ⋮ A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations ⋮ Computational experience with conjugate gradient algorithms ⋮ Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. ⋮ \(n\)-step quadratic convergence of the MPRP method with a restart strategy ⋮ Practical convergence conditions for unconstrained optimization ⋮ Convergence conditions for restarted conjugate gradient methods with inaccurate line searches ⋮ Some convergence properties of the conjugate gradient method ⋮ Restart procedures for the conjugate gradient method ⋮ Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions ⋮ Convergence properties of the Beale-Powell restart algorithm ⋮ Alternative proofs of the convergence properties of the conjugate- gradient method ⋮ The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems ⋮ Rate of Convergence of a Restarted CG-DESCENT Method ⋮ A fast and robust unconstrained optimization method requiring minimum storage

This page was built for publication: Linear Convergence of the Conjugate Gradient Method