A characterization of the algebraic degree in semidefinite programming

• Hiep, Dang Tuan ^[2] ; Giao, Nguyen Thi Ngoc ^[3] ; Van, Nguyen Thi Mai ^[1]
  1. [1] Quy Nhon University

     Quy Nhon University

     Vietnam

     
  2. [2] Faculty of Mathematics and Computer Science, Da Lat University, 1 Phu Dong Thien Vuong, Da Lat, Lam Dong, Vietnam
  3. [3] Faculty of Advanced Science and Technology, University of Science and Technology - The University of Da Nang, 54 Nguyen Luong Bang, Da Nang, Vietnam

  Mostrar afiliaciones +
• Localización: Collectanea mathematica, ISSN 0010-0757, Vol. 74, Fasc. 2, 2023, págs. 443-455
• Idioma: inglés
• DOI: 10.1007/s13348-022-00358-5
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.