Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems
This paper introduces two Dai-Liao-type methods by modifying the conjugate gradient parameter for unconstrained optimization problems. The convergence for uniformly convex objective functions is established. The efficiency of the proposed methods are illustrated by some numerical results.
scientific article; zbMATH DE number 6819195