Under a natural constraint qualification, semidefinite programming is equivalent to finding optimal strategies in an associated zero-sum semidefinite game.
Title resolution pending
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
-
On the equivalence of semidefinite programming and zero-sum semidefinite games
Under a natural constraint qualification, semidefinite programming is equivalent to finding optimal strategies in an associated zero-sum semidefinite game.