Skip to main content

The dynamic ‘expectation–conditional maximization either’ algorithm

Buy Article:

$51.00 plus tax (Refund Policy)


Summary.  The ‘expectation–conditional maximization either’ (ECME) algorithm has proven to be an effective way of accelerating the expectation–maximization algorithm for many problems. Recognizing the limitation of using prefixed acceleration subspaces in the ECME algorithm, we propose a dynamic ECME (DECME) algorithm which allows the acceleration subspaces to be chosen dynamically. The simplest DECME implementation is what we call DECME‐1, which uses the line that is determined by the two most recent estimates as the acceleration subspace. The investigation of DECME‐1 leads to an efficient, simple, stable and widely applicable DECME implementation, which uses two‐dimensional acceleration subspaces and is referred to as DECME‐2. The fast convergence of DECME‐2 is established by the theoretical result that, in a small neighbourhood of the maximum likelihood estimate, it is equivalent to a conjugate direction method. The remarkable accelerating effect of DECME‐2 and its variant is also demonstrated with several numerical examples.

Document Type: Research Article


Affiliations: 1: Yale University, New Haven, USA 2: Purdue University, West Lafayette, USA

Publication date: 2012-03-01

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more