Skip to Main content Skip to Navigation

Kullback Proximal Algorithms for Maximum Likelihood Estimation

Stéphane Chrétien 1 Alfred O. Hero 2
1 IS2 - Statistical Inference for Industry and Health
Inria Grenoble - Rhône-Alpes, LBBE - Laboratoire de Biométrie et Biologie Evolutive - UMR 5558
Abstract : In this paper, we study the convergence of a new class of fast and stable sequential optimization methods for computing maximum likelihood estimates. These methods are based on a proximal point algorithm implemented with a Kullback-type proximal function. When the proximal regularization parameter is set to unity one obtains the classical expectation maximization (EM) algorithm. For other values of the regularization parameter, relaxed versions of EM are obtained which can have much faster convergence. In particular, if the regularization parameter vanishes at infinity, a superlinearly converging algorithm is obtained. We present an implementation of the algorithm using the trust region update strategy. For illustration the method is applied to a non-quadratic inverse problem with Poisson distributed data.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 11:14:53 AM
Last modification on : Monday, March 23, 2020 - 5:26:13 PM
Long-term archiving on: : Sunday, April 4, 2010 - 9:02:55 PM


  • HAL Id : inria-00072906, version 1



Stéphane Chrétien, Alfred O. Hero. Kullback Proximal Algorithms for Maximum Likelihood Estimation. [Research Report] RR-3756, INRIA. 1999. ⟨inria-00072906⟩



Record views


Files downloads