Sublinear extensions of polygons
From MaRDI portal
Cites work
- A note on the extension complexity of the knapsack polytope
- A short proof that the extension complexity of the correlation polytope grows exponentially
- An almost optimal algorithm for computing nonnegative rank
- An upper bound for nonnegative rank
- Approximate Constraint Satisfaction Requires Large LP Relaxations
- Combinatorial bounds on nonnegative rank and extended formulations
- Common information and unique disjointness
- Communication Complexity
- Euclidean distance matrices and separations in communication complexity theory
- Exponential lower bounds for polytopes in combinatorial optimization
- Expressing combinatorial optimization problems by linear programs
- Extended formulations for convex heptagons
- Extended formulations for packing and partitioning orbitopes
- Extended formulations for polygons
- Extended formulations in combinatorial optimization
- Extended formulations, nonnegative factorizations, and randomized communication protocols
- Extension complexity and realization spaces of hypersimplices
- Extension complexity of independent set polytopes
- Extension complexity of low-dimensional polytopes
- Extension complexity of polytopes with few vertices or facets
- Fixed points of the EM algorithm and nonnegative rank boundaries
- Four-dimensional polytopes of minimum positive semidefinite rank
- Heuristics for exact nonnegative matrix factorization
- Hidden vertices in extensions of polytopes
- Learning the parts of objects by non-negative matrix factorization
- Lifts of Convex Sets and Cone Factorizations
- Lower bounds on the size of semidefinite programming relaxations
- Maximal Flow Through a Network
- Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
- On 2-level polytopes arising in combinatorial settings
- On Polyhedral Approximations of the Second-Order Cone
- On Tensors, Sparsity, and Nonnegative Factorizations
- On the complexity of nonnegative matrix factorization
- On the existence of 0/1 polytopes with high semidefinite extension complexity
- On the extension complexity of combinatorial polytopes
- On the geometric interpretation of the nonnegative rank
- On the linear extension complexity of regular n-gons
- On the nonnegative rank of distance matrices
- On the nonnegative rank of Euclidean distance matrices
- Polygons as sections of higher-dimensional polytopes
- Polytopes of minimum positive semidefinite rank
- Positive semidefinite rank
- Real rank versus nonnegative rank
- Smallest compact formulation for the permutahedron
- Some \(0/1\) polytopes need exponential size extended formulations
- Stochastic factorizations, sandwiched simplices and the topology of the space of explanations
- Studying non-negative factorizations with tools from linear algebra over a semiring
- The matching polytope has exponential extension complexity
- The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes
- Tropical lower bound for extended formulations. II: Deficiency graphs of matrices
- Tropical lower bounds for extended formulations
- Worst-case results for positive semidefinite rank
This page was built for publication: Sublinear extensions of polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7228677)
