A characterization of the algebraic degree in semidefinite programming

DOI10.1007/S13348-022-00358-5MaRDI QIDQ6157477zbMATH OpenOpenAlexFDO

Authors Dang Tuan Hiep, Nguyen Thi Ngoc Giao, Nguyen Thi Mai Van

Publication date 11 May 2023

Published in Collectanea Mathematica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2111.01070

zbMATH Keywords

semidefinite programmingalgebraic degreeSchubert calculusPataki inequalities

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Semidefinite programming (90C22) Classical problems, Schubert calculus (14N15) Other algebro-geometric (co)homologies (e.g., intersection, equivariant, Lawson, Deligne (co)homologies) (14F43)

Abstract: 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.

Recommendations

• The algebraic degree of semidefinite programming
• A general formula for the algebraic degree in semidefinite programming
• Semidefinite representations for finite varieties
• Algebraic degree in semidefinite and polynomial optimization
• Algebraic degree of polynomial optimization

Cites work

• scientific article; zbMATH DE number 1270593 (Why is no real title available?)
• scientific article; zbMATH DE number 1181673 (Why is no real title available?)
• A combinatorial proof of Dyson's conjecture
• A formula for the algebraic degree in semidefinite programming
• A general formula for the algebraic degree in semidefinite programming
• An identity involving symmetric polynomials and the geometry of Lagrangian Grassmannians
• An introduction to symmetric functions and their combinatorics
• Identities involving (doubly) symmetric polynomials and integrals over Grassmannians
• On Giambelli's theorem on complete correlations
• Sequences of Enumerative Geometry: Congruences and Asymptotics
• Symmetric functions, Schubert polynomials and degeneracy loci. Transl. from the French by John R. Swallow
• The algebraic degree of semidefinite programming

Cited in

(7)

• Algebraic degree in semidefinite and polynomial optimization
• The algebraic degree of semidefinite programming
• A general formula for the algebraic degree in semidefinite programming
• Algebraic degree of polynomial optimization
• The algebraic degree of the Wasserstein distance
• On matrix algebras associated to sum-of-squares semidefinite programs
• The degree of \(\text{SO}(n,\mathbb{C})\)

This page was built for publication: A characterization of the algebraic degree in semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157477)