A Novel hybridization of CG-techniques for Solving Unconstrained Optimization Problems
Conjugate gradient methods are an extremely helpful way for handling large scale non-linear optimization issues. In this paper, based on the three famous Dai-yuan (DY), Liu–Storey (LS)and Conjugate-Descent (CD) conjugate gradient methods, a new hybrid CG method is proposed. Under strong wolf line s...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
College of Education for Pure Sciences
2025-03-01
|
| Series: | Wasit Journal for Pure Sciences |
| Online Access: | https://wjps.uowasit.edu.iq/index.php/wjps/article/view/657 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Conjugate gradient methods are an extremely helpful way for handling large scale non-linear optimization issues. In this paper, based on the three famous Dai-yuan (DY), Liu–Storey (LS)and Conjugate-Descent (CD) conjugate gradient methods, a new hybrid CG method is proposed. Under strong wolf line search, we prove the sufficient descent and global convergence features. The new formula is more efficient than other traditional conjugate gradient approaches, according to numerical results.
|
|---|---|
| ISSN: | 2790-5233 2790-5241 |