On the Strong Convergence of a Sufficient Descent Polak-Ribière-Polyak Conjugate Gradient Method
Keyword(s):
Recently, Zhang et al. proposed a sufficient descent Polak-Ribière-Polyak (SDPRP) conjugate gradient method for large-scale unconstrained optimization problems and proved its global convergence in the sense thatlim infk→∞∥∇f(xk)∥=0when an Armijo-type line search is used. In this paper, motivated by the line searches proposed by Shi et al. and Zhang et al., we propose two new Armijo-type line searches and show that the SDPRP method has strong convergence in the sense thatlimk→∞∥∇f(xk)∥=0under the two new line searches. Numerical results are reported to show the efficiency of the SDPRP with the new Armijo-type line searches in practical computation.
2018 ◽
Vol 7
(3.28)
◽
pp. 92
2018 ◽
Vol 13
(03)
◽
pp. 2050059
2011 ◽
Vol 218
(5)
◽
pp. 1577-1586
◽
2011 ◽
Vol 18
(9)
◽
pp. 1249-1253
◽
2019 ◽
Vol 38
(7)
◽
pp. 227-231