EXTENSIONS OF THE HESTENES-STIEFEL AND POLAK-RIBIERE-POLYAK CONJUGATE GRADIENT METHODS WITH SUFFICIENT DESCENT PROPERTY

Using search directions of a recent class of three--term conjugate gradient methods, modified versions of the Hestenes-Stiefel and Polak-Ribiere-Polyak methods are proposed which satisfy the sufficient descent condition. The methods are shown to be globally convergent when the line search fulfills the (strong) Wolfe conditions. Numerical experiments are done on a set of CUTEr unconstrained optimization test problems. They demonstrate efficiency of the proposed methods in the sense of the Dolan-More performance profile.