Global convergence analysis of a new hybrid conjugate gradient method for unconstrained optimization problems
In this paper, we propose a new hybrid conjugate gradient method for unconstrained optimization problems. The proposed method comprises of beta (DY), beta (WHY), beta (RAMI) and beta (New). The beta (New) was constructed purposely for this proposed hybrid method.The method possesses sufficient des...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
Penerbit UTM Press
2017
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/80916/ http://dx.doi.org/10.11113/mjfas.v13n2.540 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper, we propose a new hybrid conjugate gradient method for unconstrained optimization problems. The proposed method comprises of beta (DY), beta (WHY), beta (RAMI) and beta (New). The beta (New) was constructed purposely for this proposed hybrid method.The method possesses sufficient descent property irrespective of the line search. Under Strong Wolfe-Powell line search, we proved that the method is globally convergent. Numerical experimentation shows the effectiveness and robustness of the proposed method when compare with some hybrid as well as some modified conjugate gradient methods. |
|---|