论文信息 - An upper bound for nonnegative rank - 字舞流文

An upper bound for nonnegative rank

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

Yaroslav Shitov

[1] Hans Raj Tiwary,et al. Extended Formulations for Polygons , 2011, Discret. Comput. Geom..

[2] Rekha R. Thomas,et al. Polytopes of Minimum Positive Semidefinite Rank , 2012, Discret. Comput. Geom..

[3] Hans Raj Tiwary,et al. Exponential Lower Bounds for Polytopes in Combinatorial Optimization , 2011, J. ACM.

[4] Gérard Cornuéjols,et al. Extended formulations in combinatorial optimization , 2013, Ann. Oper. Res..

[5] Mihalis Yannakakis,et al. Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.

[6] Stephen A. Vavasis,et al. On the Complexity of Nonnegative Matrix Factorization , 2007, SIAM J. Optim..

[7] Matthew M Lin,et al. On the Nonnegative Rank of Euclidean Distance Matrices. , 2010, Linear algebra and its applications.

[8] Pavel Hrubes,et al. On the nonnegative rank of distance matrices , 2012, Inf. Process. Lett..

[9] LeRoy B. Beasley,et al. Real rank versus nonnegative rank , 2009 .

[10] Nicolas Gillis,et al. On the Geometric Interpretation of the Nonnegative Rank , 2010, 1009.0880.

[11] Rekha R. Thomas,et al. Lifts of Convex Sets and Cone Factorizations , 2011, Math. Oper. Res..

[12] Joel E. Cohen,et al. Nonnegative ranks, decompositions, and factorizations of nonnegative matrices , 1993 .

[13] V. Kaibel. Extended Formulations in Combinatorial Optimization , 2011, 1104.1023.