A general formula for the algebraic degree in semidefinite programming
Algebraic Geometry
2009-09-09 v1 Optimization and Control
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.
Cite
@article{arxiv.math/0701877,
title = {A general formula for the algebraic degree in semidefinite programming},
author = {Hans-Christian Graf von Bothmer and Kristian Ranestad},
journal= {arXiv preprint arXiv:math/0701877},
year = {2009}
}
Comments
6 Pages