Descent Symmetrization of the Dai–Liao Conjugate Gradient Method

DOI10.1142/S0217595916500081zbMath1341.15006DBLPjournals/apjor/Babaie-KafakiG16OpenAlexW2317259230WikidataQ57952621 ScholiaQ57952621MaRDI QIDQ2809315

Saman Babaie-Kafaki, Reza Ghanbari

Publication date: 27 May 2016

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595916500081

zbMATH Keywords

unconstrained optimizationglobal convergenceeigenvalueconjugate gradient methoddescent condition

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (2)

A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice ⋮ A one-parameter class of three-term conjugate gradient methods with an adaptive parameter choice

Uses Software

• CUTEr
• CG_DESCENT

Cites Work

• Unnamed Item
• Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
• Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
• Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
• The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
• A descent hybrid modification of the Polak–Ribière–Polyak conjugate gradient method
• A descent family of Dai–Liao conjugate gradient methods

This page was built for publication: Descent Symmetrization of the Dai–Liao Conjugate Gradient Method