{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:57:20Z","timestamp":1775069840161,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T00:00:00Z","timestamp":1637884800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T00:00:00Z","timestamp":1637884800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-18-ERC2-0004-01"],"award-info":[{"award-number":["ANR-18-ERC2-0004-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-19-PI3A-0004"],"award-info":[{"award-number":["ANR-19-PI3A-0004"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10957-021-01975-z","type":"journal-article","created":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T06:24:52Z","timestamp":1637907892000},"page":"335-359","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Exploiting Sparsity in Complex Polynomial Optimization"],"prefix":"10.1007","volume":"192","author":[{"given":"Jie","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1147-3738","authenticated-orcid":false,"given":"Victor","family":"Magron","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,26]]},"reference":[{"key":"1975_CR1","doi-asserted-by":"publisher","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., Rodman, L.: Positive semidefinite matrices with a given sparsity pattern. Linear Algebra Appl. 107, 101\u2013149 (1988)","journal-title":"Linear Algebra Appl."},{"key":"1975_CR2","doi-asserted-by":"crossref","unstructured":"Aittomaki, T., Koivunen, V.: Beampattern optimization by minimization of quartic polynomial. In: Piscataway, N.J. (ed.) 2009 IEEE\/SP 15th Workshop on Statistical Signal Processing, pp. 437\u2013440. IEEE (2009)","DOI":"10.1109\/SSP.2009.5278546"},{"issue":"22","key":"1975_CR3","doi-asserted-by":"publisher","first-page":"5603","DOI":"10.1109\/TSP.2013.2273885","volume":"61","author":"A Aubry","year":"2013","unstructured":"Aubry, A., De Maio, A., Jiang, B., Zhang, S.: Ambiguity function shaping for cognitive radar via complex quartic optimization. IEEE Trans. Signal Process. 61(22), 5603\u20135619 (2013)","journal-title":"IEEE Trans. Signal Process."},{"key":"1975_CR4","unstructured":"Babaeinejadsarookolaee, S., Birchfield, A., Christie, R.D., Coffrin, C., DeMarco, C., Diao, R., Ferris, M., Fliscounakis, S., Greene, S., Huang, R. et\u00a0al.: The power grid library for benchmarking AC optimal power flow algorithms. (2019). arXiv preprint arXiv:1908.02788"},{"issue":"3","key":"1975_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10288-020-00455-w","volume":"18","author":"D Bienstock","year":"2020","unstructured":"Bienstock, D., Escobar, M., Gentile, C., Liberti, L.: Mathematical programming formulations for the alternating current optimal power flow problem. 4OR 18(3), 249\u2013292 (2020)","journal-title":"4OR"},{"key":"1975_CR6","doi-asserted-by":"crossref","unstructured":"Blair, J.R., Peyton, B.: An introduction to chordal graphs and clique trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation. The IMA Volumes in Mathematics and its Applications, vol. 56, pp. 1\u201329. Springer, New York, NY (1996)","DOI":"10.1007\/978-1-4613-8369-7_1"},{"issue":"3","key":"1975_CR7","doi-asserted-by":"publisher","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":"1975_CR8","unstructured":"Bromberger, S., Fairbanks, J.: and other contributors. JuliaGraphs\/LightGraphs.jl: an optimized graphs package for the Julia programming language (2017)"},{"issue":"1","key":"1975_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s12532-015-0089-z","volume":"8","author":"F Bugarin","year":"2016","unstructured":"Bugarin, F., Henrion, D., Lasserre, J.B.: Minimizing the sum of many rational functions. Math. Program. Comput. 8(1), 83\u2013111 (2016)","journal-title":"Math. Program. Comput."},{"key":"1975_CR10","unstructured":"Chen, T., Lasserre, J.-B., Magron, V., Pauwels, E.: Semialgebraic optimization for bounding Lipschitz constants of Relu networks. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M.F., Lin, H. (eds.) Proceeding of Advances in Neural Information Processing Systems, vol. 33 (2020)"},{"issue":"2","key":"1975_CR11","doi-asserted-by":"publisher","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":"1975_CR12","doi-asserted-by":"crossref","unstructured":"D\u2019Angelo, J.P., Putinar, M.: Polynomial optimization on odd-dimensional spheres. In: Emerging Applications of Algebraic Geometry, pp. 1\u201315. Springer (2009)","DOI":"10.1007\/978-0-387-09686-5_1"},{"key":"1975_CR13","doi-asserted-by":"crossref","unstructured":"Fogel, F., Waldspurger, I., d\u2019Aspremont, A.: Phase retrieval for imaging problems. Math. Program. Comput. 8(3), 311\u2013335 (2016)","DOI":"10.1007\/s12532-016-0103-0"},{"key":"1975_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0024-3795(84)90207-6","volume":"58","author":"R Grone","year":"1984","unstructured":"Grone, R., Johnson, C.R., S\u00e1, E.M., Wolkowicz, H.: Positive definite completions of partial Hermitian matrices. Linear Algebra Appl. 58, 109\u2013124 (1984)","journal-title":"Linear Algebra Appl."},{"issue":"7","key":"1975_CR15","doi-asserted-by":"publisher","first-page":"072102","DOI":"10.1063\/1.3451264","volume":"51","author":"JJ Hilling","year":"2010","unstructured":"Hilling, J.J., Sudbery, A.: The geometric measure of multipartite entanglement and the singular values of a hypermatrix. J. Math. Phys. 51(7), 072102 (2010)","journal-title":"J. Math. Phys."},{"key":"1975_CR16","unstructured":"Josz, C., Molzahn, D.K.: Moment\/sum-of-squares hierarchy for complex polynomial optimization. (2015). arXiv preprint arXiv:1508.02068"},{"issue":"2","key":"1975_CR17","doi-asserted-by":"publisher","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":"1975_CR18","first-page":"1","volume":"2021","author":"I Klep","year":"2021","unstructured":"Klep, I., Magron, V., Povh, J.: Sparse noncommutative polynomial optimization. Math. Program. 2021, 1\u201341 (2021)","journal-title":"Math. Program."},{"issue":"3","key":"1975_CR19","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J-B Lasserre","year":"2001","unstructured":"Lasserre, J.-B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1975_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3206430","volume":"44","author":"V Magron","year":"2018","unstructured":"Magron, V.: Interval enclosures of upper bounds of roundoff errors using semidefinite programming. ACM Trans. Math. Softw. 44(4), 1\u201318 (2018)","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"1975_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3015465","volume":"43","author":"V Magron","year":"2017","unstructured":"Magron, V., Constantinides, G., Donaldson, A.: Certified roundoff error bounds using semidefinite programming. ACM Trans. Math. Softw. 43(4), 1\u201334 (2017)","journal-title":"ACM Trans. Math. Softw."},{"key":"1975_CR22","unstructured":"Magron, V., Wang, J.: TSSOS: a Julia library to exploit sparsity for large-scale polynomial optimization. In: The 16th Effective Methods in Algebraic Geometry Conference (2021). https:\/\/puremath.no\/Contributed%20MEGA\/papers\/MEGA_2021_paper_17.pdf"},{"issue":"3","key":"1975_CR23","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1109\/TSP.2002.808112","volume":"51","author":"B Mariere","year":"2003","unstructured":"Mariere, B., Luo, Z.-Q., Davidson, T.N.: Blind constant modulus equalization via convex optimization. IEEE Trans. Signal Process. 51(3), 805\u2013818 (2003)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"1975_CR24","doi-asserted-by":"publisher","first-page":"205","DOI":"10.4153\/CJM-2009-010-4","volume":"61","author":"M Marshall","year":"2009","unstructured":"Marshall, M.: Representations of non-negative polynomials, degree bounds and applications to optimization. Can. J. Math. 61(1), 205\u2013221 (2009)","journal-title":"Can. J. Math."},{"key":"1975_CR25","unstructured":"Mosek, A.: The MOSEK optimization Suite. Version 9.0 (2019)"},{"issue":"3","key":"1975_CR26","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/9.661609","volume":"43","author":"O Toker","year":"1998","unstructured":"Toker, O., Ozbay, H.: On the complexity of purely complex $$\\mu $$ computation and related problems in multidimensional systems. IEEE Trans. Autom. Control 43(3), 409\u2013414 (1998)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"4","key":"1975_CR27","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1561\/2400000006","volume":"1","author":"L Vandenberghe","year":"2015","unstructured":"Vandenberghe, L., Andersen, M..S., et al.: Chordal graphs and semidefinite optimization. Found. Trends\u00ae Optim. 1(4), 241\u2013433 (2015)","journal-title":"Found. Trends\u00ae Optim."},{"key":"1975_CR28","unstructured":"Vreman, N., Pazzaglia, P., Wang, J., Magron, V., Maggio, M.: Stability of control systems under extended weakly-hard constraints. (2021). arXiv preprint arXiv:2101.11312"},{"issue":"1","key":"1975_CR29","doi-asserted-by":"publisher","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 programming relaxations for polynomial optimization problems with structured sparsity. SIAM J. Optim. 17(1), 218\u2013242 (2006)","journal-title":"SIAM J. Optim."},{"key":"1975_CR30","unstructured":"Wang, J.: ChordalGraph: A Julia Package to Handle Chordal Graphs (2020). https:\/\/github.com\/wangjie212\/ChordalGraph"},{"key":"1975_CR31","doi-asserted-by":"crossref","unstructured":"Wang, J., Maggio, M., Magron, V.: SparseJSR: A fast algorithm to compute joint spectral radius via sparse SOS decompositions. In: 2021 American Control Conference (ACC), pp. 2254\u20132259. IEEE (2021)","DOI":"10.23919\/ACC50511.2021.9483347"},{"issue":"2","key":"1975_CR32","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10589-021-00301-7","volume":"80","author":"J Wang","year":"2021","unstructured":"Wang, J., Magron, V.: Exploiting term sparsity in noncommutative polynomial optimization. Comput. Optim. Appl. 80(2), 483\u2013521 (2021)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1975_CR33","doi-asserted-by":"publisher","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":"1975_CR34","doi-asserted-by":"publisher","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."},{"key":"1975_CR35","unstructured":"Wang, J., Magron, V., Lasserre, J.-B., Mai, N.H.A.: CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization. (2020). arXiv:2005.02828"},{"key":"1975_CR36","unstructured":"Zhou, Q., Marecek, J.: Proper learning of linear dynamical systems as a non-commutative polynomial optimisation problem (2020). arXiv:2002.01444"},{"key":"1975_CR37","unstructured":"Zhou, Q., Marecek, J., Shorten, R.N.: Fairness in forecasting and learning linear dynamical systems. (2020). arXiv:2006.07315"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01975-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-021-01975-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01975-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T12:34:04Z","timestamp":1642768444000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-021-01975-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,26]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1975"],"URL":"https:\/\/doi.org\/10.1007\/s10957-021-01975-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,26]]},"assertion":[{"value":"23 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}