Conjugate gradient methods form a class of iterative algorithms that are highly effective for solving large‐scale unconstrained optimisation problems.

Although its implementation is generally simple, the EM algorithm often exhibits slow convergence and is costly in some areas of application. Past attempts to accelerate the EM algorithm have most ...

Abstract. We consider a new hybrid conjugate gradient algorithm, which is obtained from the algorithm of Fletcher-Reeves, and the algorithm of Polak-Ribière-Polyak. Numerical comparisons show that the ...