Computation of the Lasserre Ranks of Some Polytopes

Authors:
Kevin K. H. Cheung
Affiliations:
School of Mathematics and Statistics, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario K1S 5B6, Canada
Venue:
Mathematics of Operations Research
Year:
2007

Citing 10
Cited 2

A hierarchy of relaxation between the continuous and convex hull representations

SIAM Journal on Discrete Mathematics
A lift-and-project cutting plane algorithm for mixed 0-1 programs

Mathematical Programming: Series A and B
When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?

Mathematics of Operations Research
Global Optimization with Polynomials and the Problem of Moments

SIAM Journal on Optimization
On the Matrix-Cut Rank of Polyhedra

Mathematics of Operations Research
GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi

ACM Transactions on Mathematical Software (TOMS)
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0--1 Programming

Mathematics of Operations Research
Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope

Mathematics of Operations Research
Subset Algebra Lift Operators for 0-1 Integer Programming

SIAM Journal on Optimization
Strengthened semidefinite programming bounds for codes

Mathematical Programming: Series A and B

Complexity analyses of Bienstock-Zuckerberg and lasserre relaxations on the matching and stable set polytopes

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Over the years, various lift-and-project methods have been proposed to construct hierarchies of successive linear or semidefinite relaxations of a 0--1 polytope P ⊆ Rn that converge to P in n steps. Many such methods have been shown to require n steps in the worst case. In this paper, we show that the method of Lasserre also requires n steps in the worst case.