Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A general formula for the algebraic degree in semidefinite programming

A general formula for the algebraic degree in semidefinite programming 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Bulletin of the London Mathematical Society Wiley

A general formula for the algebraic degree in semidefinite programming

Download PDF
5 pages

Loading next page...
 
/lp/wiley/a-general-formula-for-the-algebraic-degree-in-semidefinite-programming-cp3X7QOq9d

References (4)

Publisher
Wiley
Copyright
© London Mathematical Society
ISSN
0024-6093
eISSN
1469-2120
DOI
10.1112/blms/bdn114
Publisher site
See Article on Publisher Site

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.

Journal

Bulletin of the London Mathematical Society – Wiley

Published: Apr 1, 2009

There are no references for this article.