Skip to main navigation Skip to search Skip to main content

A simulated annealing version of the EM algorithm for non-Gaussian deconvolution

Research output: Contribution to journalArticlepeer-review

Abstract

The Expectation-Maximization (EM) algorithm is a very popular technique for maximum likelihood estimation in incomplete data models. When the expectation step cannot be performed in closed form, a stochastic approximation of EM (SAEM) can be used. Under very general conditions, the authors have shown that the attractive stationary points of the SAEM algorithm correspond to the global and local maxima of the observed likelihood. In order to avoid convergence towards a local maxima, a simulated annealing version of SAEM is proposed. An illustrative application to the convolution model for estimating the coefficients of the filter is given.

Original languageEnglish
Pages (from-to)229-236
Number of pages8
JournalStatistics and Computing
Volume7
Issue number4
DOIs
Publication statusPublished - 1 Jan 1997

Keywords

  • Deconvolution
  • EM algorithm
  • Linear filters
  • Simulated annealing
  • Stochastic algorithms

Fingerprint

Dive into the research topics of 'A simulated annealing version of the EM algorithm for non-Gaussian deconvolution'. Together they form a unique fingerprint.

Cite this