New class of hybrid conjugate gradient coefficients with guaranteed descent and efficient line search
Hybrid conjugate gradient (CG) techniques are one of the most prominent procedure for obtaining the solution of large-scale unconstrained optimization problems. This is due to its simplicity, global convergence, and low memory requirement. Numerous modifications have been done recently to improve...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | http://eprints.unisza.edu.my/2012/1/FH03-FIK-19-35707.pdf http://eprints.unisza.edu.my/2012/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Sultan Zainal Abidin |
| Language: | English |
| Summary: | Hybrid conjugate gradient (CG) techniques are one of the most prominent procedure for obtaining the solution of
large-scale unconstrained optimization problems. This is due to its simplicity, global convergence, and low memory
requirement. Numerous modifications have been done recently to improve the performance of these methods. In this
paper, we proposed new class of hybrid CG coefficients with guaranteed descent under exact line search. Numerical
results are presented to illustrate the efficiency of the proposed methodscompared to other classical CG coefficients. |
|---|