A robust spectral three-term conjugate gradient algorithm for solving unconstrained minimization

الملخص EN

In this paper, we investigated a new improved Conjugate Gradient (CG) algorithm of a Three-Term type (TTCG) based on Dai and Liao procedure to improve the CG algorithm of (Hamoda, Rivaie, and Mamat / HRM).

The new CG-algorithm satisfies both the conjugacy condition and the sufficient descent condition.

The step-size of this TTCG-algorithm would be computed by accelerating the Wolfe-Powell line search technique.

The proposed new TTCG algorithms have demonstrated their global affinity in certain specific circumstances given in this paper.