A characterization of the algebraic degree in semidefinite programming
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 intere...
Đã lưu trong:
Những tác giả chính: | Đặng, Tuấn Hiệp, Nguyen Thi Ngoc Giao, Nguyen Thi Mai Van |
---|---|
格式: | Journal article |
语言: | English |
出版: |
Springer
2023
|
在线阅读: | https://scholar.dlu.edu.vn/handle/123456789/2318 https://doi.org/10.1007/s13348-022-00358-5 |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
相似书籍
-
A formula for the algebraic degree in semidefinite programming
由: Đặng, Tuấn Hiệp
出版: (2023) -
A characterization for the degree of Fano varieties
由: Đặng, Tuấn Hiệp, et al.
出版: (2023) -
Generalized Semi-infinite Polynomial Optimization and Semidefinite Programming Relaxations
由: Liguo Jiao, et al.
出版: (2024) -
Convergence of the Lasserre hierarchy of semidefinite programming relaxations for convex polynomial programs without compactness
由: Vaithilingam, Jeyakumar, et al.
出版: (2023) -
Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
由: Vaithilingam, Jeyakumar, et al.
出版: (2023)