Partial conjugate gradient method - The conjugate gradient method is performed for some number of iterations, say k (< n), then it is restarted. (If k=0, this is the special case of Cauchy's steepest descent .)