A general formula for the algebraic degree in semidefinite programming

authored by

Hans Christian Graf v. Bothmer, Kristian Ranestad

Abstract

In this article, we use a natural desingularization of the conormal variety of (n × n)-symmetric matrices of rank at most r to find a general formula for the algebraic degree in semidefinite programming.

Organisation(s)

Institute of Algebraic Geometry

External Organisation(s)

University of Oslo

Type

Article

Journal

Bulletin of the London Mathematical Society

Volume

41

Pages

193-197

No. of pages

5

ISSN

0024-6093

Publication date

04.2009

Publication status

Published

Peer reviewed

Yes

Electronic version(s)

https://doi.org/10.1112/blms/bdn114 (Access: Unknown)