Lower Bounds on the Size of Semidefinite Programming Relaxations

DOI10.1145/2746539.2746599zbMath1321.90099arXiv1411.6317OpenAlexW2031923588MaRDI QIDQ2941550

David Steurer, James R. Lee, Prasad Raghavendra

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.6317

zbMATH Keywords

semidefinite programmingpolynomial optimizationquantum learningapproximation complexitylower bounds on positive-semidefinite ranksum-of-squares method

Mathematics Subject Classification ID

Semidefinite programming (90C22) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (63)

Lifting for Simplicity: Concise Descriptions of Convex Sets ⋮ Query Complexity in Expectation ⋮ On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy ⋮ Sum-of-squares rank upper bounds for matching problems ⋮ Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies ⋮ Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials ⋮ Communication Lower Bounds via Critical Block Sensitivity ⋮ Average case polyhedral complexity of the maximum stable set problem ⋮ Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness ⋮ Deterministic Communication vs. Partition Number ⋮ Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization ⋮ Matrices of Bounded Psd Rank are Easy to Detect ⋮ The matching problem has no small symmetric SDP ⋮ Covering the Large Spectrum and Generalized Riesz Products ⋮ Lifts for Voronoi cells of lattices ⋮ Sum of Squares Bounds for the Empty Integral Hull Problem ⋮ Complex psd-minimal polytopes in dimensions two and three ⋮ On Ranks of Regular Polygons ⋮ Sum-of-squares hierarchy lower bounds for symmetric formulations ⋮ Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\) ⋮ The Complexity of Positive Semidefinite Matrix Factorization ⋮ Self-Dual Polyhedral Cones and Their Slack Matrices ⋮ On approximations of the PSD cone by a polynomial number of smaller-sized PSD cones ⋮ Unnamed Item ⋮ From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More ⋮ Maximum semidefinite and linear extension complexity of families of polytopes ⋮ Query-to-Communication Lifting for BPP ⋮ Extension Complexity of Independent Set Polytopes ⋮ On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy ⋮ Positive semidefinite rank and nested spectrahedra ⋮ Unnamed Item ⋮ Affine reductions for LPs and SDPs ⋮ Limitations of semidefinite programs for separable states and entangled games ⋮ Some upper and lower bounds on PSD-rank ⋮ Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization ⋮ An Almost Optimal Algorithm for Computing Nonnegative Rank ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Slack Realization Space of a Polytope ⋮ Two Results on the Size of Spectrahedral Descriptions ⋮ On derandomized composition of Boolean functions ⋮ Exponential Lower Bounds for Polytopes in Combinatorial Optimization ⋮ Parameter selection method for support vector regression based on adaptive fusion of the mixed kernel function ⋮ Certifying Polynomial Nonnegativity via Hyperbolic Optimization ⋮ Sum-of-squares hierarchies for binary polynomial optimization ⋮ Strong reductions for extended formulations ⋮ Sum-of-squares hierarchies for binary polynomial optimization ⋮ Positive semidefinite rank ⋮ No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ ⋮ Unnamed Item ⋮ Size-degree trade-offs for sums-of-squares and positivstellensatz proofs ⋮ On the linear extension complexity of stable set polytopes for perfect graphs ⋮ Sum-of-Squares Rank Upper Bounds for Matching Problems ⋮ Unnamed Item ⋮ Extension complexity of formal languages ⋮ Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs ⋮ Lower bounds on matrix factorization ranks via noncommutative polynomial optimization ⋮ High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts ⋮ New limits of treewidth-based tractability in optimization

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming

This page was built for publication: Lower Bounds on the Size of Semidefinite Programming Relaxations