- 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
Optimal CD-DY Conjugate Gradient Methods with Sufficient Descent | ||
| IRAQI JOURNAL OF STATISTICAL SCIENCES | ||
| Article 28, Volume 13, Issue 3, 2013, Pages 210-233 PDF (0 K) | ||
| DOI: 10.33899/iqjoss.2013.084820 | ||
| Authors | ||
| Abbas Y. Al-Bayati; Hawraz N. Al-Khayat | ||
| Abstract | ||
| Conjugate Gradient (CG) methods are widely used for large scale unconstrained optimization problems. Most of CG-methods don’t always generate a descent search direction, so the descent condition is usually assumed in the analysis and implementations. In this paper, we have studied several modified CG-methods based on the famous CD (CG-method), and show that our new proposed CG-methods produces sufficient descent and converges globally if the Wolfe conditions are satisfied. Moreover, they produces the original version of the CD (CG-method), if the line searches are exact. The numerical results show that the new methods are more effective and promising by comparing with the standard CD and DY (CG-methods). | ||
|
Statistics Article View: 388 PDF Download: 194 |
||