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...
Kaydedildi:
Asıl Yazarlar: | , , |
---|---|
Materyal Türü: | Journal article |
Dil: | English |
Baskı/Yayın Bilgisi: |
Springer
2023
|
Online Erişim: | https://scholar.dlu.edu.vn/handle/123456789/2318 https://doi.org/10.1007/s13348-022-00358-5 |
Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
İlk yorumlayan siz olun!