Three-terms conjugate gradient algorithm based on the Dai-Liao and the Powell symmetric methods

Based on the Dai-Laio and Powell symmetric methods, we developed a new three – term conjugate gradient method for solving large-scale unconstrained optimization problem. The suggested method satisfies both the descent condition and the conjugacy condition. For uniformly convex function, under standard assumption the global convergence of thealgorithm is proved. Finally, some numerical results of the proposed method are given.