An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods

DOI10.1287/moor.1030.0073zbMath1082.90092OpenAlexW2119537322MaRDI QIDQ5704157

Paul Tseng

Publication date: 11 November 2005

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1030.0073

zbMATH Keywords

EM algorithmKullback-Leibler distanceproximal point method\(\phi\)-divergence, convergence analysis

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items

Majorization-minimization algorithms for nonsmoothly penalized objective functions ⋮ Population pharmacokinetic/pharmacodynamic mixture models via maximum a posteriori estimation ⋮ On EM algorithms and their proximal generalizations ⋮ Statistical convergence of the EM algorithm on Gaussian mixture models ⋮ Nonlinear random effects mixture models: maximum likelihood estimation via the EM algorithm ⋮ Robust EM kernel-based methods for linear system identification ⋮ On the curved exponential family in the Stochastic Approximation Expectation Maximization Algorithm

This page was built for publication: An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods