Computing sum of squares decompositions with rational coefficients

Theoretical Computer Science

Volumn 409, Issue 2, 2008, Pages 269-281

  Peyrl, Helfried ^a   Parrilo, Pablo A ^b  

^a ETH ZURICH   (Switzerland)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

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

Indexed keywords

ALGEBRA; COMPUTATIONAL GEOMETRY; CONVERGENCE OF NUMERICAL METHODS; DECOMPOSITION; SOLUTIONS; THEOREM PROVING;

ALGEBRAIC GEOMETRY; APPROXIMATE SOLUTIONS; COMPUTER ALGEBRA SYSTEMS; CONVEX OPTIMIZATIONS; FLOATING POINTS; NONNEGATIVE POLYNOMIALS; NUMERICAL APPROXIMATIONS; NUMERICAL ERRORS; NUMERICAL TECHNIQUES; RATIONAL COEFFICIENTS; SEMIDEFINITE PROGRAMMING; SEMIDEFINITE PROGRAMS; SUM OF SQUARES; SUM OF SQUARES DECOMPOSITIONS; SYMBOLIC METHODS; SYMBOLIC-NUMERICAL METHODS;

NUMERICAL METHODS;

EID: 55749106047     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.09.025     Document Type: Article

References (44)

1. H. Anai, P.A. Parrilo, Convex quantifier elimination for semidefinite programming, in: Proceedings of the International Workshop on Computer Algebra in Scientific Computing, CASC 2003, 2003
2. C. Bachoc, F. Vallentin, New upper bounds for kissing numbers from semidefinite programming. arXiv:math/0608426v4[math.MG], 2006
3. Borchers B. A C library for semidefinite programming. Optim. Meth. Software 11 1 (1999) 613-623
4. Borwein J.M., and Wolkowicz H. Facial reduction for a cone-convex programming problem. J. Aust. Math. Soc. Ser. A 30 3 (1980-81) 369-380
5. Boyd S., and Vandenberghe L. Convex Optimization (2004), Cambridge University Press
6. Choi M.D., Lam T.Y., and Reznick B. Sums of squares of real polynomials. K-Theory and Algebraic Geometry: Connections with Quadratic Forms and Division Algebras. Proc. Sympos. Pure Math. vol. 58 (1995), Amer. Math. Soc., Providence, RI 103-126
7. Doherty A.C., Parrilo P.A., and Spedalieri F.M. Distinguishing separable and entangled states. Phys. Rev. Lett. 88 18 (2002) 187904
8. K. Fujisawa, M. Kojima, K. Nakata, M. Yamashita, SDPA (SemiDefinite Programming Algorithm). Available from http://grid.r.dendai.ac.jp/sdpa
9. Golub G., and van Loan C. Matrix Computations. 2nd ed. Johns Hopkins Series in the Mathematical Sciences (1989), The Johns Hopkins University Press, Baltimore, Maryland
10. D.R. Grayson, M.E. Stillman, Macaulay 2, a software system for research in algebraic geometry. Available from http://www.math.uiuc.edu/Macaulay2
11. Harrison J. Verifying nonlinear real formulas via sums of squares. In: Schneider K., and Brandt J. (Eds). Proceedings of the 20th International Conference on Theorem Proving in Higher Order Logics. TPHOLs 2007. Lect. Notes Comput. Sci. vol. 4732 (2007), Springer-Verlag, Kaiserslautern, Germany
12. D. Henrion, J.B. Lasserre, J. Löfberg, Gloptipoly 3. Available from http://www.laas.fr/~henrion/software/gloptipoly3, 2007
13. C.J. Hillar, Sums of squares over totally real fields are rational sums of squares. arXiv:0704.2824v2[math.AC], 2007
14. Horn R.A., and Johnsob C.R. Matrix Analysis (1995), Cambridge University Press, Cambridge
15. Jones W., and Thron W. Continued Fractions: Analytic Theory and Applications. Encyclopedia of Mathematics and its Applications vol. 11 (1980), Addison-Wesley Publishing Company
16. I. Klep, M. Schweighofer, Sums of hermitian squares and the BMV conjecture. Available from http://perso.univ-rennes1.fr/markus.schweighofer/publications/bmv.pdf, 2007
17. Landau E. Über die Darstellung definiter Funktionen als Summe von Quadraten. Math. Ann. 62 (1906) 290-329
18. Lasserre J.B. Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11 (2001) 796-817
19. Lenstra A.K., Lenstra H.W., and Lovász L. Factoring polynomials with rational coefficients. Math. Ann. 261 4 (1982) 515-534
20. J. Löfberg, YALMIP: A toolbox for modeling and optimization in MATLAB, in: Proceedings of the CACSD Conference, Taipei, Taiwan, 2004. Available from http://control.ee.ethz.ch/~joloef/yalmip.php
21. Nesterov Y. Squared functional systems and optimization problems. In: Frenk J., Roos C., Terlaky T., and Zhang S. (Eds). High Performance Optimization (2000), Kluwer Academic Publishers 405-440
22. J. Nie, Sum of squares method for sensor network localization, Computational Optimization and Applications (in press) published online at http://www.springerlink.com/content/xj58880l17615817/, 2007
23. J. Nie, K. Ranestad, B. Sturmfels, The algebraic degree of semidefinite programming. arXiv:math/0611562v2[math.OC], 2006
24. Parrilo P., and Sturmfels B. Minimizing polynomial functions. Algorithmic and Quantitative Real Algebraic Geometry. DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 60 (2003), Amer. Math. Soc 83-99
25. P.A. Parrilo, Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization, Ph.D. Thesis, California Institute of Technology, 2000
26. Parrilo P.A. Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96 2 (2003) 293-320
27. Parrilo P.A., and Peretz R. A geometric inequality for circle packings. Discrete Comput. Geom. 31 3 (2004) 357-367
28. H. Peyrl, P.A. Parrilo, SOS.m2, a sum of squares package for Macaulay 2. Available from http://www.control.ee.ethz.ch/~hpeyrl/index.php, 2007
29. Pourchet Y. Sur la représentation en somme de carrés des polynômes à une indéterminée sur un corps de nombres algébriques. Acta Arithm. 19 (1971) 89-104
30. Powers V., and Wörmann T. An algorithm for sums of squares of real polynomials. J. Pure Appl. Algebra 127 (1998) 99-104
31. Prajna S., Jadbabaie A., and Pappas G.J. A framework for worst-case and stochastic safety verification using barrier certificates. IEEE Trans. Automat. Control 52 8 (2007) 1415-1428
32. S. Prajna, A. Papachristodoulou, P. Seiler, P.A. Parrilo, SOSTOOLS: Sum of squares optimization toolbox for MATLAB. Available from http://www.cds.caltech.edu/sostools and http://www.mit.edu/~parrilo/sostools, 2004
33. Prajna S., Parrilo P.A., and Rantzer A. Nonlinear control synthesis by convex optimization. IEEE Trans. Automat. Contr. 49 2 (2004) 310-314
34. Prestel A., and Delzell C.N. Positive Polynomials (2001), Springer
35. Rajwade A.R. Squares. London Mathematical Society Lecture Notes vol. 171 (1993)
36. Reznick B. Extremal psd forms with few terms. Duke Math. J. 45 (1978) 363-374
37. Reznick B. Some concrete aspects of Hilbert's 17th problem. Real Algebraic Geometry and Ordered Structures. Contemporary Mathematics vol. 253 (2000), Amer. Math. Soc, Providence, RI 251-272
38. M. Schweighofer, Algorithmische Beweise für Nichtnegativ- und Positivstellensätze, Master's Thesis, Universität Passau, 1999
39. Shor N.Z. Class of global minimum bounds of polynomial functions. Cybernetics 23 6 (1987) 731-734
40. Sturm J.F. Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Interior point methods. Optim. Meth. Software 11-12 1-4 (1999) 625-653
41. Tütüncü R.H., Toh K.C., and Todd M.J. Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. Ser. B 95 (2003) 189-217
42. Vandenberghe L., and Boyd S. Semidefinite programming. SIAM Rev. 38 1 (1996) 49-95
43. H.-C. von Bothmer, K. Ranestad, A general formula for the algebraic degree in semidefinite programming. math.AG/0701877, 2007
44. Waki H., Kim S., Kojima M., and Muramatsu M. Sums of squares and semidefinite programming relaxation for polynomial optimization problems with structured sparsity. SIAM J. Optim. 17 1 (2006) 218-242. http://www.is.titech.ac.jp/~kojima/SparsePOP Available from http://www.is.titech.ac.jp/~kojima/SparsePOP