Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
The DOI matches its Crossref record; 145 of the 150 references it cites were found in a registry or an index.
Abstract
This paper gives an overview of the majorization-minimization (MM) algorithmic framework, which can provide guidance in deriving problem-driven algorithms with low computational cost. A general introduction of MM is presented, including a description of the basic principle and its convergence results. The extensions, acceleration schemes, and connection to other algorithmic frameworks are also covered. To bridge the gap between theory and practice, upperbounds for a large number of basic functions, derived based on the Taylor expansion, convexity, and special inequalities, are provided as ingredients for constructing surrogate functions. With the pre-requisites established, the way of applying MM to solving specific problems is elaborated by a wide range of applications in signal processing, communications, and machine learning.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Convex approximation provides a natural way to design polynomial time complexity algorithms for nonconvex programs based on the principle of majorizationminimization [262] or successive convex approximation [263].”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [262]
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Lee, D. D., & Seung, H. S. (2000) · neural information processing systems · Cited by 9,876
The EM Algorithm and Extensions
Kushary, D. (1998) · Technometrics · doi:10.1080/00401706.1998.10485534 · Cited by 5,417
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
Enhancing Sparsity by Reweighted ℓ 1 Minimization
Candès, E. J., Wakin, M. B., & Boyd, S. P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9045-x · Cited by 4,863
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Seung, D., & Lee, L.-W. (2001) · Cited by 4,753
A practical algorithm for the determination of phase from image and diffraction plane pictures
Gerchberg, R. W. (1972) · Optik · Cited by 4,519
Iterative Solution of Nonlinear Equations in Several Variables
I., E., Ortega, J. M., & Rheinboldt, W. C. (1971) · Mathematics of Computation · doi:10.2307/2004942 · Cited by 4,408
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Research works printed but not linked: 7
- tipping, 2001, Sparse Bayesian learning and the relevance vector machine, J Mach Learning Res, 1, 211
- bouman, 0, Fast numerical methods for emission and transmission tomographic reconstruction, Proc Conf Inf Sci Syst, 611
- 10.1109/TSP.2015.2448516 · DOI · Paper page
- 10.2307/2290716 · DOI
- lange, 1995, A quasi-Newton acceleration of the EM algorithm, Statistica Sinica, 5, 1
- 10.1191/096228097677258219 · doi:10.1191/096228097677258219
- 10.2307/1390605 · DOI
Cited by
Multicell MIMO Communications Relying on Intelligent Reflecting Surfaces
Pan, C., Ren, H., Wang, K., Xu, W., Elkashlan, M., Nallanathan, A., & Hanzo, L. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.2990766 · Cited by 1,073
Weighted Sum-Rate Maximization for Reconfigurable Intelligent Surface Aided Wireless Networks
Guo, H., Liang, Y.-C., Chen, J., & Larsson, E. G. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.2970061 · Cited by 1,013
Intelligent Reflecting Surface: Practical Phase Shift Model and Beamforming Optimization
Abeywickrama, S., Zhang, R., & Yuen, C. (2020) · ICC 2020 - 2020 IEEE International Conference on Communications (ICC) · doi:10.1109/icc40277.2020.9148961 · Cited by 901
Pan, C., Ren, H., Wang, K., Elkashlan, M., Nallanathan, A., Wang, J., & Hanzo, L. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3000802 · Cited by 903
Robust and Secure Wireless Communications via Intelligent Reflecting Surfaces
Yu, X., Xu, D., Sun, Y., Ng, D. W. K., & Schober, R. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3007043 · Cited by 833
Self-citation
Metadata
- Authors
- Sun, Y., Babu, P., & Palomar, D. P.
- Affiliations
- Hong Kong University of Science and Technology (HK)
- Indian Institute of Technology Delhi (IN)
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2017-02-01
- Volume
- 65
- Issue
- 3
- Pages
- 794-816
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2508393166
- Cited by
- 1,820
- References
- 150
- Citations by year
- 2026: 200 · 2025: 294 · 2024: 300 · 2023: 248 · 2022: 230 · 2021: 201 · 2020: 135 · 2019: 110 · 2018: 77 · 2017: 19
- FWCI
- 61.11
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Signal Processing (publishedVersion)
- Rare & Special e-Zone (The Hong Kong University of Science and Technology) (submittedVersion)
- Funders
- Hong Kong RGC (16207814, 16206315)
- Topics
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Keywords
- majorization-minimization, surrogate functions, convex relaxation, convergence analysis, algorithm acceleration, low-complexity algorithms, signal processing, communication, machine learning
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning. https://app.cochat.ai/papers/10.1109/tsp.2016.2601299
- The paper
- Sun, Y., Babu, P., & Palomar, D. P. (2017). Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2016.2601299
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.