{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T17:40:30Z","timestamp":1781545230160,"version":"3.54.5"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T00:00:00Z","timestamp":1688774400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T00:00:00Z","timestamp":1688774400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100010665","name":"H2020 Marie Sklodowska-Curie Actions","doi-asserted-by":"publisher","award":["813211"],"award-info":[{"award-number":["813211"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"crossref","award":["20-11626Y"],"award-info":[{"award-number":["20-11626Y"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"crossref"}]},{"name":"ANITI PIA3","award":["ANR-19-PI3A-0004"],"award-info":[{"award-number":["ANR-19-PI3A-0004"]}]},{"name":"ANITI PIA3","award":["813211"],"award-info":[{"award-number":["813211"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We explore a new type of sparsity for the generalized moment problem (GMP) that we call <jats:italic>ideal-sparsity<\/jats:italic>. In this setting, one optimizes over a measure restricted to be supported on the variety of an ideal generated by quadratic bilinear monomials. We show that this restriction enables an equivalent sparse reformulation of the GMP, where the single (high dimensional) measure variable is replaced by several (lower dimensional) measure variables supported on the maximal cliques of the graph corresponding to the quadratic bilinear constraints. We explore the resulting hierarchies of moment-based relaxations for the original dense formulation of GMP and this new, equivalent ideal-sparse reformulation, when applied to the problem of bounding nonnegative- and completely positive matrix factorization ranks. We show that the ideal-sparse hierarchies provide bounds that are at least as good (and often tighter) as those obtained from the dense hierarchy. This is in sharp contrast to the situation when exploiting correlative sparsity, as is most common in the literature, where the resulting bounds are weaker than the dense bounds. Moreover, while correlative sparsity requires the underlying graph to be chordal, no such assumption is needed for ideal-sparsity. Numerical results show that the ideal-sparse bounds are often tighter and much faster to compute than their dense analogs.<\/jats:p>","DOI":"10.1007\/s10107-023-01993-x","type":"journal-article","created":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T16:01:37Z","timestamp":1688832097000},"page":"703-744","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks"],"prefix":"10.1007","volume":"205","author":[{"given":"Milan","family":"Korda","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8474-2121","authenticated-orcid":false,"given":"Monique","family":"Laurent","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Victor","family":"Magron","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andries","family":"Steenkamp","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,7,8]]},"reference":[{"key":"1993_CR1","doi-asserted-by":"crossref","unstructured":"Abdalmoaty, M.R., Henrion, D., Rodrigues. L.: Measures and LMIs for optimal control of piecewise-affine systems. In: 2013 European Control Conference (ECC), pp. 3173\u20133178. IEEE (2013)","DOI":"10.23919\/ECC.2013.6669627"},{"key":"1993_CR2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0024-3795(88)90240-6","volume":"107","author":"J Agler","year":"1988","unstructured":"Agler, J., Helton, W., McCullough, S.A., Rodman, L.: Positive semidefinite matrices with a given sparsity pattern. Linear Algebra Appl. 107, 101\u2013149 (1988)","journal-title":"Linear Algebra Appl."},{"key":"1993_CR3","doi-asserted-by":"crossref","unstructured":"Andersen, E.D., Andersen, K.D.: The Mosek interior point optimizer for linear programming: an implementation of the homogeneous algorithm. In: High Performance Optimization, vol.\u00a033, pp. 197\u2013232. Springer (2000)","DOI":"10.1007\/978-1-4757-3216-0_8"},{"issue":"2","key":"1993_CR4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a $$k$$-tree. SIAM J. Algebraic Discrete Methods 8(2), 277\u2013284 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"1993_CR5","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/18M1201342","volume":"3","author":"G Averkov","year":"2019","unstructured":"Averkov, G.: Optimal size of linear matrix inequalities in semidefinite approaches to polynomial optimization. SIAM J. Appl. Algebra Geom. 3(1), 128\u2013151 (2019)","journal-title":"SIAM J. Appl. Algebra Geom."},{"issue":"1","key":"1993_CR6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0024-3795(97)10070-2","volume":"277","author":"F Barioli","year":"1998","unstructured":"Barioli, F.: Completely positive matrices with a book-graph. Linear Algebra Appl. 277(1), 11\u201331 (1998)","journal-title":"Linear Algebra Appl."},{"key":"1993_CR7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0024-3795(02)00250-1","volume":"363","author":"F Barioli","year":"2003","unstructured":"Barioli, F., Berman, A.: The maximal cp-rank of rank $$k$$ completely positive matrices. Linear Algebra Appl. 363, 17\u201333 (2003)","journal-title":"Linear Algebra Appl."},{"key":"1993_CR8","doi-asserted-by":"crossref","first-page":"2330","DOI":"10.1016\/j.laa.2009.02.034","volume":"431","author":"LB Beasley","year":"2009","unstructured":"Beasley, L.B., Laffey, T.J.: Real rank versus nonnegative rank. Linear Algebra Appl. 431, 2330\u20132335 (2009)","journal-title":"Linear Algebra Appl."},{"key":"1993_CR9","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: a fresh approach to numerical computing. SIAM Rev. 59, 65\u201398 (2017)","journal-title":"SIAM Rev."},{"issue":"3","key":"1993_CR10","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.ic.2009.03.008","volume":"208","author":"HL Bodlaender","year":"2010","unstructured":"Bodlaender, H.L., Koster, A.M.: Treewidth computations I: upper bounds. Inf. Comput. 208(3), 259\u2013275 (2010)","journal-title":"Inf. Comput."},{"key":"1993_CR11","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.laa.2014.06.025","volume":"459","author":"IM Bomze","year":"2014","unstructured":"Bomze, I.M., Schachinger, W., Ullrich, R.: From seven to eleven: completely positive matrices with high cp-rank. Linear Algebra Appl. 459, 208\u2013221 (2014)","journal-title":"Linear Algebra Appl."},{"key":"1993_CR12","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1137\/140973207","volume":"36","author":"IM Bomze","year":"2015","unstructured":"Bomze, I.M., Schachinger, W., Ullrich, R.: New lower bounds and asymptotics for the cp-rank. SIAM J. Matrix Anal. Appl. 36, 20\u201337 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"1993_CR13","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1287\/moor.2014.0694","volume":"40","author":"G Braun","year":"2015","unstructured":"Braun, G., Fiorini, S., Pokutta, S., Steurer, D.: Approximation limits of linear programs (beyond hierarchies). Math. Oper. Res. 40(3), 756\u2013772 (2015)","journal-title":"Math. Oper. Res."},{"key":"1993_CR14","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16, 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"issue":"2","key":"1993_CR15","doi-asserted-by":"crossref","first-page":"1147","DOI":"10.1137\/140988978","volume":"26","author":"V Chandrasekaran","year":"2016","unstructured":"Chandrasekaran, V., Shah, P.: Relative entropy relaxations for signomial optimization. SIAM J. Optim. 26(2), 1147\u20131173 (2016)","journal-title":"SIAM J. Optim."},{"key":"1993_CR16","unstructured":"Chen, T., Lasserre, J.B., Magron, V., Pauwels. E.: Semialgebraic optimization for bounding Lipschitz constants of ReLU networks. In: 34th Conference on Neural Information Processing Systems (NeurIPS 2020) (2020)"},{"key":"1993_CR17","unstructured":"Chen, T., Lasserre, J.-B., Magron, V., Pauwels, E.: Semialgebraic representation of monotone deep Equilibrium models and applications to certification. In: 35th Conference on Neural Information Processing Systems (NeurIPS 2021) (2021)"},{"key":"1993_CR18","doi-asserted-by":"crossref","unstructured":"Cottle, R.W., Pang, J.-S., Stone, R.E.: The Linear Complementarity Problem. SIAM (2009)","DOI":"10.1137\/1.9780898719000"},{"key":"1993_CR19","doi-asserted-by":"crossref","unstructured":"Curto, R.E., Fialkow, L.A.: Solution of the truncated complex moment problem for flat data. Mem. Am. Math. Soc., 119(568) (1996)","DOI":"10.1090\/memo\/0568"},{"key":"1993_CR20","doi-asserted-by":"crossref","first-page":"2825","DOI":"10.1090\/S0002-9947-00-02472-7","volume":"352","author":"RE Curto","year":"2000","unstructured":"Curto, R.E., Fialkow, L.A.: The truncated complex moment problem. Trans. Am. Math. Soc. 352, 2825\u20132855 (2000)","journal-title":"Trans. Am. Math. Soc."},{"key":"1993_CR21","doi-asserted-by":"crossref","unstructured":"de Klerk, E., Laurent, M.: A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis. In: World Women in Mathematics 2018, Araujo C., Benkart G., Praeger C., Tanbay B. (eds). Association for Women in Mathematics Series, Springer, Cham, vol.\u00a020, pp. 17\u201356 (2019)","DOI":"10.1007\/978-3-030-21170-7_1"},{"key":"1993_CR22","unstructured":"de\u00a0Caen, D., Gregory, D.A., Pullman, N.J.: The boolean rank of zero-one matrices. In: Proceedings of the Third Caribbean Conference on Combinatorics and Computing, Barbados, pp. 169\u2013173 (1981)"},{"issue":"3","key":"1993_CR23","doi-asserted-by":"crossref","first-page":"1944","DOI":"10.1137\/15M103114X","volume":"26","author":"E de Klerk","year":"2016","unstructured":"de Klerk, E., Vallentin, F.: On the Turing model complexity of interior point methods for semidefinite programming. SIAM J. Optim. 26(3), 1944\u20131961 (2016)","journal-title":"SIAM J. Optim."},{"key":"1993_CR24","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10589-013-9594-z","volume":"57","author":"PJC Dickinson","year":"2014","unstructured":"Dickinson, P.J.C., Gijben, L.: On the computational complexity of membership problems for the completely positive cone and its dual. Comput. Optim. Appl. 57, 403\u2013415 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"1993_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory. Springer, Berlin, Heidelberg (2017)"},{"issue":"4","key":"1993_CR26","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1080\/03081089408818334","volume":"37","author":"JH Drew","year":"1994","unstructured":"Drew, J.H., Johnson, C.R., Loewy, R.: Completely positive matrices associated with M-matrices. Linear Multilinear Algebra 37(4), 303\u2013310 (1994)","journal-title":"Linear Multilinear Algebra"},{"issue":"2","key":"1993_CR27","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., Lubin, M.: JuMP: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017)","journal-title":"SIAM Rev."},{"key":"1993_CR28","doi-asserted-by":"crossref","first-page":"106","DOI":"10.4153\/CJM-1966-014-3","volume":"18","author":"P Erd\u00f6s","year":"1966","unstructured":"Erd\u00f6s, P., Goodman, A.W., P\u00f3sa, L.: The representation of a graph by set intersections. Can. J. Math. 18, 106\u2013112 (1966)","journal-title":"Can. J. Math."},{"key":"1993_CR29","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s10107-015-0937-7","volume":"158","author":"H Fawzi","year":"2016","unstructured":"Fawzi, H., Parrilo, P.A.: Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank. Math. Program. 158, 417\u2013465 (2016)","journal-title":"Math. Program."},{"key":"1993_CR30","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Company, Publishers, San Francisco (1978)"},{"issue":"2","key":"1993_CR31","doi-asserted-by":"crossref","first-page":"7355","DOI":"10.1016\/j.ifacol.2020.12.1255","volume":"53","author":"M Garstka","year":"2020","unstructured":"Garstka, M., Cannon, M., Goulart, P.: A clique graph based merging strategy for decomposable SDPs. IFAC-PapersOnLine 53(2), 7355\u20137361 (2020)","journal-title":"IFAC-PapersOnLine"},{"key":"1993_CR32","doi-asserted-by":"crossref","first-page":"2685","DOI":"10.1016\/j.laa.2012.06.038","volume":"437","author":"N Gillis","year":"2012","unstructured":"Gillis, N., Glineur, F.: On the geometric interpretation of the nonnegative rank. Linear Algebra Appl. 437, 2685\u20132712 (2012)","journal-title":"Linear Algebra Appl."},{"issue":"5","key":"1993_CR33","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1007\/s10208-018-09410-y","volume":"19","author":"S Gribling","year":"2019","unstructured":"Gribling, S., de Laat, D., Laurent, M.: Lower bounds on matrix factorization ranks via noncommutative polynomial optimization. Found. Comput. Math. 19(5), 1013\u20131070 (2019)","journal-title":"Found. Comput. Math."},{"key":"1993_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.laa.2022.04.010","volume":"648","author":"S Gribling","year":"2022","unstructured":"Gribling, S., Laurent, M., Steenkamp, A.: Bounding the separable rank via polynomial optimization. Linear Algebra Appl. 648, 1\u201355 (2022)","journal-title":"Linear Algebra Appl."},{"key":"1993_CR35","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s00013-007-2234-z","volume":"89","author":"D Grimm","year":"2007","unstructured":"Grimm, D., Netzer, T., Schweighofer, M.: A note on the representation of positive polynomials with structured sparsity. Arch. Math. 89, 399\u2013403 (2007)","journal-title":"Arch. Math."},{"key":"1993_CR36","doi-asserted-by":"crossref","unstructured":"Henrion, D., Korda, M., Lasserre, J.B.: The Moment-SOS Hierarchy, volume\u00a04. World Scientific (2020)","DOI":"10.1142\/q0252"},{"key":"1993_CR37","doi-asserted-by":"crossref","unstructured":"Henrion, D., Lasserre, J.-B.: Detecting global optimality and extracting solutions in GloptiPoly. In: Positive Polynomials in Control, D. Henrion and A. Garulli (eds.), Lecture Notes on Control and Information Sciences, 312:293\u2013310, Springer, Berlin (2005)","DOI":"10.1007\/10997703_15"},{"issue":"1","key":"1993_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s40687-016-0052-2","volume":"3","author":"S Iliman","year":"2016","unstructured":"Iliman, S., De Wolff, T.: Amoebas, nonnegative polynomials and sums of squares supported on circuits. Res. Math. Sci. 3(1), 1\u201335 (2016)","journal-title":"Res. Math. Sci."},{"issue":"2","key":"1993_CR39","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1137\/15M1034386","volume":"28","author":"C Josz","year":"2018","unstructured":"Josz, C., Molzahn, D.K.: Lasserre hierarchy for large scale polynomial optimization in real and complex variables. SIAM J. Optim. 28(2), 1017\u20131048 (2018)","journal-title":"SIAM J. Optim."},{"key":"1993_CR40","first-page":"1","volume":"193","author":"I Klep","year":"2021","unstructured":"Klep, I., Magron, V., Povh, J.: Sparse noncommutative polynomial optimization. Math. Program. 193, 1\u201341 (2021)","journal-title":"Math. Program."},{"key":"1993_CR41","doi-asserted-by":"crossref","first-page":"3265","DOI":"10.1109\/LCSYS.2022.3181806","volume":"6","author":"M Korda","year":"2022","unstructured":"Korda, M.: Stability and performance verification of dynamical systems controlled by neural networks: algorithms and complexity. IEEE Control Syst. Lett. 6, 3265\u20133270 (2022)","journal-title":"IEEE Control Syst. Lett."},{"key":"1993_CR42","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.automatica.2016.12.008","volume":"78","author":"M Korda","year":"2017","unstructured":"Korda, M., Jones, C.N.: Stability and performance verification of optimization-based controllers. Automatica 78, 34\u201345 (2017)","journal-title":"Automatica"},{"key":"1993_CR43","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1993_CR44","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1137\/05064504X","volume":"17","author":"JB Lasserre","year":"2006","unstructured":"Lasserre, J.B.: Convergent SDP-relaxations in polynomial optimization with sparsity. SIAM J. Optim. 17(3), 822\u2013843 (2006)","journal-title":"SIAM J. Optim."},{"key":"1993_CR45","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10107-006-0085-1","volume":"112","author":"JB Lasserre","year":"2008","unstructured":"Lasserre, J.B.: A semidefinite programming approach to the generalized problem of moments. Math. Program. 112, 65\u201392 (2008)","journal-title":"Math. Program."},{"key":"1993_CR46","doi-asserted-by":"crossref","unstructured":"Lasserre, J.B.: Moments. Imperial College Press, Positive Polynomials and Their Applications (2009)","DOI":"10.1142\/p665"},{"key":"1993_CR47","doi-asserted-by":"crossref","unstructured":"Lasserre, J.B.: An Introduction to Polynomial and Semi-Algebraic Optimization, Cambridge University Press (2015)","DOI":"10.1017\/CBO9781107447226"},{"issue":"4","key":"1993_CR48","doi-asserted-by":"crossref","first-page":"1477","DOI":"10.1287\/moor.2018.0980","volume":"44","author":"JB Lasserre","year":"2019","unstructured":"Lasserre, J.B., Emin, Y.: Semidefinite relaxations for Lebesgue and Gaussian measures of unions of basic semialgebraic sets. Math. Oper. Res. 44(4), 1477\u20131493 (2019)","journal-title":"Math. Oper. Res."},{"key":"1993_CR49","doi-asserted-by":"crossref","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Emerging Applications of Algebraic Geometry, vol. 149 of IMA Volumes in Mathematics and its Applications, M. Putinar and S. Sullivant (eds.), Springer, pp. 157\u2013270 (2009)","DOI":"10.1007\/978-0-387-09686-5_7"},{"issue":"12","key":"1993_CR50","first-page":"6745","volume":"24","author":"V Magron","year":"2019","unstructured":"Magron, V., Forets, M., Henrion, D.: Semidefinite approximations of invariant measures for polynomial systems. Discrete Contin. Dyn. Syst. B 24(12), 6745\u20136770 (2019)","journal-title":"Discrete Contin. Dyn. Syst. B"},{"key":"1993_CR51","doi-asserted-by":"crossref","unstructured":"Magron, V., Wang, J.: Sparse Polynomial Optimization: Theory and Practice. World Scientific Press, Series on Optimization and Its Applications (2023)","DOI":"10.1142\/q0382"},{"issue":"4","key":"1993_CR52","doi-asserted-by":"crossref","first-page":"3987","DOI":"10.1109\/TPWRS.2013.2258044","volume":"28","author":"DK Molzahn","year":"2013","unstructured":"Molzahn, D.K., Holzer, J.T., Lesieutre, B.C., DeMarco, C.L.: Implementation of a large-scale optimal power flow solver based on semidefinite programming. IEEE Trans. Power Syst. 28(4), 3987\u20133998 (2013)","journal-title":"IEEE Trans. Power Syst."},{"issue":"6","key":"1993_CR53","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1007\/s10208-014-9225-9","volume":"14","author":"J Nie","year":"2014","unstructured":"Nie, J.: The $$\\cal{A} $$-truncated $$K$$-moment problem. Found. Comput. Math. 14(6), 1243\u20131276 (2014)","journal-title":"Found. Comput. Math."},{"issue":"1","key":"1993_CR54","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1137\/16M1083384","volume":"1","author":"J Nie","year":"2017","unstructured":"Nie, J.: Symmetric tensor nuclear norms. SIAM J. Appl. Algebra Geom. 1(1), 599\u2013625 (2017)","journal-title":"SIAM J. Appl. Algebra Geom."},{"issue":"2","key":"1993_CR55","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1215\/S0012-7094-78-04519-2","volume":"45","author":"B Reznick","year":"1978","unstructured":"Reznick, B.: Extremal PSD forms with few terms. Duke Math. J. 45(2), 363\u2013374 (1978)","journal-title":"Duke Math. J."},{"issue":"1","key":"1993_CR56","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1287\/moor.1120.0558","volume":"38","author":"C Riener","year":"2013","unstructured":"Riener, C., Theobald, T., Andr\u00e9n, L.J., Lasserre, J.B.: Exploiting symmetries in SDP-relaxations for polynomial optimization. Math. Oper. Res. 38(1), 122\u2013141 (2013)","journal-title":"Math. Oper. Res."},{"key":"1993_CR57","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0024-3795(93)90341-K","volume":"178","author":"L Salce","year":"1993","unstructured":"Salce, L., Zanardo, P.: Completely positive matrices and positivity of least squares solutions. Linear Algebra Appl. 178, 201\u2013216 (1993)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"1993_CR58","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1137\/120885759","volume":"34","author":"N Shaked-Monderer","year":"2013","unstructured":"Shaked-Monderer, N., Bomze, I.M., Jarre, F., Schachinger, W.: On the cp-rank and minimal cp factorizations of a completely positive matrix. SIAM J. Matrix Anal. Appl. 34(2), 355\u2013368 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1993_CR59","doi-asserted-by":"crossref","unstructured":"Sliwak, J., Andersen, E.D., Anjos, M.F., L\u00e9tocart, L., Traversi, E.: A clique merging algorithm to solve semidefinite relaxations of optimal power flow problems. IEEE Trans. Power Syst. 36(2), 1641\u20131644 (2021)","DOI":"10.1109\/TPWRS.2020.3044501"},{"key":"1993_CR60","unstructured":"Sliwak, J., Anjos, M.F., L\u00e9tocart, L., Traversi, E.: A semidefinite optimization-based branch-and-bound algorithm for several reactive optimal power flow problems. arXiv:2103.13648 (2021)"},{"key":"1993_CR61","unstructured":"Tang, G., Shah, P.: Guaranteed tensor decomposition: A moment approach. In: Bach, F., Blei, D., (eds). Proceedings of the 32nd International Conference on Machine Learning, volume\u00a037 of Proceedings of Machine Learning Research, PMLR 37:1491\u20131500 (2015)"},{"issue":"3","key":"1993_CR62","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/070709967","volume":"20","author":"SA Vavasis","year":"2010","unstructured":"Vavasis, S.A.: On the complexity of nonnegative matrix factorization. SIAM J. Optim. 20(3), 1364\u20131377 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1993_CR63","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/050623802","volume":"17","author":"H Waki","year":"2006","unstructured":"Waki, H., Kim, S., Kojima, M., Muramatsu, M.: Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity. SIAM J. Optim. 17(1), 218\u2013242 (2006)","journal-title":"SIAM J. Optim."},{"key":"1993_CR64","doi-asserted-by":"crossref","unstructured":"Wang, J., Magron, V.: A second order cone characterization for sums of nonnegative circuits. In: International Symposium on Symbolic and Algebraic Computation (ISSAC \u201920), July 20\u201323, 2020, Kalamata, Greece, pp. 450\u2013457. ACM, New York, NY, USA","DOI":"10.1145\/3373207.3404033"},{"issue":"1","key":"1993_CR65","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1137\/20M1323564","volume":"31","author":"J Wang","year":"2021","unstructured":"Wang, J., Magron, V., Lasserre, J.B.: Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension. SIAM J. Optim. 31(1), 114\u2013141 (2021)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1993_CR66","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/19M1307871","volume":"31","author":"J Wang","year":"2021","unstructured":"Wang, J., Magron, V., Lasserre, J.B.: TSSOS: a moment-SOS hierarchy that exploits term sparsity. SIAM J. Optim. 31(1), 30\u201358 (2021)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1993_CR67","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3569709","volume":"48","author":"J Wang","year":"2022","unstructured":"Wang, J., Magron, V., Lasserre, J.B., Mai, N.H.A.: CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization. ACM Trans. Math. Softw. 48(4), 1\u201326 (2022)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"1993_CR68","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0024-3795(97)00278-4","volume":"271","author":"S Xiang","year":"1998","unstructured":"Xiang, S., Xiang, S.: Notes on completely positive matrices. Linear Algebra Appl. 271(1), 273\u2013282 (1998)","journal-title":"Linear Algebra Appl."},{"key":"1993_CR69","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-021-01728-w","volume":"197","author":"Y Zheng","year":"2023","unstructured":"Zheng, Y., Fantuzzi, G.: Sum-of-squares chordal decomposition of polynomial matrix inequalities. Math. Program. 197, 71\u2013108 (2023)","journal-title":"Math. Program."},{"key":"1993_CR70","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.arcontrol.2021.09.001","volume":"52","author":"Y Zheng","year":"2021","unstructured":"Zheng, Y., Fantuzzi, G., Papachristodoulou, A.: Chordal and factor-width decompositions for scalable semidefinite and polynomial optimization. Annu. Rev. Control. 52, 243\u2013279 (2021)","journal-title":"Annu. Rev. Control."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01993-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-01993-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01993-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T14:16:29Z","timestamp":1712412989000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-01993-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,8]]},"references-count":70,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1993"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-01993-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,8]]},"assertion":[{"value":"26 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}