The knee-jerk mapping
From MaRDI portal
Publication:6477306
arXivmath/0606068MaRDI QIDQ6477306FDOQ6477306
Authors: Peter G. Doyle, James A. Reeds 
Publication date: 2 June 2006
Abstract: We claim to give the definitive theory of what we call the `knee-jerk mapping', which is the basis for a class of optimization algorithms introduced by Baum, and promoted by Dempster, Laird, and Rubin under the name `EM algorithm'.
Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40) Numerical methods involving duality (49M29)
This page was built for publication: The knee-jerk mapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6477306)
