Which nonnegative matrices are slack matrices?

DOI10.1016/j.laa.2013.08.009zbMath1283.15103arXiv1303.5670OpenAlexW1987569845MaRDI QIDQ2435500

Kanstantsin Pashkovich, João Gouveia, Volker Kaibel, Roland Grappe, Richard Z. Robinson, Rekha R. Thomas

Publication date: 19 February 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

algorithmpolytopespolyhedral conesslack matricespolyhedral verification problem

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items

Lifting for Simplicity: Concise Descriptions of Convex Sets, General non-realizability certificates for spheres with linear programming, Extension complexity of low-dimensional polytopes, Bounds on the number of 2-level polytopes, cones, and configurations, Complex psd-minimal polytopes in dimensions two and three, On Ranks of Regular Polygons, Self-Dual Polyhedral Cones and Their Slack Matrices, Combining realization space models of polytopes, Lifts of non-compact convex sets and cone factorizations, Quasi-independence models with rational maximum likelihood estimator, Enumeration of 2-level polytopes, A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector, Four-dimensional polytopes of minimum positive semidefinite rank, On the linear extension complexity of regular \(n\)-gons, The Slack Realization Space of a Polytope, Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes, Projectively unique polytopes and toric slack ideals, Recognizing Cartesian products of matrices and polytopes, On Vertices and Facets of Combinatorial 2-Level Polytopes, An algebraic approach to projective uniqueness with an application to order polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Expressing combinatorial optimization problems by linear programs
• A note on hyperplane generation
• Realization spaces of polytopes
• Convex hulls, oracles, and homology
• The Complexity of Vertex Enumeration Methods
• On the complexity of four polyhedral set containment problems
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Lifts of Convex Sets and Cone Factorizations