A note on global convergence result for conjugate gradient methods

DOI10.1007/s11741-001-0020-xzbMath1050.90026OpenAlexW1963743619MaRDI QIDQ2741563

Yan-Qin Bai

Publication date: 25 June 2003

Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11741-001-0020-x

zbMATH Keywords

global convergenceconjugate gradient algorithmdescent propertyrestarting

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (4)

A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods ⋮ A Conjugate Gradient Method Based on a Modified Secant Relation for Unconstrained Optimization ⋮ Two hybrid nonlinear conjugate gradient methods based on a modified secant equation ⋮ A hybrid conjugate gradient method based on a quadratic relaxation of the Dai–Yuan hybrid conjugate gradient parameter

Cites Work

• Unnamed Item
• Global convergence result for conjugate gradient methods
• Convergence Properties of Algorithms for Nonlinear Optimization
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Function minimization by conjugate gradients

This page was built for publication: A note on global convergence result for conjugate gradient methods