A Macaulay 2 package for computing sum of squares decompositions of polynomials with rational coefficients

SNC'07 - Proceedings of the 2007 International Workshop on Symbolic-Numeric Computation

Volumn , Issue , 2007, Pages 207-208

  Peyrl, Helfried ^a   Parrilo, Pablo A ^b  

^a ETH ZURICH   (Switzerland)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algebraic geometry; Semideffinite programming; Sum of squares; Symbolic numerical methods

Indexed keywords

COMPUTATION THEORY; COMPUTER SOFTWARE; MATHEMATICAL PROGRAMMING; NUMERICAL METHODS;

ALGEBRAIC GEOMETRY; SEMIDEFFINITE PROGRAMMING; SUM OF SQUARES;

POLYNOMIALS;

EID: 36448998081     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1277500.1277534     Document Type: Conference Paper

References (10)

1. 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.
2. 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.
3. 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/ .
4. E. Landau. Über die Darstellung definiter Funktionen als Summe von Quadraten. Math. Ann., 62:290-329, 1906.
5. P. A. Parrilo. Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization. PhD thesis, California, Institute of Technology, 2000.
6. H. Peyrl and P. A. Parrilo. SOS.m2, a sum of squares package for Macaulay 2. Available at http://www.control.ee.ethz.ch/~hpeyrl, 2007.
7. B. Reznick. Some concrete aspects of Hubert's 17th problem. In Real algebraic geometry and ordered structures, volume 253 of Contemporary Mathematics, pages 251-272. Amer. Math. Soc., Providence, RI, 2000.
8. M. Schweighofer. Algorithmische Beweise für Nichtnegativ- und Positivstellensätze. Master's thesis, Universität Passau, 1999.
9. N. Z. Shor. Class of global minimum bounds of polynomial functions. Cybernetics, 23(6):731-734, 1987.
10. L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 38(1):49-95, March 1996.