The equivalence of semidefinite relaxations of polynomial 0-1 and ±1 programs via scaling

Authors:
Kevin K. H. Cheung
Affiliations:
School of Mathematics and Statistics, Carleton University, Canada
Venue:
Operations Research Letters
Year:
2008

Citing 7
Cited 0

A hierarchy of relaxation between the continuous and convex hull representations

SIAM Journal on Discrete Mathematics
Connections between semidefinite relaxations of the max-cut and stable set problems

Mathematical Programming: Series A and B
Fixing Variables in Semidefinite Relaxations

SIAM Journal on Matrix Analysis and Applications
Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lovász--Schrijver Lift-and-Project Procedure

SIAM Journal on Optimization
An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs

SIAM Journal on Optimization
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many combinatorial optimization problems can be modelled as polynomial-programming problems in binary variables that are all 0-1 or +/-1. A sufficient condition under which a common method for obtaining semidefinite-programming relaxations of the two models of the same problem gives equivalent relaxations is established.