Full Text: PDF
Received June 10, 2019; Accepted February 25, 2020; Published March 20, 2020
Abstract. In this paper, we propose a new hybrid conjugate gradient method for solving unconstrained optimization problems. This method is obtained from a convex combination of DY and BA methods. Under some conditions, our method has the sufficient descent and global convergence property. Preliminary numerical results also show that our method is robust and effective.
How to Cite this Article:
Amira Hamdi, Badreddine Sellami, Mohammed Bellofi, A new hybrid conjugate gradient method as a convex combination of DY and BA methods, Communications in Optimization Theory, Vol. 2020 (2020), Article ID 5, pp. 1-9.