TY - JOUR
T1 - A Linear Hybridization of Dai-Yuan and Hestenes-Stiefel Conjugate Gradient Method for Unconstrained Optimization
AU - Narayanan , Sindhu
AU - Kaelo , P.
JO - Numerical Mathematics: Theory, Methods and Applications
VL - 2
SP - 527
EP - 539
PY - 2021
DA - 2021/01
SN - 14
DO - http://doi.org/10.4208/nmtma.OA-2020-0056
UR - https://global-sci.org/intro/article_detail/nmtma/18610.html
KW - Unconstrained optimization, conjugate gradient method, global convergence.
AB - <p style="text-align: justify;">Conjugate gradient methods are interesting iterative methods that solve
large scale unconstrained optimization problems. A lot of recent research has thus
focussed on developing a number of conjugate gradient methods that are more effective. In this paper, we propose another hybrid conjugate gradient method as a linear
combination of Dai-Yuan (DY) method and the Hestenes-Stiefel (HS) method. The
sufficient descent condition and the global convergence of this method are established using the generalized Wolfe line search conditions. Compared to the other
conjugate gradient methods, the proposed method gives good numerical results and
is effective.</p>