Two optimal Dai–Liao conjugate gradient methods
DOI10.1080/02331934.2014.938072zbMath1386.65158OpenAlexW1981529857WikidataQ57952725 ScholiaQ57952725MaRDI QIDQ3453402
Saman Babaie-Kafaki, Reza Ghanbari
Publication date: 27 November 2015
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2014.938072
unconstrained optimizationglobal convergencelarge-scale optimizationcondition numberconjugate gradient method
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Methods of quasi-Newton type (90C53) Numerical methods based on nonlinear programming (49M37) Numerical computation of matrix norms, conditioning, scaling (65F35) Methods of reduced gradient type (90C52)
Related Items
Cites Work
- Optimization theory and methods. Nonlinear programming
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- Algorithm 851
- Technical Note—A Modified Conjugate Gradient Algorithm
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Some descent three-term conjugate gradient methods and their global convergence
- CUTEr and SifDec
- A descent family of Dai–Liao conjugate gradient methods
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Benchmarking optimization software with performance profiles.