Maximin and minimax SINR problems are equivalent for general-rank signals with convex closed uncertainty sets, so the global optimum for worst-case SINR maximization is obtained by solving the equivalent SDP of the minimax problem.
Beck,Introduction to Nonlinear Optimization: Theory, Algorithms, and Applications with MATLAB, MOS-SIAM Series on Optimization, SIAM, Philadelphia
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SP 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal Robust Adaptive Beamforming for a General-Rank Signal Model via Equivalence of Maximin and Minimax SINR Problems
Maximin and minimax SINR problems are equivalent for general-rank signals with convex closed uncertainty sets, so the global optimum for worst-case SINR maximization is obtained by solving the equivalent SDP of the minimax problem.