Open AccessGlobal convergence of new three terms conjugate gradient for unconstrained optimization
Author(s) -
Ahmed Anwer Mustafa,
Salah Gazi Shareef
Publication year - 2021
Publication title -
general letters in mathematics
Language(s) - English
Resource type - Journals
eISSN - 2519-9277
pISSN - 2519-9269
DOI - 10.31559/glm2021.11.1.1
Subject(s) - conjugate gradient method , nonlinear conjugate gradient method , derivation of the conjugate gradient method , conjugate residual method , convergence (economics) , mathematics , gradient descent , conjugacy class , descent (aeronautics) , gradient method , conjugate , mathematical optimization , computer science , mathematical analysis , discrete mathematics , artificial neural network , machine learning , aerospace engineering , engineering , economics , economic growth
In 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.