An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs

By Jean B. Lasserre. Conference on Integer Programming and Combinatorial Optimization, 2001

306 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Mixed-integer nonlinear optimization*† (2013, background): “Linderoth (2005) studied a simplicial branch-and-bound algorithm for QCQP.”
Revisiting two theorems of Curto and Fialkow on moment matrices (2005, unknown): “For instance, they have been used by Lasserre [18, 19] for proving the finite convergence of the bounds p∗t to p ∗ in the 0/1 and grid cases.”
Approximation of the Stability Number of a Graph via Copositive Programming (2002, background): “Most recently, Laserre [13, 14] has introduced yet another lift-and-”
Concave Quadratic Cuts for Mixed-Integer Quadratic Problems (2015, methodology): “Whether this method has any direct relationship with the (3rd) Lasserre hierarchy is an outstanding question.”
Towards Sharp Inapproximability For Any 2-CSP (2007, unknown): “The three most well-known such hierarchies are the Lovász-Schrijver hierarchy [36], the Sherali-Adams hierarchy [45], and the Lasserre hierarchy [34].”