- 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 modified of Dai and Yuan method for solving unconstrained optimization problems | ||
| AL-Rafidain Journal of Computer Sciences and Mathematics | ||
| Article 3, Volume 18, Issue 2, December 2024, Pages 20-26 PDF (720.71 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.33899/csmj.2024.146806.1108 | ||
| Authors | ||
| Hussein Kurdosh Aljarjary* 1; Khalil K. Abbo2; Edrees M. Nori Mahmood3 | ||
| 1تربية نينوى | ||
| 2College of Basic Education, University of Telafer ,Iraq | ||
| 3College of Computers Sciences and Mathematics, University of Mosul ,Iraq | ||
| Abstract | ||
| The Conjugate Gradient (CG) method is a widely used and efficient approach for solving large-scale unconstrained optimization problems due to its simplicity and low memory demands. Despite its success, ongoing research seeks to enhance its performance and robustness. This paper proposes a novel parameter modification to the classical Dai-Yuan CG formula, aiming to improve numerical behavior, reduce iteration counts, and boost convergence speed and stability. Theoretical analysis confirms that the new method ensures strong global convergence and descent properties. | ||
| Keywords | ||
| Conjugate gradient method; global convergence; sufficient descent condition | ||
|
Statistics Article View: 191 PDF Download: 88 |
||