High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts
From MaRDI portal
Publication:5853720
DOI10.1137/17M1150712zbMath1461.90078arXiv1709.07966WikidataQ113779118 ScholiaQ113779118MaRDI QIDQ5853720
Publication date: 11 March 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.07966
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the membership problem for the \({0, 1/2}\)-closure
- Bounds on the Chvatal rank of polytopes in the 0/1-cube
- Semidefinite programming relaxations for semialgebraic problems
- Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem
- Symmetric sums of squares over \(k\)-subset hypercubes
- Symmetry groups, semidefinite programs, and sums of squares
- Sum-of-squares hierarchy lower bounds for symmetric formulations
- High degree sum of squares proofs, Bienstock-Zuckerberg hierarchy and CG cuts
- Approximate fixed-rank closures of covering problems
- Global Optimization with Polynomials and the Problem of Moments
- A Comprehensive Analysis of Polyhedral Lift-and-Project Methods
- Lower Bounds on the Size of Semidefinite Programming Relaxations
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack
- Integer Programming
- Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies
- Class of global minimum bounds of polynomial functions
- Lower bounds for resolution and cutting plane proofs and monotone computations
- Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems.
- SOS Is Not Obviously Automatizable, Even Approximately
- Subset Algebra Lift Operators for 0-1 Integer Programming
- Semidefinite Optimization and Convex Algebraic Geometry
- 0/1 Polytopes with Quadratic Chvátal Rank
- The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Algorithms in invariant theory
This page was built for publication: High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts
