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 条
  • [31] Improved approximation algorithms for the Min-Max Selecting Items problem
    Doerr, Benjamin
    INFORMATION PROCESSING LETTERS, 2013, 113 (19-21) : 747 - 749
  • [32] NECESSARY CONDITIONS FOR MIN-MAX PROBLEMS AND ALGORITHMS BY A RELAXATION PROCEDURE
    SHIMIZU, K
    AIYOSHI, E
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1980, 25 (01) : 62 - 66
  • [33] Approximation Algorithms for the Min-Max Cycle Cover Problem With Neighborhoods
    Deng, Lijia
    Xu, Wenzheng
    Liang, Weifa
    Peng, Jian
    Zhou, Yingjie
    Duan, Lei
    Das, Sajal K.
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2020, 28 (04) : 1845 - 1858
  • [34] A New Approximate Min-Max Theorem with Applications in Cryptography
    Skorski, Maciej
    ALGORITHMS AND COMPUTATION, ISAAC 2015, 2015, 9472 : 653 - 663
  • [35] A Min-Max Property of Chordal Bipartite Graphs with Applications
    Abueida, Atif
    Busch, Arthur H.
    Sritharan, R.
    GRAPHS AND COMBINATORICS, 2010, 26 (03) : 301 - 313
  • [36] A new approximate min-max theorem with applications in cryptography
    20160101746911
    (1) Cryptology and Data Security Group, University of Warsaw, Warsaw, Poland, 1600, (Springer Verlag):
  • [37] On the Complexity of and Algorithms for Min-Max Target Coverage On a Line Boundary
    Huang, Peihuang
    Zhu, Wenxing
    Guo, Longkun
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2019, 2019, 11436 : 313 - 324
  • [38] Efficient algorithms for electric vehicles’ min-max routing problem
    Fazeli S.S.
    Venkatachalam S.
    Smereka J.M.
    Sustainable Operations and Computers, 2024, 5 : 15 - 28
  • [39] TRAJECTORY-FOLLOWING ALGORITHMS FOR MIN-MAX OPTIMIZATION PROBLEMS
    VINCENT, TL
    GOH, BS
    TEO, KL
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1992, 75 (03) : 501 - 519
  • [40] Approximation Algorithms for the Capacitated Min-Max Correlation Clustering Problem
    Ji, Sai
    Li, Jun
    Wu, Zijun
    Xu, Yicheng
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2023, 40 (01)