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
来源
FOUNDATIONS AND TRENDS IN SIGNAL PROCESSING | 2024年 / 18卷 / 04期
关键词
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 条
  • [21] A min-max relation in flowgraphs and some applications
    Ferreira, Carlos Eduardo
    Pereira Franco, Alvaro Junio
    DISCRETE APPLIED MATHEMATICS, 2018, 245 : 65 - 76
  • [22] A Uniform Min-Max Theorem with Applications in Cryptography
    Vadhan, Salil
    Zheng, Colin Jia
    ADVANCES IN CRYPTOLOGY - CRYPTO 2013, PT I, 2013, 8042 : 93 - 110
  • [23] 2 NEW ALGORITHMS FOR CONSTRUCTING MIN-MAX HEAPS
    DRAWS, L
    ERIKSSON, P
    FORSLUND, E
    HOGLUND, L
    VALLNER, S
    STROTHOTTE, T
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 318 : 43 - 50
  • [24] Approximation Algorithms for Min-Max Cycle Cover Problems
    Xu, Wenzheng
    Liang, Weifa
    Lin, Xiaola
    IEEE TRANSACTIONS ON COMPUTERS, 2015, 64 (03) : 600 - 613
  • [25] ON A MIN-MAX THEOREM
    CHEN FANGQI
    Applied Mathematics:A Journal of Chinese Universities(Series B), 1997, (03) : 43 - 48
  • [26] Min-Max Propagation
    Srinivasa, Christopher
    Givoni, Inmar
    Ravanbakhsh, Siamak
    Frey, Brendan J.
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 30 (NIPS 2017), 2017, 30
  • [27] MIN-MAX INDICATOR
    VASILEV, SI
    SIDELNIKOV, ZI
    INSTRUMENTS AND EXPERIMENTAL TECHNIQUES, 1983, 26 (06) : 1325 - 1327
  • [28] On a min-max theorem
    Wu G.R.
    Huang W.H.
    Shen Z.H.
    Applied Mathematics-A Journal of Chinese Universities, 1997, 12 (3) : 293 - 298
  • [29] Min-max and min-max regret versions of combinatorial optimization problems: A survey
    Aissi, Hassene
    Bazgan, Cristina
    Vanderpooten, Daniel
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (02) : 427 - 438
  • [30] Min-max and min-max (relative) regret approaches to representatives selection problem
    Dolgui, Alexandre
    Kovalev, Sergey
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2012, 10 (02): : 181 - 192