Fetching the paper…
Reading the bibliography…
Inspired by a question of Lov\'asz, we introduce a hierarchy of nested semidefinite relaxations of the convex hull of real solutions to an arbitrary polynomial ideal, called theta bodies of the ideal.
Decompositions of rational convex polytopes
Richard P. Stanley · 1978
Earlier work this paper cites.
On the Shannon capacity of a graph
László Lovász · 1979
Earlier work this paper cites.
Matrix analysis
Roger A. Horn and Charles R. Johnson · 1985
Earlier work this paper cites.
Theory of Linear and Integer Programming
Alexander Schrijver · 1986
Earlier work this paper cites.
Stable sets and polynomials
László Lovász · 1990
Earlier work this paper cites.
Cones of matrices and set-functions and 0 0 - 1 1 optimization
László Lovász and Alexander Schrijver · 1991
Earlier work this paper cites.
Ideals, Varieties and Algorithms
David Cox, John Little, and Donal O’Shea · 1992
Earlier work this paper cites.
Geometric algorithms and combinatorial optimization
Martin Grötschel, László Lovász, and Alexander Schrijver · 1993
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Michel X. Goemans and David P. Williamson · 1995
Earlier work this paper cites.
Semidefinite programming
Lieven Vandenberghe and Stephen Boyd · 1996
Earlier work this paper cites.
Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization
Pablo A. Parrilo · 2000
Earlier work this paper cites.
Global optimization with polynomials and the problem of moments
Jean B. Lasserre · 2001
Cited alongside, same era.
The moment problem for non-compact semialgebraic sets
Victoria Powers and Claus Scheiderer · 2001
Cited alongside, same era.
The theta body and imperfection
F. Bruce Shepherd · 2001
Cited alongside, same era.
A course in convexity
Alexander Barvinok · 2002
Cited alongside, same era.
An explicit equivalent positive semidefinite program for nonlinear 0 0 - 1 1 programs
Jean B. Lasserre · 2002
Cited alongside, same era.
An explicit construction of distinguished representations of polynomials nonnegative over finite sets
Pablo A. Parrilo · 2002
Cited alongside, same era.
Semidefinite programming and integer programming
Monique Laurent and Franz Rendl · 2005
Later among the works it cites.
Exploiting algebraic structure in sum of squares programs
Pablo A. Parrilo · 2005
Later among the works it cites.
Convex analysis and nonlinear optimization. Theory and examples
Jonathan M. Borwein and Adrian S. Lewis · 2006
Later among the works it cites.
Compressed polytopes and statistical disclosure limitation
Seth Sullivant · 2006
Later among the works it cites.
Semidefinite representations for finite varieties
Monique Laurent · 2007
Later among the works it cites.
Semidefinite characterization and computation of zero- dimensional real radical ideals
Jean B. Lasserre, Monique Laurent, and Philipp Rostalski · 2008
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre relaxations for 0-1 programming
Monique Laurent · 2003
Cited alongside, same era.
Semidefinite programs and combinatorial optimization
László Lovász · 2003
Cited alongside, same era.
Semidefinite programming relaxations for semialgebraic problems
Pablo A. Parrilo · 2003
Cited alongside, same era.
Combinatorial optimization. Polyhedra and efficiency. Vol. B
Alexander Schrijver · 2003
Cited alongside, same era.
João Gouveia, Monique Laurent, Pablo Parrilo, and Rekha Thomas
Cited in the paper.
Positive polynomials and sums of squares
Murray Marshall · 2008
Closest in time.
Linear level lasserre lower bounds for certain k-csps
Grant Schoenebeck · 2008
Closest in time.
Convex sets with semidefinite representation
Jean B. Lasserre · 2009
Closest in time.
Sums of squares, moment matrices and optimization over polynomials
Monique Laurent · 2009
Closest in time.