arXiv · math/0701877
A general formula for the algebraic degree in semidefinite programming
Abstract
In this note, we use a natural desingularization of the conormal variety of the variety of n x n symmetric matrices of rank at most r to find a general formula for the algebraic degree in semidefinite programming.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Hans-Christian Graf von Bothmer, Kristian Ranestad. 2007-01-30. A general formula for the algebraic degree in semidefinite programming. https://doi.org/10.1112/blms%2Fbdn114
Cite the original work for its findings. Save a collection to share your selection of sources.