- 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 conjugacy condition with pair-conjugate gradient methods for unconstrained optimization | ||
| AL-Rafidain Journal of Computer Sciences and Mathematics | ||
| Article 2, Volume 6, Issue 3, 2009, Pages 21-35 PDF (430.15 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.33899/csmj.2009.163818 | ||
| Authors | ||
| Abbas Y. Al-Bayati1; Huda I. Ahmed2 | ||
| 1College of Computer Sciences and Mathematics University of Mosul, Mosul, Iraq | ||
| 2College of Computer Sciences and Mathematics University of Mosul/Iraq | ||
| Abstract | ||
| Conjugate gradient methods are wildly used for unconstrained optimization especially when the dimension is large. In this paper we propose a new kind of nonlinear conjugate gradient methods which on the study of Dai and Liao (2001), the new idea is how to use the pair conjugate gradient method with this study (new cojugacy condition) which consider an inexact line search scheme but reduce to the old one if the line search is exact. Convergence analysis for this new method is provided. Our numerical results show that this new methods is very efficient for the given ten test function compared with other methods. | ||
| Keywords | ||
| unconstrained Optimization; Conjugate gradient methods | ||
|
Statistics Article View: 317 PDF Download: 218 |
||