Global convergence property of \(s\)-dependent GFR conjugate gradient method
From MaRDI portal
Publication:5955943
DOI10.1007/BF03186984zbMath0991.65052OpenAlexW2062423513MaRDI QIDQ5955943
Publication date: 18 February 2002
Published in: Chinese Science Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03186984
unconstrained optimizationglobal convergencegeneralized conjugate gradient methodgeneralized Fletcher-Reeves methodGFRlinear searchstep length
Related Items (3)
Global convergence properties of the two new dependent Fletcher-Reeves conjugate gradient methods ⋮ Further insight into the convergence of the Fletcher-Reeves method ⋮ Conjugate gradient methods with Armijo-type line searches.
Cites Work
- Unnamed Item
- Global convergence result for conjugate gradient methods
- An algorithm for continuous type optimal location problem
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Convergence properties of the Fletcher-Reeves method
This page was built for publication: Global convergence property of \(s\)-dependent GFR conjugate gradient method