New Hybrid Conjugate Gradient Method as a Convex Combination of Dai–Liao and Wei–Yao–Liu

Abstract

In this research, a new method of hybrid conjugated gradient methods was developed. This method is based mainly on the hybridization of Dia-Laio and Wei-Yao-Liu algorithms, by using convex fitting and conjugate condition of line Uncontrolled search. The resulting algorithm fulfills the condition of sufficient proportions and has universal convergence under certain assumptions. The numerical results indicated the efficiency of this method in solving nonlinear test functions in the given unconstrained optimization.