Nonconvex Optimization via MM Algorithms: Convergence Theory

Abstract

The majorization-minimization (MM) principle is an extremely general framework for deriving optimization algorithms. It includes the expectation-maximization (EM) algorithm, proximal gradient algorithm, concave-convex procedure, quadratic lower bound algorithm, and proximal distance algorithm as special cases. Besides numerous applications in statistics, optimization, and imaging, the MM principle finds wide applications in large scale machine learning problems such as matrix completion, discriminant analysis, and nonnegative matrix factorizations. When applied to nonconvex optimization problems, MM algorithms enjoy the advantages of convexifying the objective function, separating variables, numerical stability, and ease of implementation. However, compared to the large body of literature on other optimization algorithms, the convergence analysis of MM algorithms is scattered and problem specific. This survey presents a unified treatment of the convergence of MM algorithms. With modern applications in mind, the results encompass non-smooth objective functions and non-asymptotic analysis.

arXiv comment33 pages

References in corpus (8)

• Nearly unbiased variable selection under minimax concave penalty
• Variable selection using MM algorithms
• Splitting Methods for Convex Clustering
• On the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty
• Distance Majorization and Its Applications
• MM Algorithms for Geometric and Signomial Programming
• A majorization-minimization approach to variable selection using spike and slab priors
• Multicategory vertex discriminant analysis for high-dimensional data

Cited by in corpus (1)

• The inverse problem of positive autoconvolution