Sum-of-squares hierarchies for binary polynomial optimization (Q5925640): Difference between revisions

@@ Property / cites work @@
+Approximating the cut-norm via Grothendieck's inequality
+Normal rank
@@ Property / cites work @@
+A lift-and-project cutting plane algorithm for mixed 0-1 programs
+Normal rank
@@ Property / cites work @@
+Correlation clustering
@@ Property / cites work: Correlation clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Sum-of-squares proofs and the quest toward optimal algorithms
+Normal rank
@@ Property / cites work @@
+A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis
+Normal rank
@@ Property / cites work @@
+Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
+Normal rank
@@ Property / cites work @@
+Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube
+Normal rank
@@ Property / cites work @@
+The sum-of-squares hierarchy on the sphere and applications in quantum information theory
+Normal rank
@@ Property / cites work @@
+Sparse sums of squares on finite abelian groups and improved semidefinite lifts
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack
+Normal rank
@@ Property / cites work @@
+Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems.
+Normal rank
@@ Property / cites work @@
+Global Optimization with Polynomials and the Problem of Moments
+Normal rank
@@ Property / cites work @@
+A MAX-CUT formulation of 0/1 programs
@@ Property / cites work: A MAX-CUT formulation of 0/1 programs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4537750
@@ Property / cites work: Q4537750 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
+Normal rank
@@ Property / cites work @@
+A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
+Normal rank
@@ Property / cites work @@
+Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
+Normal rank
@@ Property / cites work @@
+Semidefinite representations for finite varieties
@@ Property / cites work: Semidefinite representations for finite varieties / rank @@
+Normal rank
@@ Property / cites work @@
+Q3601990
@@ Property / cites work: Q3601990 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds on the Size of Semidefinite Programming Relaxations
+Normal rank
@@ Property / cites work @@
+Q4242013
@@ Property / cites work: Q4242013 / rank @@
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+Q4146667
@@ Property / cites work: Q4146667 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5343522
@@ Property / cites work: Q5343522 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of Putinar's Positivstellensatz
@@ Property / cites work: On the complexity of Putinar's Positivstellensatz / rank @@
+Normal rank
@@ Property / cites work @@
+SOS Is Not Obviously Automatizable, Even Approximately
+Normal rank
@@ Property / cites work @@
+On the Bit Complexity of Sum-of-Squares Proofs
@@ Property / cites work: On the Bit Complexity of Sum-of-Squares Proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Uniform denominators in Hilbert's seventeenth problem
+Normal rank
@@ Property / cites work @@
+Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
+Normal rank
@@ Property / cites work @@
+Matrix sum-of-squares relaxations for robust semi-definite programs
+Normal rank
@@ Property / cites work @@
+On the complexity of Schmüdgen's Positivstellensatz
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
+Normal rank
@@ Property / cites work @@
+Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets
+Normal rank
@@ Property / cites work @@
+Q3264312
@@ Property / cites work: Q3264312 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4256626
@@ Property / cites work: Q4256626 / rank @@
+Normal rank
@@ Property / cites work @@
+Polyhedral and semidefinite programming methods in combinatorial optimization
+Normal rank