The MM Alternative to EM

Abstract

The EM algorithm is a special case of a more general algorithm called the MM algorithm. Specific MM algorithms often have nothing to do with missing data. The first M step of an MM algorithm creates a surrogate function that is optimized in the second M step. In minimization, MM stands for majorize--minimize; in maximization, it stands for minorize--maximize. This two-step process always drives the objective function in the right direction. Construction of MM algorithms relies on recognizing and manipulating inequalities rather than calculating conditional expectations. This survey walks the reader through the construction of several specific MM algorithms. The potential of the MM algorithm in solving high-dimensional optimization and estimation problems is its most attractive feature. Our applications to random graph models, discriminant analysis and image restoration showcase this ability.

Published in at http://dx.doi.org/10.1214/08-STS264 the Statistical Science (http://www.imstat.org/sts/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (3)

• Pathwise coordinate optimization
• Variable selection using MM algorithms
• Generalized Convexity and Inequalities

Cited by in corpus (5)

• Convex Clustering: An Attractive Alternative to Hierarchical Clustering
• Distance Majorization and Its Applications
• Adaptive Radar Detection and Bearing Estimation in the Presence of Unknown Mutual Coupling
• Graphics Processing Units and High-Dimensional Optimization
• New Methods for MLE of Toeplitz Structured Covariance Matrices with Applications to RADAR Problems