On the Strong Convergence of a Sufficient Descent Polak-Ribière-Polyak Conjugate Gradient Method
Joint Authors
Source
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-02-23
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
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 infk→∞∥∇f(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 limk→∞∥∇f(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.
American Psychological Association (APA)
Sun, Min& Liu, Jing. 2014. On the Strong Convergence of a Sufficient Descent Polak-Ribière-Polyak Conjugate Gradient Method. Abstract and Applied Analysis،Vol. 2014, no. 2014, pp.1-7.
https://search.emarefa.net/detail/BIM-1013635
Modern Language Association (MLA)
Sun, Min& Liu, Jing. On the Strong Convergence of a Sufficient Descent Polak-Ribière-Polyak Conjugate Gradient Method. Abstract and Applied Analysis No. 2014 (2014), pp.1-7.
https://search.emarefa.net/detail/BIM-1013635
American Medical Association (AMA)
Sun, Min& Liu, Jing. On the Strong Convergence of a Sufficient Descent Polak-Ribière-Polyak Conjugate Gradient Method. Abstract and Applied Analysis. 2014. Vol. 2014, no. 2014, pp.1-7.
https://search.emarefa.net/detail/BIM-1013635
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1013635