An upper bound for nonnegative rank

Authors:
Yaroslav Shitov
Affiliations:
-
Venue:
Journal of Combinatorial Theory Series A
Year:
2014

Citing 5
Cited 0

On the Complexity of Nonnegative Matrix Factorization

SIAM Journal on Optimization
On the nonnegative rank of distance matrices

Information Processing Letters
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Extended Formulations for Polygons

Discrete & Computational Geometry
Lifts of Convex Sets and Cone Factorizations

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a nontrivial upper bound for the nonnegative rank of rank-three matrices which allows us to prove that @?6n/7@? linear inequalities suffice to describe a convex n-gon up to a linear projection.