New Hybrid Conjugate Gradient Method as a Convex Combination of Liu-Storey and Dixon Methods

Abstract

In this paper we consider a new hybrid conjugate gradient algorithm, which is convex combination of the Liu-Story algorithm and Dixon algorithm, the descent property and global convergence are proved for the new suggested method. Numerical comparisons show that the present method often behaves better than Liu-Storey and Dixon methods.