Journal of Global Optimization

, Volume 56, Issue 2, pp 727–736

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



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.


Polynomial optimization Handelman hierarchy The maximum cut problem The stable set problem 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC. 2012

Authors and Affiliations

  1. 1.Department of Industrial and Management Systems EngineeringKyung Hee UniversityYongin-si, Kyunggi-doRepublic of Korea
  2. 2.Department of Industrial EngineeringSeoul National UniversitySeoulRepublic of Korea

Personalised recommendations