New three-term CG-method for unconstrained optimization

الملخص EN

In this paper, we proposed a new three-term nonlinear Conjugate Gradient (CG) method for solving unconstrained optimization problems.

The new three-term method generates decent direction with an inexact line search under Wolfe conditions and the descent property of the new method is proved.

Numerical results on some well-known test function with various dimensions showed that the new method is an efficient.