No article text was recorded for this version.
semidefinite programming lower bounds
Version 1 of 128 papers54 conceptsfrozen 2026-10-04
Papers in this version
- Blog: On the existence of 0/1 polytopes with high semidefinite extension complexity
- Blog: Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds
- Blog: The matching problem has no small symmetric SDP
- Blog: The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes
- Blog: Exponential Lower Bounds for Polytopes in Combinatorial Optimization
- Blog: Sparse sum-of-squares certificates on finite abelian groups
- Blog: The Exact Bipartite Matching Polytope Has Exponential Extension Complexity
- Blog: An algebraic approach to symmetric extended formulations
- Blog: Maximum Semidefinite and Linear Extension Complexity of Families of Polytopes
- Blog: The matching polytope does not admit fully-polynomial size relaxation schemes
- Blog: New limits of treewidth-based tractability in optimization
- Blog: Lower bounds on the size of semidefinite programming relaxations
- Blog: Irreducible Infeasible Subsystems of Semidefinite Systems
- Blog: No Small Linear Program Approximates Vertex Cover Within a Factor 2 - ɛ
- Blog: Communication Complexity (for Algorithm Designers)
- Blog: Sherali-Adams Integrality Gaps Matching the Log-Density Threshold
- Blog: A Deterministic Linear Program Solver in Current Matrix Multiplication Time
- Blog: Positive semidefinite rank
- Blog: Positive Semidefinite Programming: Mixed, Parallel, and Width-Independent
- Blog: Approximate Constraint Satisfaction Requires Large LP Relaxations
- Blog: On the Approximability of Digraph Ordering
- Blog: Extended Formulation Lower Bounds for Refuting Random CSPs
- Blog: Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems
- Blog: Proving Integrality Gaps without Knowing the Linear Program
- Blog: Semidefinite Approximations of the Matrix Logarithm
- Blog: Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems
- Blog: Strong Reductions for Extended Formulations
- Blog: Approximate broadcasting of quantum correlations
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_semidefinite_programming_lower_bounds_fdad375e,
title = {semidefinite programming lower bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/semidefinite-programming-lower-bounds/rdr_fdad375e8a634d75861178d1dc32e781},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_semidefinite_programming_lower_bounds_fdad375e_v1,
title = {semidefinite programming lower bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/semidefinite-programming-lower-bounds/rdr_fdad375e8a634d75861178d1dc32e781/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}