Optimal CD-DY Conjugate Gradient Methods with Sufficient Descent
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...
Main Authors: | , |
---|---|
Format: | Article |
Language: | Arabic |
Published: |
College of Computer Science and Mathematics, University of Mosul
2013-12-01
|
Series: | المجلة العراقية للعلوم الاحصائية |
Online Access: | https://stats.mosuljournals.com/article_84820_f8375a15f410288be53af175f929ab72.pdf |
_version_ | 1811337192833810432 |
---|---|
author | Abbas Y. Al-Bayati Hawraz N. Al-Khayat |
author_facet | Abbas Y. Al-Bayati Hawraz N. Al-Khayat |
author_sort | Abbas Y. Al-Bayati |
collection | DOAJ |
description | 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). |
first_indexed | 2024-04-13T17:51:30Z |
format | Article |
id | doaj.art-5f0517f46171425193fce1dc4c48e2bb |
institution | Directory Open Access Journal |
issn | 1680-855X 2664-2956 |
language | Arabic |
last_indexed | 2024-04-13T17:51:30Z |
publishDate | 2013-12-01 |
publisher | College of Computer Science and Mathematics, University of Mosul |
record_format | Article |
series | المجلة العراقية للعلوم الاحصائية |
spelling | doaj.art-5f0517f46171425193fce1dc4c48e2bb2022-12-22T02:36:40ZaraCollege of Computer Science and Mathematics, University of Mosulالمجلة العراقية للعلوم الاحصائية1680-855X2664-29562013-12-0113321023310.33899/iqjoss.2013.8482084820Optimal CD-DY Conjugate Gradient Methods with Sufficient DescentAbbas Y. Al-BayatiHawraz N. Al-KhayatConjugate 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).https://stats.mosuljournals.com/article_84820_f8375a15f410288be53af175f929ab72.pdf |
spellingShingle | Abbas Y. Al-Bayati Hawraz N. Al-Khayat Optimal CD-DY Conjugate Gradient Methods with Sufficient Descent المجلة العراقية للعلوم الاحصائية |
title | Optimal CD-DY Conjugate Gradient Methods with Sufficient Descent |
title_full | Optimal CD-DY Conjugate Gradient Methods with Sufficient Descent |
title_fullStr | Optimal CD-DY Conjugate Gradient Methods with Sufficient Descent |
title_full_unstemmed | Optimal CD-DY Conjugate Gradient Methods with Sufficient Descent |
title_short | Optimal CD-DY Conjugate Gradient Methods with Sufficient Descent |
title_sort | optimal cd dy conjugate gradient methods with sufficient descent |
url | https://stats.mosuljournals.com/article_84820_f8375a15f410288be53af175f929ab72.pdf |
work_keys_str_mv | AT abbasyalbayati optimalcddyconjugategradientmethodswithsufficientdescent AT hawraznalkhayat optimalcddyconjugategradientmethodswithsufficientdescent |