Volume 11 - Issue 1 (1) | PP: 1 - 9
Language : English
DOI : https://doi.org/10.31559/glm2021.11.1.1
DOI : https://doi.org/10.31559/glm2021.11.1.1
825
68
Global convergence of new three terms conjugate gradient for unconstrained optimization
| Received Date | Revised Date | Accepted Date | Publication Date |
| 15/7/2021 | 18/8/2021 | 25/8/2021 | 26/10/2021 |
Abstract
n this paper, a new formula of 𝛽𝑘 is suggested for the conjugate gradient method of solving unconstrained optimization problems based on three terms and step size of cubic. Our new proposed CG method has descent condition, sufficient descent condition, conjugacy condition, and global convergence properties. Numerical comparisons with two standard conjugate gradient algorithms show that this algorithm is very effective depending on the number of iterations and the number of functions evaluated.
How To Cite This Article
Mustafa , A. A. & Shareef , S. G. (2021). Global convergence of new three terms conjugate gradient for unconstrained optimization . General Letters in Mathematics, 11 (1), 1-9, 10.31559/glm2021.11.1.1
Copyright © 2024, This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.