Theta bodies for polynomial ideals

SIAM Journal on Optimization

Volumn 20, Issue 4, 2010, Pages 2097-2118

  Gouveia, João ^a   Parrilo, Pablo A ^b   Thomas, Rekha R ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Moment matrices; Polynomial ideals; Semidefinite programming; Sums of squares; Theta bodies

Indexed keywords

ARBITRARY POLYNOMIAL; CONVEX HULL; FEASIBLE REGIONS; FINITE POINT SETS; GEOMETRIC DESCRIPTION; REAL SOLUTIONS; SEMI-DEFINITE PROGRAMMING; SEMIDEFINITE PROGRAMS; SEMIDEFINITE RELAXATION; SUMS OF SQUARES;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL GEOMETRY; MATHEMATICAL PROGRAMMING;

POLYNOMIALS;

EID: 77951285325     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/090746525     Document Type: Article

References (34)

1. A. Barvinok, A Course in Convexity, Grad. Stud. Math. 54, American Mathematical Society, Providence, RI, 2002.
2. J. M. Borwein and A. S. Lewis, Convex Analysis and Nonlinear Optimization. Theory and Examples, 2nd ed., CMS Books Math./Ouvrages Math. 3, SMC, Springer, New York, 2006.
3. D. Cox, J. Little, and D. O'Shea, Ideals, Varieties and Algorithms, Springer, New York, 1992.
4. M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. Assoc. Comput. Mach., 42 (1995), pp. 1115-1145.
5. J. Gouveia, M. Laurent, P. Parrilo, and R. Thomas, A new hierarchy of semidefinite programming relaxations for cycles in binary matroids and cuts in graphs, arXiv:0907.4518.
6. M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, 2nd ed., Algorithms Combin. 2, Springer, Berlin, 1993.
7. M. Grötschel and W. R. Pulleyblank, Weakly bipartite graphs and the max-cut problem, Oper. Res. Lett., 1 (1981), pp. 23-27.
8. R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, 1985.
9. G. Kuperberg, R. Sanyal, A. Werner, and G. Ziegler, personal communication, 2009.
10. J. B. Lasserre, Global optimization with polynomials and the problem of moments, SIAM J. Optim., 11 (2001), pp. 796-817.
11. J. B. Lasserre, An explicit equivalent positive semidefinite program for nonlinear 0-1 programs, SIAM J. Optim., 12 (2002), pp. 756-769.
12. J. B. Lasserre, Convex sets with semidefinite representation, Math. Program., 120 (2009), pp. 457-477.
13. J. B. Lasserre, M. Laurent, and P. Rostalski, Semidefinite characterization and computation of zero-dimensional real radical ideals, Found. Comput. Math., 8 (2008), pp. 607-647.
14. M. Laurent, A comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre relaxations for 0-1 programming, Math. Oper. Res., 28 (2003), pp. 470-496.
15. M. Laurent, Semidefinite representations for finite varieties, Math. Program. Ser. A, 109 (2007), pp. 1-26.
16. M. Laurent, Sums of squares, moment matrices and optimization over polynomials, in Emerging Applications of Algebraic Geometry, IMA Vol. Math. Appl. 149, Springer, New York, 2009.
17. M. Laurent and F. Rendl, Semidefinite programming and integer programming, in Handbook on Discrete Optimization, K. Aardal, G. Nemhauser, and R. Weismantel, eds., Elsevier, New York, 2005, pp. 393-514.
18. L. Lovász, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, 25 (1979), pp. 1-7.
19. L. Lovász, Stable sets and polynomials, Discrete Math., 124 (1994), pp. 137-153.
20. L. Lovász, Semidefinite programs and combinatorial optimization, in Recent Advances in Algorithms and Combinatorics, CMS Books Math./Ouvrages Math. 11 SMC, Springer, New York, 2003, pp. 137-194.
21. L. Lovász and A. Schrijver, Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim., 1 (1991), pp. 166-190.
22. M. Marshall, Positive Polynomials and Sums of Squares, Math. Surveys Monographs 146, American Mathematical Society, Providence, RI, 2008.
23. P. A. Parrilo, Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization, Ph.D. thesis, California Institute of Technology, Pasadena, CA, 2000; also available at .
24. P. A. Parrilo, An Explicit Construction of Distinguished Representations of Polynomials Nonnegative over Finite Sets, IfA technical report AUT02-02, ETH Zurich, 2002.
25. P. A. Parrilo, Semidefinite programming relaxations for semialgebraic problems, Math. Program. Ser. B, 96 (2003), pp. 293-320.
26. P. A. Parrilo, Exploiting algebraic structure in sum of squares programs, in Positive Polynomials in Control, Lecture Notes in Control and Information Sciences 312, D. Henrion and A. Garulli, eds., Springer, New York, 2005.
27. V. Powers and C. Scheiderer, The moment problem for non-compact semialgebraic sets, Adv. Geom., 1 (2001), pp. 71-88.
28. G. Schoenebeck, Linear level Lasserre lower bounds for certain k-csps, in Proceedings of the IEEE Foundations of Computer Science, Philadelphia, 2008, pp. 593-602.
29. A. Schrijver, Theory of Linear and Integer Programming, Wiley-Intersci. Ser. Discrete Math. Optim., Wiley, New York, 1986.
30. A. Schrijver, Combinatorial Optimization. Polyhedra and Efficiency. Vol.B, Algorithms Combin. 24, Springer, Berlin, 2003.
31. F. B. Shepherd, The theta body and imperfection, in Perfect Graphs, Wiley-Intersci. Ser. Discrete Math. Optim., Wiley, Chichester, 2001, pp. 261-291.
32. R. P. Stanley, Decompositions of rational convex polytopes, Ann. Discrete Math., 6 (1980), pp. 333-342.
33. S. Sullivant, Compressed polytopes and statistical disclosure limitation, Tohoku Math. J. (2), 58 (2006), pp. 433-445.
34. L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.