期刊
MATHEMATICAL PROGRAMMING
卷 122, 期 2, 页码 379-405出版社
SPRINGER
DOI: 10.1007/s10107-008-0253-6
关键词
Semidefinite programming; Algebraic degree; Genericity; Determinantal variety; Dual variety; Multidegree; Euler-Poincare characteristic; Chern class
类别
资金
- US National Science Foundation [DMS-0456960]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据