A robust spectral three-term conjugate gradient algorithm for solving unconstrained minimization
Joint Authors
Abbas, Sabirin M.
al-Bayati, Abbas Y.
Source
al- Rafidain Journal of Computer Sciences and Mathematics
Issue
Vol. 13, Issue 1 (30 Jun. 2019), pp.87-104, 18 p.
Publisher
University of Mosul College of Computer Science and Mathematics
Publication Date
2019-06-30
Country of Publication
Iraq
No. of Pages
18
Main Subjects
Topics
Abstract EN
In this paper, we investigated a new improved Conjugate Gradient (CG) algorithm of a Three-Term type (TTCG) based on Dai and Liao procedure to improve the CG algorithm of (Hamoda, Rivaie, and Mamat / HRM).
The new CG-algorithm satisfies both the conjugacy condition and the sufficient descent condition.
The step-size of this TTCG-algorithm would be computed by accelerating the Wolfe-Powell line search technique.
The proposed new TTCG algorithms have demonstrated their global affinity in certain specific circumstances given in this paper.
American Psychological Association (APA)
al-Bayati, Abbas Y.& Abbas, Sabirin M.. 2019. A robust spectral three-term conjugate gradient algorithm for solving unconstrained minimization. al- Rafidain Journal of Computer Sciences and Mathematics،Vol. 13, no. 1, pp.87-104.
https://search.emarefa.net/detail/BIM-896212
Modern Language Association (MLA)
al-Bayati, Abbas Y.& Abbas, Sabirin M.. A robust spectral three-term conjugate gradient algorithm for solving unconstrained minimization. al- Rafidain Journal of Computer Sciences and Mathematics Vol. 13, no. 1 (2019), pp.87-104.
https://search.emarefa.net/detail/BIM-896212
American Medical Association (AMA)
al-Bayati, Abbas Y.& Abbas, Sabirin M.. A robust spectral three-term conjugate gradient algorithm for solving unconstrained minimization. al- Rafidain Journal of Computer Sciences and Mathematics. 2019. Vol. 13, no. 1, pp.87-104.
https://search.emarefa.net/detail/BIM-896212
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 103-104
Record ID
BIM-896212
