Abstract
The EM algorithm is a popular approach to maximum likelihood estimation but has not been much used for penalized likelihood or maximum a posteriori estimation. This paper discusses properties of the EM algorithm in such contexts, concentrating on rates of convergence, and presents an alternative that is usually more practical and converges at least as quickly.

This publication has 6 references indexed in Scilit: