Two hybrid conjugate gradient method and its global convergence for unconstrained optimization

In this paper, we propose two hybrid conjugate gradient methods, which produce sufficient descent direction at every iteration. The theoretical analysis shows that the algorithm is global convergence under some suitable conditions. The numerical results show that both hybrid algorithms are efficient for the given test problems from the Matlab library.