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...
Αποθηκεύτηκε σε:
Κύριοι συγγραφείς: | Đặng, Tuấn Hiệp, Nguyen Thi Ngoc Giao, Nguyen Thi Mai Van |
---|---|
Μορφή: | Journal article |
Γλώσσα: | English |
Έκδοση: |
Springer
2023
|
Διαθέσιμο Online: | 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, κ.ά.
Έκδοση: (2023) -
Generalized Semi-infinite Polynomial Optimization and Semidefinite Programming Relaxations
ανά: Liguo Jiao, κ.ά.
Έκδοση: (2024) -
Convergence of the Lasserre hierarchy of semidefinite programming relaxations for convex polynomial programs without compactness
ανά: Vaithilingam, Jeyakumar, κ.ά.
Έκδοση: (2023) -
Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
ανά: Vaithilingam, Jeyakumar, κ.ά.
Έκδοση: (2023)