On the convergence of the EM algorithm.

An example is given showing that a sequence generated by a GEM algorithm need not converge under the conditions stated in Dempster et al., (1977). Two general convergence results are presented which suggest that in practice a GEM sequence will converge to a compact connected set of local maxima of the likelihood function; this limit set may or may not consist of a single point.