A characterization of the algebraic degree in semidefinite programming
Algebraic Geometry
2023-09-04 v2 Combinatorics
Optimization and Control
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.
Cite
@article{arxiv.2111.01070,
title = {A characterization of the algebraic degree in semidefinite programming},
author = {Dang Tuan Hiep and Nguyen Thi Ngoc Giao and Nguyen Thi Mai Van},
journal= {arXiv preprint arXiv:2111.01070},
year = {2023}
}
Comments
14 pages