Modified Conjugate Gradient Method for Unconstrained Optimization

Abstract

Conjugate gradient method holds an important role in solving unconstrained Optimizations, especially for large scale problems. Numerous studies and modific ations have been done to improve this method. In this paper, we propose a new conjugate gradient meth od which is computed by modifying Dai and Yuan formula. This new � k formula for the denominator is introduced and the numerator of Dai and Yuan for mula is retrained, but still possesses global converge nce properties. Numerical results based on number of iterations and number of function evaluations by usin g exact line search have shown that the new formul a is an efficient when we comparative it with the oth er conjugate gradient methods.