arXiv · 2111.01070
A characterization of the algebraic degree in semidefinite programming
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Dang Tuan Hiep, Nguyen Thi Ngoc Giao, Nguyen Thi Mai Van. 2021-11-01. A characterization of the algebraic degree in semidefinite programming. https://doi.org/10.1007/s13348-022-00358-5
Cite the original work for its findings. Save a collection to share your selection of sources.