Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications
From MaRDI portal
Publication:2392765
DOI10.1007/s10898-012-9906-3zbMath1298.90109OpenAlexW2047382979MaRDI QIDQ2392765
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
Related Items
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
Cites Work
- Unnamed Item
- Unnamed Item
- Rank of Handelman hierarchy for Max-Cut
- Representing polynomials by positive linear functions on compact convex polyhedra
- The \(K\)-moment problem for compact semi-algebraic sets
- 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
- Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra
- On a Representation of the Matching Polytope Via Semidefinite Liftings
- On the Matrix-Cut Rank of Polyhedra
- Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Some news about the independence number of a graph
- Computation of the Lasserre Ranks of Some Polytopes
- On Lovász--Schrijver Lift-and-Project Procedures on the Dantzig--Fulkerson--Johnson Relaxation of the TSP
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
