GLOBAL CONVERGENCE OF TWO KINDS OF THREE-TERM CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH
2013 ◽
Vol 30
(01)
◽
pp. 1250043
Keyword(s):
The conjugate gradient method is widely used in unconstrained optimization, especially for large-scale problems. Recently, Zhang et al. proposed a three-term PRP method (TTPRP) and a three-term HS method (TTHS), both of which can produce sufficient descent conditions. In this paper, the global convergence of the TTPRP and TTHS methods is studied, in which the line search procedure is replaced by a fixed formula of stepsize. This character is of significance when the line search is expensive in some particular applications. In addition, relevant computational results are also presented.
2005 ◽
Vol 22
(04)
◽
pp. 529-538
◽
2011 ◽
Vol 88
(16)
◽
pp. 3436-3447
◽
2008 ◽
Vol 23
(2)
◽
pp. 275-293
◽
2008 ◽
Vol 4
(3)
◽
pp. 565-579
◽
2013 ◽
Vol 33
(2)
◽
pp. 333-347
◽
Keyword(s):