- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
A Robust Spectral Three-Term Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems | ||
| AL-Rafidain Journal of Computer Sciences and Mathematics | ||
| Article 6, Volume 13, Issue 1, 2019, Pages 87-104 PDF (595.98 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.33899/csmj.2020.163504 | ||
| Authors | ||
| Abbas Y. Al-Bayati1; Sabreen M. Abbas2 | ||
| 1University of Telafer, Telafer, Iraq | ||
| 2College of Computer Science and Mathematics University of Mosul, Mosul, Iraq | ||
| Abstract | ||
| 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. | ||
| Keywords | ||
| Three-Term Conjugate Gradient; Scaling Parameter; Conjugacy Property; Search Directions; Large Dimensions; Wolfe-Powell Line Search | ||
|
Statistics Article View: 485 PDF Download: 432 |
||