The algebraic degree of semidefinite programming

Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically, this degree counts the critical points attained by a linear functional on a fixed rank locus in a linear space of symmetric matrices. We determine this degree using methods from complex algebraic geometry, such as projective duality, determinantal varieties, and their Chern classes. Key words. Semidefinite programming, algebraic degree, genericity, determinantal variety, dual variety, multidegree, Euler-Poincar

• Type: Journal
• Year: 2010
• Where: MP
• Authors: Jiawang Nie, Kristian Ranestad, Bernd Sturmfels
• Keywords: Algebraic Numbers, Complex Algebraic Geometry, Generic Semidefinite Program, MP 2010, Security Privacy