A general formula for the algebraic degree in semidefinite programming
classification
🧮 math.AG
math.OC
keywords
algebraicdegreeformulageneralprogrammingsemidefinitevarietyconormal
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.