Logo: to the web site of Uppsala University

uu.sePublications from Uppsala University
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Min-Max Framework for Algorithms in Signal Processing Applications: An Overview
Indian Inst Technol Delhi, Delhi, India..
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Systems and Control.ORCID iD: 0000-0002-7957-3711
Indian Inst Technol Delhi, Delhi, India..
Indian Inst Technol Delhi, Delhi, India..
2024 (English)In: Foundations and Trends in Signal Processing, ISSN 1932-8346, Vol. 18, no 4, p. 310-389Article in journal (Refereed) Published
Abstract [en]

This monograph presents a theoretical background and a broad introduction to the M in-Max Framework for M ajori- zation-Minimization (MM4MM), an algorithmic methodology for solving minimization problems by formulating them as min-max problems and then employing majorizationminimization. The monograph lays out the mathematical basis of the approach used to reformulate a minimization problem as a min-max problem. With the prerequisites covered, including multiple illustrations of the formulations for convex and non-convex functions, this work serves as a guide for developing MM4MM-based algorithms for solving non-convex optimization problems in various areas of signal processing. As special cases, we discuss using the majorization-minimization technique to solve min-max problems encountered in signal processing applications and min- max problems formulated using the Lagrangian. Lastly, we present detailed examples of using MM4MM in ten signal processing applications such as phase retrieval, source localization, independent vector analysis, beamforming and optimal sensor placement in wireless sensor networks. The devised MM4MM algorithms are free of hyper-parameters and enjoy the advantages inherited from the use of the majorization-minimization technique such as monotonicity.

Place, publisher, year, edition, pages
Now Publishers Inc., 2024. Vol. 18, no 4, p. 310-389
Keywords [en]
Conjugate function, min-max problem, majorization- minimization, non-convex optimization
National Category
Signal Processing Control Engineering
Identifiers
URN: urn:nbn:se:uu:diva-543832DOI: 10.1561/2000000129ISI: 001348935700001Scopus ID: 2-s2.0-85208464701OAI: oai:DiVA.org:uu-543832DiVA, id: diva2:1916524
Available from: 2024-11-27 Created: 2024-11-27 Last updated: 2024-11-27Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Stoica, Peter

Search in DiVA

By author/editor
Stoica, Peter
By organisation
Division of Systems and Control
Signal ProcessingControl Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 90 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf