For bilinear g(c; β) = c^T A β in compact convex minimax problems, ADMM reduces to alternating a generalized projection onto S and Euclidean projection onto C.
On general minimax theorems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Solving Minimax Problems with Bilinear Objectives with ADMM
For bilinear g(c; β) = c^T A β in compact convex minimax problems, ADMM reduces to alternating a generalized projection onto S and Euclidean projection onto C.