A characterization of the algebraic degree in semidefinite programming
arXiv:2111.01070 · doi:10.1007/s13348-022-00358-5
Abstract
In this article, we show that the algebraic degree in semidefinite programming can be expressed in terms of the coefficient of a certain monomial in a doubly symmetric polynomial. This characterization of the algebraic degree allows us to use the theory of symmetric polynomials to obtain many interesting results of Nie, Ranestad and Sturmfels in a simpler way.
14 pages