Helfried Peyrl
Pablo A. Parrilo
ABSTRACT
In recent years semideffinite programming (SDP) has become the standard technique for computing sum of squares (SOS) decompositions of nonnegative polynomials. Due to the nature of the underlying methods, the solutions are computed numerically, and thus are never exact. In this paper we present a software package for Macaulay 2, which aims at computing an exact SOS decomposition from a numerical solution.
- M. D. Choi, T. Y. Lam, and B. Reznick. Sums of squares of real polynomials. In K-theory and algebraic geometry: connections with quadratic forms and division algebras, volume 58 of Proc. Sympos. Pure Math., pages 103--126. Amer. Math. Soc., Providence, RI, 1995.Google Scholar
- G. Golub and C. van Loan. Matrix Computations, chapter 4, pages 133--148. Johns Hopkins Series in the Mathematical Sciences. The Johns Hopkins University Press, Baltimore Maryland, 2nd edition, 1989.Google Scholar
- D. R. Grayson and M. E. Stillman. Macaulay 2, a software system for research in algebraic geometry. Available at http://www.math.uiuc.edu/Macaulay2/Google Scholar
- E. Landau. Über die Darstellung de niter Funktionen als Summe von Quadraten. Math. Ann., 62:290--329, 1906.Google ScholarCross Ref
- P. A. Parrilo. Structured Semide nite Programs and Semialgebraic Geometry Methods in Robustness and Optimization. PhD thesis, California Institute of Technology, 2000.Google Scholar
- H. Peyrl and P. A. Parrilo. SOS.m2, a sum of squares package for Macaulay 2. Available at decompo-http://www.control.ee.ethz.ch/~hpeyrl 2007.Google Scholar
- B. Reznick. Some concrete aspects of Hilbert's 17th problem. In Real algebraic geometry and ordered structures, volume 253 of Contemporary Mathematics, pages 251--272. Amer. Math. Soc., Providence, RI, 2000.Google Scholar
- M. Schweighofer. Algorithmische Beweise für Nichtnegativ-und Positivstellensätze.Master's thesis, Universität Passau, 1999.Google Scholar
- N. Z. Shor. Class of global minimum bounds of polynomial functions. Cybernetics, 23(6):731--734, 1987.Google ScholarCross Ref
- L. Vandenberghe and S. Boyd. Semideffinite programming. SIAM Review, 38(1):49--95, March 1996. Google ScholarDigital Library
Index Terms
- A Macaulay 2 package for computing sum of squares decompositions of polynomials with rational coefficients
Recommendations
Computing sum of squares decompositions with rational coefficients
Sum of squares (SOS) decompositions for nonnegative polynomials are usually computed numerically, using convex optimization solvers. Although the underlying floating point methods in principle allow for numerical approximations of arbitrary precision, ...
An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions
This paper presents an algorithm for computing a decomposition of a non-negative real polynomial as a sum of squares of rational functions. Rational functions in our algorithm have the denominators that are powers of the sum of squares of coordinate ...
Computing recurrence coefficients of multiple orthogonal polynomials
Multiple orthogonal polynomials satisfy a number of recurrence relations, in particular there is a (r+2)-term recurrence relation connecting the type II multiple orthogonal polynomials near the diagonal (the so-called step-line recurrence relation) and ...
Comments