New conjugacy condition with pair-conjugate gradient methods for unconstrained optimization
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
Mosul University
2009-09-01
|
| Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
| Subjects: | |
| Online Access: | https://csmj.mosuljournals.com/article_163818_abe37be5528312a4ccb98eab5d28ecef.pdf |
| _version_ | 1828427557385535488 |
|---|---|
| author | Abbas Al-Bayati Huda Ahmed |
| author_facet | Abbas Al-Bayati Huda Ahmed |
| author_sort | Abbas Al-Bayati |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-10T17:04:00Z |
| format | Article |
| id | doaj.art-d77b7e44a4a444e98198098e7ed723dd |
| institution | Directory Open Access Journal |
| issn | 1815-4816 2311-7990 |
| language | Arabic |
| last_indexed | 2024-12-10T17:04:00Z |
| publishDate | 2009-09-01 |
| publisher | Mosul University |
| record_format | Article |
| series | Al-Rafidain Journal of Computer Sciences and Mathematics |
| spelling | doaj.art-d77b7e44a4a444e98198098e7ed723dd2022-12-22T01:40:30ZaraMosul UniversityAl-Rafidain Journal of Computer Sciences and Mathematics1815-48162311-79902009-09-0163213510.33899/csmj.2009.163818163818New conjugacy condition with pair-conjugate gradient methods for unconstrained optimizationAbbas Al-Bayati0Huda Ahmed1College of Computer Sciences and Mathematics University of Mosul, Mosul, IraqCollege of Computer Sciences and Mathematics University of Mosul/IraqConjugate 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.https://csmj.mosuljournals.com/article_163818_abe37be5528312a4ccb98eab5d28ecef.pdfunconstrained optimizationconjugate gradient methods |
| spellingShingle | Abbas Al-Bayati Huda Ahmed New conjugacy condition with pair-conjugate gradient methods for unconstrained optimization Al-Rafidain Journal of Computer Sciences and Mathematics unconstrained optimization conjugate gradient methods |
| title | New conjugacy condition with pair-conjugate gradient methods for unconstrained optimization |
| title_full | New conjugacy condition with pair-conjugate gradient methods for unconstrained optimization |
| title_fullStr | New conjugacy condition with pair-conjugate gradient methods for unconstrained optimization |
| title_full_unstemmed | New conjugacy condition with pair-conjugate gradient methods for unconstrained optimization |
| title_short | New conjugacy condition with pair-conjugate gradient methods for unconstrained optimization |
| title_sort | new conjugacy condition with pair conjugate gradient methods for unconstrained optimization |
| topic | unconstrained optimization conjugate gradient methods |
| url | https://csmj.mosuljournals.com/article_163818_abe37be5528312a4ccb98eab5d28ecef.pdf |
| work_keys_str_mv | AT abbasalbayati newconjugacyconditionwithpairconjugategradientmethodsforunconstrainedoptimization AT hudaahmed newconjugacyconditionwithpairconjugategradientmethodsforunconstrainedoptimization |