On the convergence of conjugate gradient algorithms

DOI10.1093/imanum/14.3.443zbMath0830.65052OpenAlexW1964354226MaRDI QIDQ4304824

Radosław Pytlak

Publication date: 31 August 1994

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imanum/14.3.443

zbMATH Keywords

convergencenumerical examplesunconstrained minimizationconjugate gradient algorithmsWolfe-Lemarechal methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06)

Related Items (8)

A conjugate gradient type method for the nonnegative constraints optimization problems ⋮ Method of conjugate subgradients with constrained memory ⋮ GLOBAL CONVERGENCE OF SHORTEST-RESIDUAL FAMILY OF CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH ⋮ On the method of shortest residuals for unconstrained optimization ⋮ A new class of projection and contraction methods for solving variational inequality problems ⋮ Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization ⋮ Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints ⋮ Convergence of conjugate gradient methods with constant stepsizes

This page was built for publication: On the convergence of conjugate gradient algorithms