Solving Large-Scale Unconstrained Optimization Problems with an Efficient Conjugate Gradient Class
The main goal of this paper is to introduce an appropriate conjugate gradient class to solve unconstrained optimization problems. The presented class enjoys the benefits of having three free parameters, its directions are descent, and it can fulfill the Dai–Liao conjugacy condition. Global convergen...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2024/5548724 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832558568471003136 |
|---|---|
| author | Sanaz Bojari Mahmoud Paripour |
| author_facet | Sanaz Bojari Mahmoud Paripour |
| author_sort | Sanaz Bojari |
| collection | DOAJ |
| description | The main goal of this paper is to introduce an appropriate conjugate gradient class to solve unconstrained optimization problems. The presented class enjoys the benefits of having three free parameters, its directions are descent, and it can fulfill the Dai–Liao conjugacy condition. Global convergence property of the new class is proved under the weak-Wolfe–Powell line search technique. Numerical efficiency of the proposed class is confirmed in three sets of experiments including 210 test problems and 11 disparate conjugate gradient methods. |
| format | Article |
| id | doaj-art-1319cf3ab555466cb883430f08c40be4 |
| institution | Kabale University |
| issn | 2314-4785 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Mathematics |
| spelling | doaj-art-1319cf3ab555466cb883430f08c40be42025-02-03T01:31:59ZengWileyJournal of Mathematics2314-47852024-01-01202410.1155/2024/5548724Solving Large-Scale Unconstrained Optimization Problems with an Efficient Conjugate Gradient ClassSanaz Bojari0Mahmoud Paripour1Department of Basic ScienceDepartment of Computer Engineering and Information TechnologyThe main goal of this paper is to introduce an appropriate conjugate gradient class to solve unconstrained optimization problems. The presented class enjoys the benefits of having three free parameters, its directions are descent, and it can fulfill the Dai–Liao conjugacy condition. Global convergence property of the new class is proved under the weak-Wolfe–Powell line search technique. Numerical efficiency of the proposed class is confirmed in three sets of experiments including 210 test problems and 11 disparate conjugate gradient methods.http://dx.doi.org/10.1155/2024/5548724 |
| spellingShingle | Sanaz Bojari Mahmoud Paripour Solving Large-Scale Unconstrained Optimization Problems with an Efficient Conjugate Gradient Class Journal of Mathematics |
| title | Solving Large-Scale Unconstrained Optimization Problems with an Efficient Conjugate Gradient Class |
| title_full | Solving Large-Scale Unconstrained Optimization Problems with an Efficient Conjugate Gradient Class |
| title_fullStr | Solving Large-Scale Unconstrained Optimization Problems with an Efficient Conjugate Gradient Class |
| title_full_unstemmed | Solving Large-Scale Unconstrained Optimization Problems with an Efficient Conjugate Gradient Class |
| title_short | Solving Large-Scale Unconstrained Optimization Problems with an Efficient Conjugate Gradient Class |
| title_sort | solving large scale unconstrained optimization problems with an efficient conjugate gradient class |
| url | http://dx.doi.org/10.1155/2024/5548724 |
| work_keys_str_mv | AT sanazbojari solvinglargescaleunconstrainedoptimizationproblemswithanefficientconjugategradientclass AT mahmoudparipour solvinglargescaleunconstrainedoptimizationproblemswithanefficientconjugategradientclass |