This paper presents a new restarting conjugate gradient algorithm for unconstrained optimization problem: min f(x),x∈Rn. This algorithm used a generalized Curry linesearch, parameter βk can be selected in a finite closed interval. Especially,it is allowed that βk is negative. The global convergence of this algorithms is proved under weaker conditions. |