A New Conjugate Gradient Algorithm using Kafaki and Gambry Coefficient in Unconstrained Optimization
In this paper, a new conjugate gradient formula using Kafaki and Gambry is proposed. And we give the global convergence of new method.<br />Also we give descent and sufficient descent conditions.<br />Numerical results, show that this new formula is more efficient for solving unconstrain...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Published: |
College of Education for Pure Sciences,
2019-09-01T00:00:00Z.
|
| Subjects: | |
| Online Access: | Connect to this object online. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper, a new conjugate gradient formula using Kafaki and Gambry is proposed. And we give the global convergence of new method.<br />Also we give descent and sufficient descent conditions.<br />Numerical results, show that this new formula is more efficient for solving unconstrained optimization problems comparing with other method (H/S),depending on the iterations and the number of functions evaluation. |
|---|---|
| Item Description: | 1812-125X 2664-2530 10.33899/edusj.2019.162953 |