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

DOI10.1007/S10898-012-9906-3MaRDI QIDQ2392765zbMATHOpenAlexFDO

Authors Myoung-Ju Park, Sung-Pil Hong

Publication date 2 August 2013

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-012-9906-3

zbMATH Keywords

polynomial optimizationstable set problemHandelman hierarchymaximum cut problem

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• Handelman's hierarchy for the maximum stable set problem
• Rank of Handelman hierarchy for Max-Cut
• Error bounds for some semidefinite programming approaches to polynomial minimization on the hypercube
• scientific article; zbMATH DE number 7305739
• Optimization over polynomials: selected topics

Cites work

• scientific article; zbMATH DE number 527343 (Why is no real title available?)
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Computation of the Lasserre Ranks of Some Polytopes
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Error bounds for some semidefinite programming approaches to polynomial minimization on the hypercube
• On Lovász--Schrijver Lift-and-Project Procedures on the Dantzig--Fulkerson--Johnson Relaxation of the TSP
• On a representation of the matching polytope via semidefinite liftings
• On the matrix-cut rank of polyhedra.
• Proving integrality gaps without knowing the linear program
• Rank of Handelman hierarchy for Max-Cut
• Representing polynomials by positive linear functions on compact convex polyhedra
• Semidefinite Programming vs. LP Relaxations for Polynomial Programming
• Some news about the independence number of a graph
• The \(K\)-moment problem for compact semi-algebraic sets
• Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra

Cited in

(3)

• Degree Bounds for Putinar’s Positivstellensatz on the Hypercube
• Improved convergence rates for Lasserre-type hierarchies of upper bounds for box-constrained polynomial optimization
• Handelman's hierarchy for the maximum stable set problem

This page was built for publication: Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392765)