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

被引:0
|
作者
Saini, Astha [1 ]
Stoica, Petre [2 ]
Babu, Prabhu [1 ]
Arora, Aakash [1 ]
机构
[1] Indian Inst Technol Delhi, Delhi, India
[2] Uppsala Univ, Uppsala, Sweden
来源
关键词
Conjugate function; min-max problem; majorization-; minimization; non-convex optimization; MAJORIZATION-MINIMIZATION ALGORITHM; PENALIZED LIKELIHOOD ESTIMATION; WAVE-FORM DESIGN; MIMO RADAR; MATRIX FACTORIZATION; CONVERGENCE ANALYSIS; HYBRID TRANSCEIVERS; CHANNEL ESTIMATION; MM ALGORITHMS; EM;
D O I
10.1561/2000000129
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:310 / 389
页数:83
相关论文
共 50 条
  • [1] A unified framework for max-min and min-max fairness with applications
    Radunovic, Bozidar
    Le Boudec, Jean-Yves
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2007, 15 (05) : 1073 - 1083
  • [2] BLOCK ALTERNATING OPTIMIZATION FOR NON-CONVEX MIN-MAX PROBLEMS: ALGORITHMS AND APPLICATIONS IN SIGNAL PROCESSING AND COMMUNICATIONS
    Lu, Songtao
    Tsaknakis, Ioannis
    Hong, Mingyi
    2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2019, : 4754 - 4758
  • [3] Approximation algorithms for min-max and max-min resource sharing problems, and applications
    Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, Olshausenstr. 40, 24098 Kiel, Germany
    Lect. Notes Comput. Sci., 2006, (156-202):
  • [4] Approximation algorithms for min-max and max-min resource sharing problems, and applications
    Jansen, K
    EFFICIENT APPROXIMATION AND ONLINE ALGORITHMS: RECENT PROGRESS ON CLASSICAL COMBINATORIAL OPTIMIZATION PROBLEMS AND NEW APPLICATIONS, 2006, 3484 : 156 - 202
  • [5] Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover
    Yu, Wei
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2023, 97 (01) : 135 - 157
  • [6] Pseudo-polynomial algorithms for min-max and min-max regret problems
    Aissi, Hassene
    Bazgan, Cristina
    Vanderpooten, Daniel
    Operations Research and Its Applications, 2005, 5 : 171 - 178
  • [7] New applications of Min-max Theory
    Neves, Andre
    PROCEEDINGS OF THE INTERNATIONAL CONGRESS OF MATHEMATICIANS (ICM 2014), VOL II, 2014, : 939 - 957
  • [8] Applications of Min-Max Methods to Geometry
    Marques, Fernando C.
    Neves, Andre
    GEOMETRIC ANALYSIS, 2020, 2263 : 41 - 77
  • [9] Approximation algorithms for min-max tree partition
    GuttmannBeck, N
    Hassin, R
    JOURNAL OF ALGORITHMS, 1997, 24 (02) : 266 - 286
  • [10] Quantum Algorithms for Evaluating MIN-MAX Trees
    Cleve, Richard
    Gavinsky, Dmitry
    Yonge-Mallo, D. L.
    THEORY OF QUANTUM COMPUTATION, COMMUNICATION, AND CRYPTOGRAPHY, 2008, 5106 : 11 - 15