Premium
A general formula for the algebraic degree in semidefinite programming
Author(s) -
Graf von Bothmer HansChristian,
Ranestad Kristian
Publication year - 2009
Publication title -
bulletin of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.396
H-Index - 48
eISSN - 1469-2120
pISSN - 0024-6093
DOI - 10.1112/blms/bdn114
Subject(s) - mathematics , semidefinite programming , degree (music) , variety (cybernetics) , rank (graph theory) , algebraic number , real algebraic geometry , algebra over a field , pure mathematics , combinatorics , mathematical optimization , mathematical analysis , statistics , physics , acoustics
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom