The knee-jerk mapping

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'.

Version dated 5 October 1998. Freely redistributable (GNU FDL)

Cited by in corpus (2)

• Commuting time geometry of ergodic Markov chains
• Disciplined Geometric Programming