On the equivalence of semidefinite programming and zero-sum semidefinite games

Jesse Elliott, Constantin Ickstadt, Thorsten Theobald +1

By results of Dantzig (1951) and Adler (2013), computing the optimal solutions of a linear program is equivalent to finding optimal strategies in zero-sum bimatrix games. Dantzig's…