Algebraic Degree in Semidefinite and Polynomial Optimization
In polynomial optimization problems, where the objective function and the contraints are described by multivariate polynomials, an optimizer is algebraic. Its coordinates are roots of univariate polynomials whose coefficients are polynomials in the input data. The number of complex critical points estimates the degree of this polynomial, and is called the algebraic degree. We give some background, tools and examples on how to compute this degree in a number of different problem classes.
- 1.Cox, D., Little, J., O’Shea, D.: Ideals, Varieties and Algorithms. UTM, 3rd edition, Springer-Verlag, New York (2007)Google Scholar
- 2.Fulton, W.: Intersection Theory. Springer-Verlag, New York (1984)Google Scholar
- 3.Harris, J.: Algebraic Geometry, A First Course. Springer-Verlag, New York (1992)Google Scholar
- 4.Graf von Bothmer, H.C., Ranestad, K.: A general formula for the algebraic degree in semidefinite programming. Bull. Lond. Math. Soc. 41, 193–197 (2009)Google Scholar
- 8.Pataki, G.: The geometry of cone-LP’s. In: Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.) Handbook of Semidefinite Programming, pp. 29–66. Kluwer (2000)Google Scholar