Abstract
In this paper we have investigate a new class of conjugate gradient algorithms for unconstrained non- linear optimization which employ inexact line searches and designed for general use. Some theoretical results are investigated which ensure the local convergence of the new proposed algorithms and they compared numerically with the standard HS-CG algorithm(Hestenes & Stiefel ,1952) using a number of test functions for the dimensions between 2 to 400 with some promising numerical results .
Keywords