Translator Disclaimer
2014 On the Strong Convergence of a Sufficient Descent Polak-Ribière-Polyak Conjugate Gradient Method
Min Sun, Jing Liu
Abstr. Appl. Anal. 2014: 1-7 (2014). DOI: 10.1155/2014/283215

Abstract

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 that lim infkf(xk)=0 when 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 that limkf(xk)=0 under 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.

Citation

Download Citation

Min Sun. Jing Liu. "On the Strong Convergence of a Sufficient Descent Polak-Ribière-Polyak Conjugate Gradient Method." Abstr. Appl. Anal. 2014 1 - 7, 2014. https://doi.org/10.1155/2014/283215

Information

Published: 2014
First available in Project Euclid: 2 October 2014

zbMATH: 07022086
MathSciNet: MR3176732
Digital Object Identifier: 10.1155/2014/283215

Rights: Copyright © 2014 Hindawi

JOURNAL ARTICLE
7 PAGES


SHARE
Vol.2014 • 2014
Back to Top