On the rate of convergence of the ECM algorithm

From MaRDI portal





This paper studies algorithms to find maximum likelihood estimates given the observed data. The author proves a fundamental result on the rate of convergence of the EM algorithm and ECM algorithm. An example is shown that intuitions accurate for complete-data iterative algorithms may not be trust-worthy in the presence of missing data.




Cited in
(38)








This page was built for publication: On the rate of convergence of the ECM algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1327844)