A Conjugate Gradient Method with Global Convergence for Large-Scale Unconstrained Optimization Problems
Keyword(s):
The conjugate gradient (CG) method has played a special role in solving large-scale nonlinear optimization problems due to the simplicity of their very low memory requirements. This paper proposes a conjugate gradient method which is similar to Dai-Liao conjugate gradient method (Dai and Liao, 2001) but has stronger convergence properties. The given method possesses the sufficient descent condition, and is globally convergent under strong Wolfe-Powell (SWP) line search for general function. Our numerical results show that the proposed method is very efficient for the test problems.
2020 ◽
Vol 18
(1)
◽
pp. 525
2014 ◽
Vol 2014
◽
pp. 1-9
◽
2011 ◽
Vol 18
(9)
◽
pp. 1249-1253
◽
2018 ◽
Vol 7
(3.28)
◽
pp. 92
2018 ◽
Vol 13
(03)
◽
pp. 2050059