Development a Hybrid Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems

Abstract

In this paper, a new hybrid nonlinear conjugate gradient method are presented, which produce sufficient descent search direction at every iteration. This method showed globally convergent under some assumptions. The numerical results show that all this new hybrid method are efficient for the given test problems.

Keywords

• gradient algorithm
• problems
• hybridizations
• quasi-newton methods