A general formula for the algebraic degree in semidefinite programming
From MaRDI portal
Publication:3624297
DOI10.1112/blms/bdn114zbMath1185.14047arXivmath/0701877OpenAlexW3104810083MaRDI QIDQ3624297
Hans-Christian Graf von Bothmer, Kristian Ranestad
Publication date: 29 April 2009
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0701877
Related Items
Computing sum of squares decompositions with rational coefficients, The algebraic degree of semidefinite programming, Certifying the global optimality of quartic minimization over the sphere, A Lower Bound on the Positive Semidefinite Rank of Convex Bodies, The Maximum Likelihood Degree of Sparse Polynomial Systems, The geometry of SDP-exactness in quadratic optimization, Nonlinear algebra and applications, A characterization of the algebraic degree in semidefinite programming, Linear optimization on varieties and Chern-Mather classes, Equations and multidegrees for inverse symmetric matrix pairs, Discriminants and nonnegative polynomials, A Morse theoretic approach to non-isolated singularities and applications to optimization, Gram spectrahedra, An SOS counterexample to an inequality of symmetric functions, The Euclidean distance degree of an algebraic variety, Algebraic Degree in Semidefinite and Polynomial Optimization, Intrinsic volumes of symmetric cones and applications in convex programming, Exact Algorithms for Linear Matrix Inequalities, The leading coefficient of Lascoux polynomials, Generic Spectrahedral Shadows
