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...
Gorde:
Egile Nagusiak: | Đặng, Tuấn Hiệp, Nguyen Thi Ngoc Giao, Nguyen Thi Mai Van |
---|---|
Formatua: | Journal article |
Hizkuntza: | English |
Argitaratua: |
Springer
2023
|
Sarrera elektronikoa: | https://scholar.dlu.edu.vn/handle/123456789/2318 https://doi.org/10.1007/s13348-022-00358-5 |
Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
Antzeko izenburuak
-
A formula for the algebraic degree in semidefinite programming
nork: Đặng, Tuấn Hiệp
Argitaratua: (2023) -
A characterization for the degree of Fano varieties
nork: Đặng, Tuấn Hiệp, et al.
Argitaratua: (2023) -
Generalized Semi-infinite Polynomial Optimization and Semidefinite Programming Relaxations
nork: Liguo Jiao, et al.
Argitaratua: (2024) -
Convergence of the Lasserre hierarchy of semidefinite programming relaxations for convex polynomial programs without compactness
nork: Vaithilingam, Jeyakumar, et al.
Argitaratua: (2023) -
Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
nork: Vaithilingam, Jeyakumar, et al.
Argitaratua: (2023)