Back to Search
Start Over
The spectral form of the Dai-Yuan conjugate gradient algorithm
- Source :
- المجلة العراقية للعلوم الاحصائية, Vol 11, Iss 2, Pp 214-221 (2011)
- Publication Year :
- 2011
- Publisher :
- College of Computer Science and Mathematics, University of Mosul, 2011.
-
Abstract
- Conjugate Gradient (CG) methods comprise a class of unconstrained optimization algorithms which are characterized by low memory requirements and strong local and global convergence properties. Most of CG methods do not always generate a descent search directions, so the descent or sufficient descent condition is usually assumed in the analysis and implementations. By assuming a descent and pure conjugacy conditions a new version of spectral Dai-Yuan (DY) non-linear conjugate gradient method introduced in this article. Descent property for the suggested method is proved and numerical tests and comparisons with other methods for large-scale unconstrained problems are given.
- Subjects :
- Probabilities. Mathematical statistics
QA273-280
Subjects
Details
- Language :
- Arabic, English
- ISSN :
- 1680855X and 26642956
- Volume :
- 11
- Issue :
- 2
- Database :
- Directory of Open Access Journals
- Journal :
- المجلة العراقية للعلوم الاحصائية
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.552bac8991224d0dbbf7d2d23e62ba9d
- Document Type :
- article
- Full Text :
- https://doi.org/10.33899/iqjoss.2011.27906