- 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
New Scale Dai-Yaun Conjugate Gradient Method for Unconstrained Optimization | ||
| AL-Rafidain Journal of Computer Sciences and Mathematics | ||
| Article 3, Volume 10, Issue 4, 2013, Pages 29-41 PDF (503.65 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.33899/csmj.2013.163544 | ||
| Author | ||
| Hamsa Th. Chilmerane | ||
| Department of Mathematics, College of Computers Sciences and Mathematics University of Mosul, IRAQ | ||
| Abstract | ||
| Conjugate gradient algorithm is widely used for solving large-scale unconstrained optimization problems, because they do not need the storage of matrices. In this paper, we suggest a modified Dai-Yuan conjucay coefficient of conjugate gradient algorithm and propose new spectral form three-term conjugate gradient algorithm. These algorithms are used inexact line searches and Wolf line search conditions. These algorithms satisfied sufficient descent condition and the converge globally are provided under some assumptions. The numerical results indicate that the proposed algorithm is very effective and the new spectral algorithm is of very robust results depending on iterations and the number of known functions. | ||
| Keywords | ||
| Conjugate gradient; inexact line search; conjugacy coefficient | ||
|
Statistics Article View: 336 PDF Download: 277 |
||