The Algebraic Degree of Semidefinite Programming
最优化与控制
2008-09-09 v3 代数几何
摘要
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.
引用
@article{arxiv.math/0611562,
title = {The Algebraic Degree of Semidefinite Programming},
author = {Jiawang Nie and Kristian Ranestad and Bernd Sturmfels},
journal= {arXiv preprint arXiv:math/0611562},
year = {2008}
}
备注
23 pages, 3 figures