A general formula for the algebraic degree in semidefinite programming
Hans-Christian Graf von Bothmer, Kristian Ranestad
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.
Create a lesson
Related papers
Morphism spaces on low degree hypersurfaces
Hrishabh Mishra
Connecting families of curves
Nathan Chen, Robert Lazarsfeld, Federico Moretti
The Last Picard Rank 1 Double-Mirror Calabi-Yau Pair?
Michał Kapustka, Marco Rampazzo, Prajwal Samal
Conductor-Discriminant Inequality for Tamely Ramified Cyclic Covers II
Connor Stewart
The Hurwitz existence problem in prime degree
Jijian Song, Hailin Wen, Zebao Zhang
Conductor-Discriminant Inequality for Tamely Ramified Cyclic Covers I
Andrew Obus, Padmavathi Srinivasan, Connor Stewart