Linear Convergence of the Conjugate Gradient Method

DOI10.1147/RD.164.0431MaRDI QIDQ5679638zbMATH OpenOpenAlexFDO

Authors Harlan P. Crowder, Philip Wolfe

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)

Cited in

(26)

• Computational experience with conjugate gradient algorithms
• Convergence properties of the Beale-Powell restart algorithm
• Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
• \(n\)-step quadratic convergence of a restart Liu-Storey type method
• Alternative proofs of the convergence properties of the conjugate- gradient method
• Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions
• Rate of convergence of a restarted CG-DESCENT method
• Nonlinear conjugate gradient methods for the optimal control of laser surface hardening
• A fast and robust unconstrained optimization method requiring minimum storage
• The convergence rate of a restart MFR conjugate gradient method with inexact line search
• 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
• The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems
• Practical convergence conditions for unconstrained optimization
• A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations
• \(n\)-step quadratic convergence of the MPRP method with a restart strategy
• A family of accelerated hybrid conjugate gradient method for unconstrained optimization and image restoration
• Spherical designs for function approximation and beyond
• An adaptive restarting RMIL conjugate gradient method and its hybrid version: global convergence and iterative complexity analyses
• Derivative-free projection CG-based algorithm with restart strategy for solving convex-constrained nonlinear monotone equations and its application to logistic regression
• Two hybrid conjugate gradient based algorithms on Riemannian manifolds with adaptive restart strategy for nonconvex optimization problems
• Regularized step directions in nonlinear conjugate gradient methods
• The Dai-Liao conjugate gradient method with strong convergence and its application in image restoration and machine learning
• A restart derivative-free algorithm for solving pseudomonotone equations
• Restarting two-term nonlinear conjugate gradient methods based on a finite precision arithmetic analysis

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5679638)