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: | Hawraz Jabbar |
|---|---|
| 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!
|
Similar Items
-
In Accurate CG-Algorithm for Unconstrained Optimization Problems
by: Nidhal Al-Assady, et al.
Published: (2004-05-01) -
New Parameter of CG-Method for Unconstrained Optimization
by: Hamsa Chilmeran, et al.
Published: (2019-06-01) -
Investigation on Scaled CG-Type Algorithms for Unconstrained Optimization
by: Abbas Al-Bayati, et al.
Published: (2007-12-01) -
Modified the CG-Algorithm for Unconstrained Non-Linear Optimization by Using Oren’s Update
by: Abbas Al-Bayati, et al.
Published: (2005-12-01) -
A New Hybrid of DY and CGSD Conjugate Gradient Methods for Solving Unconstrained Optimization Problems
by: Zeyad Mohammed Abdullah, et al.
Published: (2021-09-01)