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 Oxford University Press

A general formula for the algebraic degree in semidefinite programming

Download PDF

A general formula for the algebraic degree in semidefinite programming

Graf von Bothmer, Hans-Christian
Bulletin of the London Mathematical Society , Volume 41 (2) – Apr 1, 2009

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.

Loading next page...
 
/lp/oxford-university-press/a-general-formula-for-the-algebraic-degree-in-semidefinite-programming-HDKv7kG6qY

References (4)

Publisher
Oxford University Press
Copyright
© 2009 London Mathematical Society
Subject
PAPERS
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 – Oxford University Press

Published: Apr 1, 2009

There are no references for this article.