Foundations and Trends® in Signal Processing > Vol 18 > Issue 4

Min-Max Framework for Majorization-Minimization Algorithms in Signal Processing Applications: An Overview

By Astha Saini, Indian Institute of Technology Delhi, India, astha.saini@care.iitd.ac.in | Petre Stoica, Uppsala University, Sweden, ps@it.uu.se | Prabhu Babu, Indian Institute of Technology Delhi, India, Prabhu.Babu@care.iitd.ac.in | Aakash Arora, Indian Institute of Technology Delhi, India, aarora@care.iitd.ac.in

 
Suggested Citation
Astha Saini, Petre Stoica, Prabhu Babu and Aakash Arora (2024), "Min-Max Framework for Majorization-Minimization Algorithms in Signal Processing Applications: An Overview", Foundations and TrendsĀ® in Signal Processing: Vol. 18: No. 4, pp 310-389. http://dx.doi.org/10.1561/2000000129

Publication Date: 04 Nov 2024
© 2024 A. Saini et al.
 
Subjects
Statistical signal processing,  Statistical/Machine learning,  Optimization
 
Keywords
Conjugate functionmin-max problemmajorization-minimizationnon-convex optimization
 

Free Preview:

Download extract

Share

Download article
In this article:
1. Introduction
2. Max Formulation
3. Min-Max Framework for Majorization Minimization
4. Special Cases
5. Signal Processing Applications of MM4MM
6. Conclusions
Appendix
References

Abstract

This monograph presents a theoretical background and a broad introduction to the Min-Max Framework for Majorization-Minimization (MM4MM), an algorithmic methodology for solving minimization problems by formulating them as min-max problems and then employing majorization-minimization. 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.

DOI:10.1561/2000000129
ISBN: 978-1-63828-466-6
90 pp. $70.00
Buy book (pb)
 
ISBN: 978-1-63828-467-3
90 pp. $155.00
Buy E-book (.pdf)
Table of contents:
1. Introduction
2. Max Formulation
3. Min-Max Framework for Majorization Minimization
4. Special Cases
5. Signal Processing Applications of MM4MM
6. Conclusions
Appendix
References

Min-Max Framework for Majorization-Minimization Algorithms in Signal Processing Applications: An Overview

This monograph presents a theoretical background and a broad introduction to the Min-Max Framework for Majorization-Minimization (MM4MM), an algorithmic methodology for solving minimization problems by formulating them as min-max problems and then employing majorization-minimization. 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, the majorization-minimization technique is discussed to solve min-max problems encountered in signal processing applications and min-max problems formulated using the Lagrangian. 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 are presented. 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.

 
SIG-129