{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T21:46:18Z","timestamp":1777499178744,"version":"3.51.4"},"reference-count":78,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T00:00:00Z","timestamp":1548892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007659","name":"Tilburg University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10208-018-09410-y","type":"journal-article","created":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T14:02:32Z","timestamp":1548943352000},"page":"1013-1070","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization"],"prefix":"10.1007","volume":"19","author":[{"given":"Sander","family":"Gribling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"de Laat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monique","family":"Laurent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,31]]},"reference":[{"key":"9410_CR1","volume-title":"Handbook on Semidefinite, Conic and Polynomial Optimization. International Series in Operations Research & Management Science Series","author":"M.F Anjos","year":"2012","unstructured":"M.F. Anjos and J.B. Lasserre. Handbook on Semidefinite, Conic and Polynomial Optimization. International Series in Operations Research & Management Science Series, Springer, 2012."},{"key":"9410_CR2","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.jctb.2018.11.002","volume":"136","author":"Albert Atserias","year":"2019","unstructured":"A. Atserias, L. Man\u010dinska, D. Roberson, R. \u0160\u00e1mal, S. Severini, and A. Varvitsiotis. Quantum and non-signalling graph isomorphisms. Journal of Combinatorial Theory, Series B (2018). \n                    https:\/\/doi.org\/10.1016\/j.jctb.2018.11.002\n                    \n                  .","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"2","key":"9410_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0024-3795(78)90043-5","volume":"20","author":"GP Barker","year":"1978","unstructured":"G.P. Barker, L.Q. Eifler, and T.P. Kezlan. A non-commutative spectral theorem, Linear Algebra and its Applications 20(2) (1978), 95\u2013100.","journal-title":"Linear Algebra and its Applications"},{"key":"9410_CR4","doi-asserted-by":"publisher","first-page":"3035","DOI":"10.1090\/S0002-9939-06-08249-9","volume":"134","author":"C Bayer","year":"2006","unstructured":"C. Bayer, J. Teichmann. The proof of Tchakaloff\u2019s theorem. Proceedings of the American Mathematical Society 134 (2006), 3035\u20133040.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"9410_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.laa.2006.04.001","volume":"419","author":"A Berman","year":"2006","unstructured":"A. Berman, U.G. Rothblum. A note on the computation of the cp-rank. Linear Algebra and its Applications 419 (2006), 1\u20137.","journal-title":"Linear Algebra and its Applications"},{"key":"9410_CR6","doi-asserted-by":"publisher","DOI":"10.1142\/5273","volume-title":"Completely Positive Matrices","author":"A Berman","year":"2003","unstructured":"A. Berman, N. Shaked-Monderer. Completely Positive Matrices. World Scientific, 2003."},{"issue":"3","key":"9410_CR7","doi-asserted-by":"publisher","first-page":"1529","DOI":"10.1137\/15M1037731","volume":"26","author":"M Berta","year":"2016","unstructured":"M.\u00a0Berta, O.\u00a0Fawzi, V.B.\u00a0Scholz. Quantum bilinear optimization. SIAM Journal on Optimization 26(3) (2016), 1529\u20131564.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"9410_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"J. Bezanson, A. Edelman, S. Karpinski, V.B. Shah. Julia: A Fresh Approach to Numerical Computing. SIAM Review 59(1) (2017), 65\u201398.","journal-title":"SIAM Review"},{"key":"9410_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-28517-2","volume-title":"Operator Algebras: Theory of C*-Algebras and Von Neumann Algebras. Encyclopaedia of Mathematical Sciences","author":"B Blackadar","year":"2006","unstructured":"B. Blackadar. Operator Algebras: Theory of C*-Algebras and Von Neumann Algebras. Encyclopaedia of Mathematical Sciences, Springer, 2006."},{"key":"9410_CR10","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.laa.2014.06.025","volume":"459","author":"IM Bomze","year":"2014","unstructured":"I.M. Bomze, W. Schachinger, R. Ullrich. From seven to eleven: Completely positive matrices with high cp-rank. Linear Algebra and its Applications 459 (2014), 208 \u2013 221.","journal-title":"Linear Algebra and its Applications"},{"key":"9410_CR11","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1137\/140973207","volume":"36","author":"IM Bomze","year":"2015","unstructured":"I.M. Bomze, W. Schachinger, R. Ullrich. New lower bounds and asymptotics for the cp-rank. SIAM Journal on Matrix Analysis and Applications 36 (2015), 20\u201337.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"3","key":"9410_CR12","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1287\/moor.2014.0694","volume":"40","author":"G Braun","year":"2015","unstructured":"G. Braun, S. Fiorini, S. Pokutta, D. Steurer. Approximation limits of linear programs (beyond hierarchies). Mathematics of Operations Research 40(3) (2015), 756\u2013772. Appeared earlier in FOCS\u201912.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"9410_CR13","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"S. Burer. On the copositive representation of binary and continuous nonconvex quadratic programs. Mathematical Programming 120(2) (2009), 479\u2013495.","journal-title":"Mathematical Programming"},{"issue":"1","key":"9410_CR14","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s10107-011-0505-8","volume":"137","author":"S Burgdorf","year":"2013","unstructured":"S. Burgdorf, K. Cafuta, I. Klep, J. Povh. The tracial moment problem and trace-optimization of polynomials. Mathematical Programming 137(1) (2013), 557\u2013578.","journal-title":"Mathematical Programming"},{"issue":"1","key":"9410_CR15","first-page":"141","volume":"68","author":"S Burgdorf","year":"2012","unstructured":"S. Burgdorf, I. Klep. The truncated tracial moment problem. Journal of Operator Theory 68(1) (2012), 141\u2013163.","journal-title":"Journal of Operator Theory"},{"key":"9410_CR16","volume-title":"Optimization of Polynomials in Non-Commutative Variables. Springer Briefs in Mathematics","author":"S Burgdorf","year":"2016","unstructured":"S. Burgdorf, I. Klep, J. Povh. Optimization of Polynomials in Non-Commutative Variables. Springer Briefs in Mathematics, Springer, 2016."},{"key":"9410_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.13001\/1081-3810.3201","volume":"32","author":"S Burgdorf","year":"2017","unstructured":"S. Burgdorf, M. Laurent, T. Piovesan. On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings. Electronic Journal of Linear Algebra 32 (2017), 15\u201340.","journal-title":"Electronic Journal of Linear Algebra"},{"key":"9410_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10288-010-0122-z","volume":"8","author":"M Conforti","year":"2010","unstructured":"M. Conforti, G. Cornu\u00e9jols, G. Zambelli. Extended formulations in combinatorial optimization. 4OR 8 (2010), 1\u201348.","journal-title":"4OR"},{"key":"9410_CR19","volume-title":"Solution of the Truncated Complex Moment Problem for Flat Data. Memoirs of the American Mathematical Society","author":"RE Curto","year":"1996","unstructured":"R.E.\u00a0Curto, L.A. Fialkow. Solution of the Truncated Complex Moment Problem for Flat Data. Memoirs of the American Mathematical Society, American Mathematical Society, 1996."},{"issue":"3","key":"9410_CR20","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1137\/110848177","volume":"33","author":"P Dickinson","year":"2012","unstructured":"P. Dickinson, M. D\u00fcr. Linear-time complete positivity detection and decomposition of sparse matrices. SIAM Journal on Matrix Analysis and Applications 33(3) (2012), 701\u2013720.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"4","key":"9410_CR21","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1080\/03081089408818334","volume":"37","author":"JH Drew","year":"1994","unstructured":"J.H. Drew, C.R. Johnson, R. Loewy. Completely positive matrices associated with M-matrices. Linear and Multilinear Algebra 37(4) (1994), 303\u2013310.","journal-title":"Linear and Multilinear Algebra"},{"key":"9410_CR22","unstructured":"K.J. Dykema, V.I. Paulsen, J. Prakash. Non-closure of the set of quantum correlations via graphs, \n                    arXiv:1709.05032\n                    \n                   (2017)."},{"key":"9410_CR23","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69 B","author":"J Edmonds","year":"1965","unstructured":"J. Edmonds. Maximum matching and a polyhedron with \n                    \n                      \n                    \n                    $$0,1$$\n                    \n                      \n                        \n                          0\n                          ,\n                          1\n                        \n                      \n                    \n                   vertices. Journal of Research of the National Bureau of Standards 69 B (1965), 125\u2013130.","journal-title":"Journal of Research of the National Bureau of Standards"},{"issue":"1","key":"9410_CR24","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10107-014-0755-3","volume":"153","author":"Y Faenza","year":"2015","unstructured":"Y. Faenza, S. Fiorini, R. Grappe, H. Tiwari. Extended formulations, non-negative factorizations and randomized communication protocols. Mathematical Programming 153(1) (2015), 75\u201394.","journal-title":"Mathematical Programming"},{"issue":"1","key":"9410_CR25","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10107-015-0922-1","volume":"153","author":"H Fawzi","year":"2015","unstructured":"H. Fawzi, J. Gouveia, P.A. Parrilo, R.Z. Robinson, R.R. Thomas. Positive semidefinite rank. Mathematical Programming 153(1) (2015), 133\u2013177.","journal-title":"Mathematical Programming"},{"issue":"1","key":"9410_CR26","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10107-014-0837-2","volume":"153","author":"H Fawzi","year":"2015","unstructured":"H. Fawzi, P.A. Parrilo. Lower bounds on nonnegative rank via nonnegative nuclear norms. Mathematical Programming 153(1) (2015), 41\u201366.","journal-title":"Mathematical Programming"},{"issue":"1","key":"9410_CR27","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10107-015-0937-7","volume":"158","author":"H Fawzi","year":"2016","unstructured":"H. Fawzi, P.A. Parrilo. Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank. Mathematical Programming 158(1) (2016), 417\u2013465.","journal-title":"Mathematical Programming"},{"issue":"1","key":"9410_CR28","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.disc.2012.09.015","volume":"313","author":"S Fiorini","year":"2013","unstructured":"S. Fiorini, V. Kaibel, K. Pashkovich, D. Theis. Combinatorial bounds on nonnegative rank and extended formulations. Discrete Mathematics 313(1) (2013), 67\u201383.","journal-title":"Discrete Mathematics"},{"issue":"2","key":"9410_CR29","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1145\/2716307","volume":"62","author":"S Fiorini","year":"2015","unstructured":"S. Fiorini, S. Massar, S. Pokutta, H.R. Tiwary, R. de Wolf. Exponential lower bounds for polytopes in combinatorial optimization. Journal of the ACM 62(2) (2015), 17:1\u201317:23. Appeared earlier in STOC\u201912.","journal-title":"Journal of the ACM"},{"issue":"1","key":"9410_CR30","first-page":"7","volume":"25","author":"N Gillis","year":"2017","unstructured":"N. Gillis. Introduction to nonnegative matrix factorization. SIAG\/OPT Views and News 25(1) (2017), 7\u201316.","journal-title":"SIAG\/OPT Views and News"},{"issue":"11","key":"9410_CR31","doi-asserted-by":"publisher","first-page":"2685","DOI":"10.1016\/j.laa.2012.06.038","volume":"437","author":"N Gillis","year":"2012","unstructured":"N. Gillis, F. Glineur. On the geometric interpretation of the nonnegative rank. Linear Algebra and its Applications 437(11) (2012), 2685\u20132712.","journal-title":"Linear Algebra and its Applications"},{"issue":"1","key":"9410_CR32","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-014-0757-1","volume":"153","author":"M Goemans","year":"2015","unstructured":"M. Goemans. Smallest compact formulation for the permutahedron. Mathematical Programming 153(1) (2015), 5\u201311.","journal-title":"Mathematical Programming"},{"issue":"4","key":"9410_CR33","doi-asserted-by":"publisher","first-page":"2612","DOI":"10.1137\/16M1105608","volume":"31","author":"AP Goucha","year":"2016","unstructured":"A.P. Goucha, J. Gouveia, P.M. Silva. On ranks of regular polygons. SIAM Journal on Discrete Mathematics 31(4) (2016), 2612\u20132625.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"9410_CR34","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1287\/moor.1120.0575","volume":"38","author":"J Gouveia","year":"2013","unstructured":"J. Gouveia, P.A. Parrilo, R.R. Thomas. Lifts of convex sets and cone factorizations. Mathematics of Operations Research 38(2) (2013), 248\u2013264.","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"9410_CR35","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s00454-013-9533-x","volume":"50","author":"J Gouveia","year":"2013","unstructured":"J. Gouveia, R.Z. Robinson, R.R. Thomas. Polytopes of minimum positive semidefinite rank. Discrete & Computational Geometry 50(3) (2013), 679\u2013699.","journal-title":"Discrete & Computational Geometry"},{"key":"9410_CR36","unstructured":"M. Grant, S. Boyd. CVX: Matlab Software for Disciplined Convex Programming, version 2.1, 2014. \n                    http:\/\/cvxr.com\/cvx"},{"issue":"1","key":"9410_CR37","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-018-1287-z","volume":"171","author":"S Gribling","year":"2018","unstructured":"S. Gribling, D. de Laat, M. Laurent. Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. Mathematical Programming Series B 171(1) (2018), 5\u201342.","journal-title":"Mathematical Programming Series B"},{"key":"9410_CR38","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.laa.2016.10.015","volume":"513","author":"S Gribling","year":"2017","unstructured":"S. Gribling, D. de Laat, M. Laurent. Matrices with high completely positive semidefinite rank. Linear Algebra and its Applications 513 (2017), 122 \u2013 148.","journal-title":"Linear Algebra and its Applications"},{"key":"9410_CR39","unstructured":"P. Groetzner, M. D\u00fcr. A factorization method for completely positive matrices. Preprint (2018), \n                    http:\/\/www.optimization-online.org\/DB_HTML\/2018\/03\/6511.html\n                    \n                  ."},{"issue":"2","key":"9410_CR40","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz., A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2) (1981), 169\u2013197.","journal-title":"Combinatorica"},{"issue":"1","key":"9410_CR41","doi-asserted-by":"publisher","first-page":"164","DOI":"10.2307\/2371063","volume":"58","author":"EK Haviland","year":"1936","unstructured":"E.K. Haviland. On the Momentum Problem for Distribution Functions in More Than One Dimension. II. American Journal of Mathematics 58(1) (1936), 164\u2013168.","journal-title":"II. American Journal of Mathematics"},{"issue":"8","key":"9410_CR42","doi-asserted-by":"publisher","first-page":"5171","DOI":"10.1109\/TIT.2013.2258372","volume":"59","author":"R Jain","year":"2013","unstructured":"R. Jain, Y. Shi, Z. Wei, S. Zhang. Efficient protocols for generating bipartite classical distributions and quantum states. IEEE Transactions on Information Theory 59(8) (2013), 5171\u20135178.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"9410_CR43","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10898-015-0308-1","volume":"64","author":"I Klep","year":"2016","unstructured":"I. Klep, J. Povh. Constrained trace-optimization of polynomials in freely noncommuting variables. Journal of Global Optimization 64(2) (2016), 325\u2013348.","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"9410_CR44","doi-asserted-by":"publisher","first-page":"1816","DOI":"10.1016\/j.aim.2007.09.016","volume":"217","author":"I Klep","year":"2008","unstructured":"I. Klep, M. Schweighofer. Connes\u2019 embedding conjecture and sums of hermitian squares. Advances in Mathematics 217(4) (2008), 1816\u20131837.","journal-title":"Advances in Mathematics"},{"issue":"4","key":"9410_CR45","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"E Klerk de","year":"2002","unstructured":"E. de Klerk, D.V. Pasechnik. Approximation of the stability number of a graph via copositive program-ming. SIAM Journal on Optimization 12(4) (2002), 875\u2013892.","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"9410_CR46","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"J.B. Lasserre. Global optimization with polynomials and the problem of moments. SIAM Journal on Optimization 11(3) (2001), 796\u2013817.","journal-title":"SIAM Journal on Optimization"},{"key":"9410_CR47","doi-asserted-by":"publisher","DOI":"10.1142\/p665","volume-title":"Moments, Positive Polynomials and Their Applications","author":"JB Lasserre","year":"2009","unstructured":"J.B. Lasserre. Moments, Positive Polynomials and Their Applications, . Imperial College Press, 2009."},{"issue":"1\u20132","key":"9410_CR48","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10107-013-0632-5","volume":"144","author":"JB Lasserre","year":"2014","unstructured":"J.B. Lasserre. New approximations for the cone of copositive matrices and its dual. Mathematical Programming 144(1-2) (2014), 265\u2013276.","journal-title":"Mathematical Programming"},{"key":"9410_CR49","doi-asserted-by":"crossref","unstructured":"M. Laurent. Sums of squares, moment matrices and optimization over polynomials. In Emerging Applications of Algebraic Geometry (M. Putinar, S. Sullivant eds.), Springer, 2009, pp. 157\u2013270.","DOI":"10.1007\/978-0-387-09686-5_7"},{"issue":"4","key":"9410_CR50","doi-asserted-by":"publisher","first-page":"2461","DOI":"10.1137\/14097865X","volume":"25","author":"M Laurent","year":"2015","unstructured":"M. Laurent, T. Piovesan. Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone. SIAM Journal on Optimization 25(4) (2015), 2461\u20132493.","journal-title":"SIAM Journal on Optimization"},{"key":"9410_CR51","doi-asserted-by":"crossref","unstructured":"J.R. Lee, P. Raghavendra, D. Steurer. Lower bounds on the size of semidefinite programming relaxations. In Proceedings of the Forty-seventh Annual ACM Symposium on Theory of Computing, STOC\u201915, 2015, pp. 567\u2013576.","DOI":"10.1145\/2746539.2746599"},{"issue":"1","key":"9410_CR52","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10107-016-1052-0","volume":"162","author":"T Lee","year":"2017","unstructured":"T. Lee, Z. Wei, R. de Wolf. Some upper and lower bounds on psd-rank. Mathematical Programming 162(1) (2017), 495\u2013521.","journal-title":"Mathematical Programming"},{"key":"9410_CR53","unstructured":"L. Man\u010dinska, D. Roberson. Note on the correspondence between quantum correlations and the completely positive semidefinite cone. Available at quantuminfo.quantumlah.org\/memberpages\/laura\/corr.pdf (2014)."},{"issue":"3","key":"9410_CR54","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0167-6377(91)90028-N","volume":"10","author":"RK Martin","year":"1991","unstructured":"R.K. Martin. Using separation algorithms to generate mixed integer model reformulations. Operations Research Letters 10(3) (1991), 119\u2013128.","journal-title":"Operations Research Letters"},{"issue":"2039","key":"9410_CR55","doi-asserted-by":"publisher","first-page":"2821","DOI":"10.1098\/rspa.2003.1150","volume":"459","author":"D Mond","year":"2003","unstructured":"D. Mond, J. Smith, D. van Straten. Stochastic factorizations, sandwiched simplices and the topology of the space of explanations. Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences\n                           459(2039) (2003), 2821\u20132845.","journal-title":"Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences"},{"key":"9410_CR56","unstructured":"MOSEK ApS. The MOSEK optimization toolbox for MATLAB manual. Version 8.0.0.81, 2017. URL\u00a0\n                    http:\/\/docs.mosek.com\/8.0\/toolbox.pdf"},{"key":"9410_CR57","doi-asserted-by":"crossref","unstructured":"M. Navascu\u00e9s, S. Pironio, A. Ac\u00edn. SDP relaxations for non-commutative polynomial optimization. In Handbook on Semidefinite, Conic and Polynomial Optimization (M.F.\u00a0Anjos, J.B.\u00a0Lasserre eds.). Springer, 2012, pp. 601\u2013634.","DOI":"10.1007\/978-1-4614-0769-0_21"},{"issue":"6","key":"9410_CR58","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1007\/s10208-014-9225-9","volume":"14","author":"J Nie","year":"2014","unstructured":"J. Nie. The \n                    \n                      \n                    \n                    $${\\cal{A}}$$\n                    \n                      \n                        A\n                      \n                    \n                  -truncated \n                    \n                      \n                    \n                    $$K$$\n                    \n                      \n                        K\n                      \n                    \n                  -moment problem. Foundations of Computational Mathematics 14(6) (2014), 1243\u20131276.","journal-title":"Foundations of Computational Mathematics"},{"issue":"1","key":"9410_CR59","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1137\/16M1083384","volume":"1","author":"J Nie","year":"2017","unstructured":"J. Nie. Symmetric tensor nuclear norms. SIAM Journal on Applied Algebra and Geometry 1(1) (2017), 599\u2013625.","journal-title":"SIAM Journal on Applied Algebra and Geometry"},{"key":"9410_CR60","unstructured":"P.A. Parrilo. Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization. PhD thesis, Caltech, 2000."},{"issue":"5","key":"9410_CR61","doi-asserted-by":"publisher","first-page":"2157","DOI":"10.1137\/090760155","volume":"20","author":"S Pironio","year":"2010","unstructured":"S. Pironio, M. Navascu\u00e9s, A. Ac\u00edn. Convergent relaxations of polynomial optimization problems with noncommuting variables. SIAM Journal on Optimization 20(5) (2010), 2157\u20132180.","journal-title":"SIAM Journal on Optimization"},{"issue":"1\u20132","key":"9410_CR62","first-page":"397","volume":"171","author":"A Prakash","year":"2017","unstructured":"A. Prakash, J. Sikora, A. Varvitsiotis, Z. Wei. Completely positive semidefinite rank. Mathematical Programming 171(1\u20132) (2017), 397\u2013431.","journal-title":"Mathematical Programming"},{"key":"9410_CR63","doi-asserted-by":"publisher","unstructured":"A. Prakash, A. Varvitsiotis. Correlation matrices, Clifford algebras, and completely positive semidefinite rank. Linear and Multilinear Algebra (2018). \n                    https:\/\/doi.org\/10.1080\/03081087.2018.1529136\n                    \n                  .","DOI":"10.1080\/03081087.2018.1529136"},{"key":"9410_CR64","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1512\/iumj.1993.42.42045","volume":"42","author":"M Putinar","year":"1993","unstructured":"Putinar, M.: Positive polynomials on compact semi-algebraic sets. Indiana University Mathematics Journal 42, 969\u2013984 (1993)","journal-title":"Indiana University Mathematics Journal"},{"issue":"3","key":"9410_CR65","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","volume":"13","author":"J Renegar","year":"1992","unstructured":"J. Renegar. On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals. Journal of Symbolic Computation 13(3) (1992), 255 \u2013 299.","journal-title":"Journal of Symbolic Computation"},{"key":"9410_CR66","doi-asserted-by":"crossref","unstructured":"T. Rothvoss. The matching polytope has exponential extension complexity. In Proceedings of the Forty-sixth Annual ACM Symposium on Theory of Computing, STOC\u201914, 2014, pp. 263\u2013272.","DOI":"10.1145\/2591796.2591834"},{"key":"9410_CR67","volume-title":"Real and complex analysis. Mathematics series","author":"W Rudin","year":"1987","unstructured":"W.\u00a0Rudin. Real and complex analysis. Mathematics series. McGraw-Hill, 1987."},{"issue":"2","key":"9410_CR68","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1080\/03081087.2013.869591","volume":"63","author":"N Shaked-Monderer","year":"2015","unstructured":"N. Shaked-Monderer, A. Berman, I.M. Bomze, F. Jarre, W. Schachinger. New results on the cp-rank and related properties of co(mpletely )positive matrices. Linear and Multilinear Algebra 63(2) (2015), 384\u2013396.","journal-title":"Linear and Multilinear Algebra"},{"issue":"2","key":"9410_CR69","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1137\/120885759","volume":"34","author":"N Shaked-Monderer","year":"2013","unstructured":"N. Shaked-Monderer, I.M. Bomze, F. Jarre, W. Schachinger. On the cp-rank and minimal cp factorizations of a completely positive matrix. SIAM Journal on Matrix Analysis and Applications 34(2) (2013), 355\u2013368.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"9410_CR70","unstructured":"Y. Shitov. A universality theorem for nonnegative matrix factorizations. \n                    arXiv:1606.09068v2\n                    \n                   (2016)."},{"issue":"3","key":"9410_CR71","doi-asserted-by":"publisher","first-page":"1898","DOI":"10.1137\/16M1080616","volume":"27","author":"Y Shitov","year":"2017","unstructured":"Y. Shitov. The complexity of positive semidefinite matrix factorization. SIAM Journal on Optimization 27(3) (2017), 1898\u20131909.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"9410_CR72","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10107-016-1049-8","volume":"162","author":"J Sikora","year":"2017","unstructured":"J. Sikora, A. Varvitsiotis. Linear conic formulations for two-party correlations and values of nonlocal games. Mathematical Programming 162(1) (2017), 431\u2013463.","journal-title":"Mathematical Programming"},{"key":"9410_CR73","unstructured":"W. Slofstra. The set of quantum correlations is not closed. \n                    arXiv:1703.08618\n                    \n                   (2017)."},{"key":"9410_CR74","unstructured":"G. Tang, P. Shah. Guaranteed tensor decomposition: A moment approach. In Proceedings of the 32nd International Conference on International Conference on Machine Learning, ICML\u201915, 2015, pp. 1491\u20131500."},{"issue":"1","key":"9410_CR75","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10589-018-9998-x","volume":"71","author":"A Vandaele","year":"2018","unstructured":"A. Vandaele, F. Glineur, N. Gillis. Algorithms for positive semidefinite factorization. Computational Optimization and Applications 71(1) (2018), 193\u2013219.","journal-title":"Computational Optimization and Applications"},{"issue":"3","key":"9410_CR76","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/070709967","volume":"20","author":"SA Vavasis","year":"2009","unstructured":"S.A. Vavasis. On the complexity of nonnegative matrix factorization. SIAM Journal on Optimization 20(3) (2009), 1364\u20131377.","journal-title":"SIAM Journal on Optimization"},{"key":"9410_CR77","volume-title":"Lectures on Matrices","author":"J.H.M Wedderburn","year":"1964","unstructured":"J.H.M. Wedderburn. Lectures on Matrices. Dover Publications Inc., 1964."},{"issue":"3","key":"9410_CR78","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0022-0000(91)90024-Y","volume":"43","author":"M Yannakakis","year":"1991","unstructured":"M. Yannakakis. Expressing combinatorial optimization problems by linear programs. Journal of Computer and System Sciences 43(3) (1991), 441 \u2013 466.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-018-09410-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-018-09410-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-018-09410-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T19:11:47Z","timestamp":1580411507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-018-09410-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,31]]},"references-count":78,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["9410"],"URL":"https:\/\/doi.org\/10.1007\/s10208-018-09410-y","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,31]]},"assertion":[{"value":"4 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}