Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications

Authors:
Myoung-Ju Park;Sung-Pil Hong
Affiliations:
Department of Industrial and Management Systems Engineering, Kyung Hee University, Yongin-si, Kyunggi-do, Republic of Korea 446-701;Department of Industrial Engineering, Seoul National University, Seoul, Republic of Korea 151-742
Venue:
Journal of Global Optimization
Year:
2013

Citing 11
Cited 0

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
On a Representation of the Matching Polytope Via Semidefinite Liftings

Mathematics of Operations Research
Proving Integrality Gaps without Knowing the Linear Program

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
On the Matrix-Cut Rank of Polyhedra

Mathematics of Operations Research
Semidefinite Programming vs. LP Relaxations for Polynomial Programming

Mathematics of Operations Research
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0--1 Programming

Mathematics of Operations Research
On Lovász-Schrijver Lift-and-Project Procedures on the Dantzig-Fulkerson-Johnson Relaxation of the TSP

SIAM Journal on Optimization
Computation of the Lasserre Ranks of Some Polytopes

Mathematics of Operations Research
Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra

Discrete Applied Mathematics
Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube

SIAM Journal on Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

It has been observed that the Handelman's certificate of positivity of a polynomial over a compact polyhedron offers a hierarchical relaxation scheme for polynomial programs. The Handelman hierarchy seems particularly suitable for a class of combinatorial optimizations that are formulated as a zero-diagonal quadratic program over a hypercube. In this paper, we present an error analysis of Handelman hierarchy applied to the special class of polynomial programs and its implications in the computation of the combinatorial optimization problems.