A Modified Nprp Nonlinear Conjugate Gradient Method With Global Convergence Properties

Conjugate gradient method (cg),is one of many methods used to solve large scale optimization problems in many fields. in fact memory storage and speed of the algorithm to reach the optimum solution for general nonlinear unconstrained optimization functions are our goals. in this paper,we modified a new efficient method passes the sufficient decent condition,and it has global convergence under exact line search and strong wolfe line search. furthermore the numerical results to find the optimum solution of some test functions show the new modification has the best results in cpu time,and the number of iteration when it comparing with other conventional methods.