CoChat

Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning

Sun, Ying, Babu, Prabhu, Palomar, Daniel P. · 2017 · IEEE Transactions on Signal Processing

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

Crossref · 10.1109/tsp.2016.2601299

Cites

145 of 145 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 145 references

Research works printed but not linked: 7

  1. tipping, 2001, Sparse Bayesian learning and the relevance vector machine, J Mach Learning Res, 1, 211
  2. bouman, 0, Fast numerical methods for emission and transmission tomographic reconstruction, Proc Conf Inf Sci Syst, 611
  3. 10.1109/TSP.2015.2448516 · DOI · Paper page
  4. 10.2307/2290716 · DOI
  5. lange, 1995, A quasi-Newton acceleration of the EM algorithm, Statistica Sinica, 5, 1
  6. 10.1191/096228097677258219 · doi:10.1191/096228097677258219
  7. 10.2307/1390605 · DOI

Cited by

Items 301–400 of 1,000

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

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.