A new hybrid conjugates gradient algorithm for unconstraint optimization problems

  • Maha S. Younis University of Mosul
  • Basma Tareq Department of Mathematics College of Education for Pure Science University of Mosul
Keywords: Unconstrained Optimization, Conjugate gradient method, the descent property, Global convergence, Hybrid conjugate gradient method, SWC

Abstract

In this paper, we present a new hybrid conjugate gradient strategy that is both efficient and effective for solving unconstrained optimization problems. The parameter  is derived from a convex combination of the  and the  conjugate gradient methods. We demonstrated that this strategy is globally convergent under strong Wolfe line search conditions, and that the recommended hybrid CG method is capable of creating a descending search direction at each iteration. Numerical results are presented in this study, demonstrating that the proposed technique is both efficient and promising.

Submitted
2022-05-24
Accepted
2022-07-30
How to Cite
S. Younis, M., & Basma Tareq. (2022). A new hybrid conjugates gradient algorithm for unconstraint optimization problems. International Journal of Engineering Technology and Natural Sciences, 4(1). https://doi.org/10.46923/ijets.v4i1.148