Data Set

The following table summarizes the characteristics of the nonnegative matrices that can be downloaded here:

Please send us your own favorite nonnegative matrices to arnaud.vandaele at umons.ac.be.

[1] Beasley, L., Laffey, T.: Real rank versus nonnegative rank. Linear Algebra and its Applications 431(12), 2330–2335 (2009)

[2] Hrubes, P.: On the nonnegative rank of distance matrices. Information Processing Letters 112(11), 457–461 (2012)

[3] Fiorini, S., Rothvoss, T., Tiwary, H.: Extended formulations for polygons. Discrete & Computational Geometry 48(3), 658–668 (2012)

[4] Goemans, M.: Smallest compact formulation for the permutahedron (2009). [pdf]

[5] Shitov, Y.: An upper bound for nonnegative rank. Journal of Combinatorial Theory, Series A 122, 126–132 (2014)

[6] A. Vandaele, N. Gillis and F. Glineur, "On the Linear Extension Complexity of Regular n-gons", Linear Algebra and its Applications 521, pp. 217-239, 2017. [doi] [arXiv] [pdf]