A Sufficient Descent 3-Term Conjugate Gradient Method for Unconstrained Optimization Algorithm
In recent years, 3-term conjugate gradient algorithms (TT-CG) have sparked interest for large scale unconstrained optimization algorithms due to appealing practical factors, such as simple computation, low memory requirement, better sufficient descent property, and strong global convergence propert...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Tikrit University
2023-12-01
|
| Series: | Tikrit Journal of Pure Science |
| Subjects: | |
| Online Access: | https://tjpsj.org/index.php/tjps/article/view/1292 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849320024183930880 |
|---|---|
| author | Ghada Moayid Al-Naemi Samaa AbdulQader |
| author_facet | Ghada Moayid Al-Naemi Samaa AbdulQader |
| author_sort | Ghada Moayid Al-Naemi |
| collection | DOAJ |
| description |
In recent years, 3-term conjugate gradient algorithms (TT-CG) have sparked interest for large scale unconstrained optimization algorithms due to appealing practical factors, such as simple computation, low memory requirement, better sufficient descent property, and strong global convergence property. In this study, minor changes were made to the BRB-CG method used for addressing the optimization algorithms discussed. Then, a new 3-term BRB-CG (MTTBRB) was presented. This new method solved large-scale unconstrained optimization problems. Despite the fact that the BRB algorithm achieved global convergence by employing a modified strong Wolfe line search, in this new MTTBRB-CG method the researchers employed the classical strong Wolfe-Powell condition (SWPC). This study also attempted to quantify how much better 3-term efficiency is than 2-term efficiency. As a result, in the numerical analysis, the new modification was compared to an effective 2-term CG- method. The numerical analysis demonstrated the effectiveness of the proposed method in solving optimization problems.
|
| format | Article |
| id | doaj-art-4e8cde049e964ecbb96315df60bc1247 |
| institution | Kabale University |
| issn | 1813-1662 2415-1726 |
| language | English |
| publishDate | 2023-12-01 |
| publisher | Tikrit University |
| record_format | Article |
| series | Tikrit Journal of Pure Science |
| spelling | doaj-art-4e8cde049e964ecbb96315df60bc12472025-08-20T03:50:16ZengTikrit UniversityTikrit Journal of Pure Science1813-16622415-17262023-12-0128610.25130/tjps.v28i6.1292A Sufficient Descent 3-Term Conjugate Gradient Method for Unconstrained Optimization AlgorithmGhada Moayid Al-Naemi0Samaa AbdulQader1Department of Mathematics, College of Computer Science and Mathematics, University of Mosul, Mosul, Iraq.Department of Mathematics, College of Computer Science and Mathematics, University of Mosul, Mosul, Iraq. In recent years, 3-term conjugate gradient algorithms (TT-CG) have sparked interest for large scale unconstrained optimization algorithms due to appealing practical factors, such as simple computation, low memory requirement, better sufficient descent property, and strong global convergence property. In this study, minor changes were made to the BRB-CG method used for addressing the optimization algorithms discussed. Then, a new 3-term BRB-CG (MTTBRB) was presented. This new method solved large-scale unconstrained optimization problems. Despite the fact that the BRB algorithm achieved global convergence by employing a modified strong Wolfe line search, in this new MTTBRB-CG method the researchers employed the classical strong Wolfe-Powell condition (SWPC). This study also attempted to quantify how much better 3-term efficiency is than 2-term efficiency. As a result, in the numerical analysis, the new modification was compared to an effective 2-term CG- method. The numerical analysis demonstrated the effectiveness of the proposed method in solving optimization problems. https://tjpsj.org/index.php/tjps/article/view/1292unconstrained optimization3-term conjugate gradient methodSWPCsufficient descent condition,global convergence. |
| spellingShingle | Ghada Moayid Al-Naemi Samaa AbdulQader A Sufficient Descent 3-Term Conjugate Gradient Method for Unconstrained Optimization Algorithm Tikrit Journal of Pure Science unconstrained optimization 3-term conjugate gradient method SWPC sufficient descent condition, global convergence. |
| title | A Sufficient Descent 3-Term Conjugate Gradient Method for Unconstrained Optimization Algorithm |
| title_full | A Sufficient Descent 3-Term Conjugate Gradient Method for Unconstrained Optimization Algorithm |
| title_fullStr | A Sufficient Descent 3-Term Conjugate Gradient Method for Unconstrained Optimization Algorithm |
| title_full_unstemmed | A Sufficient Descent 3-Term Conjugate Gradient Method for Unconstrained Optimization Algorithm |
| title_short | A Sufficient Descent 3-Term Conjugate Gradient Method for Unconstrained Optimization Algorithm |
| title_sort | sufficient descent 3 term conjugate gradient method for unconstrained optimization algorithm |
| topic | unconstrained optimization 3-term conjugate gradient method SWPC sufficient descent condition, global convergence. |
| url | https://tjpsj.org/index.php/tjps/article/view/1292 |
| work_keys_str_mv | AT ghadamoayidalnaemi asufficientdescent3termconjugategradientmethodforunconstrainedoptimizationalgorithm AT samaaabdulqader asufficientdescent3termconjugategradientmethodforunconstrainedoptimizationalgorithm AT ghadamoayidalnaemi sufficientdescent3termconjugategradientmethodforunconstrainedoptimizationalgorithm AT samaaabdulqader sufficientdescent3termconjugategradientmethodforunconstrainedoptimizationalgorithm |