Further insight into the convergence of the Fletcher-Reeves method

DOI10.1007/BF02880382zbMath0958.65074MaRDI QIDQ1974184

Yu-Hong Dai

Publication date: 7 May 2000

Published in: Science in China. Series A (Search for Journal in Brave)

zbMATH Keywords

unconstrained optimizationglobal convergencecounterexampleArmijo line searchesFletcher-Reeves conjugate gradient methodgeneralized line searchWolfe line searches

Mathematics Subject Classification ID

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

Related Items

Global convergence properties of the two new dependent Fletcher-Reeves conjugate gradient methods, Convergence properties of the dependent PRP conjugate gradient methods, A class of one parameter conjugate gradient methods, New three-term conjugate gradient method with guaranteed global convergence, Conjugate gradient methods with Armijo-type line searches., Global convergence of the Dai-Yuan conjugate gradient method with perturbations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence property of the DFP algorithm
• Efficient hybrid conjugate gradient techniques
• Global convergence result for conjugate gradient methods
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Convergence properties of the Fletcher-Reeves method
• Function minimization by conjugate gradients
• Global convergence property of \(s\)-dependent GFR conjugate gradient method