{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:49:50Z","timestamp":1763642990588,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T00:00:00Z","timestamp":1602806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T00:00:00Z","timestamp":1602806400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["DMS-1901950"],"award-info":[{"award-number":["DMS-1901950"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s10107-020-01578-y","type":"journal-article","created":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T15:03:02Z","timestamp":1602860582000},"page":"981-1004","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Sparse PSD approximation of the PSD cone"],"prefix":"10.1007","volume":"191","author":[{"given":"Grigoriy","family":"Blekherman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santanu S.","family":"Dey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Molinaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9881-2618","authenticated-orcid":false,"given":"Shengding","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,16]]},"reference":[{"key":"1578_CR1","doi-asserted-by":"crossref","unstructured":"Achlioptas, D.: Database-friendly random projections. In: Proceedings of the Twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS\u201901, New York, NY, USA, Association for Computing Machinery, pp.\u00a0274\u2013281 (2001)","DOI":"10.1145\/375551.375608"},{"key":"1578_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/18M118935X","volume":"3","author":"AA Ahmadi","year":"2019","unstructured":"Ahmadi, A.A., Majumdar, A.: Dsos and sdsos optimization: more tractable alternatives to sum of squares and semidefinite optimization. SIAM J. Appl. Algebra Geom. 3, 193\u2013230 (2019)","journal-title":"SIAM J. Appl. Algebra Geom."},{"key":"1578_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10107-012-0596-x","volume":"143","author":"E Amaldi","year":"2014","unstructured":"Amaldi, E., Coniglio, S., Gualandi, S.: Coordinated cutting plane generation via multi-objective separation. Math. Program. 143, 87\u2013110 (2014)","journal-title":"Math. Program."},{"key":"1578_CR4","unstructured":"Baltean-Lugojan, R., Bonami, P., Misener, R., Tramontani, A.: Selecting cutting planes for quadratic semidefinite outer-approximation via trained neural networks (2018)"},{"key":"1578_CR5","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1007\/s00041-013-9293-2","volume":"19","author":"AS Bandeira","year":"2013","unstructured":"Bandeira, A.S., Fickus, M., Mixon, D.G., Wong, P.: The road to deterministic matrices with the restricted isometry property. J. Fourier Anal. Appl. 19, 1123\u20131149 (2013)","journal-title":"J. Fourier Anal. Appl."},{"key":"1578_CR6","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00365-007-9003-x","volume":"28","author":"R Baraniuk","year":"2008","unstructured":"Baraniuk, R., Davenport, M., DeVore, R., Wakin, M.: A simple proof of the restricted isometry property for random matrices. Construct. Approx. 28, 253\u2013263 (2008)","journal-title":"Construct. Approx."},{"key":"1578_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1287\/opre.50.1.3.17780","volume":"50","author":"RE Bixby","year":"2002","unstructured":"Bixby, R.E.: Solving real-world linear programs: a decade and more of progress. Oper. Res. 50, 3\u201315 (2002)","journal-title":"Oper. Res."},{"key":"1578_CR8","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.laa.2005.03.029","volume":"405","author":"EG Boman","year":"2005","unstructured":"Boman, E.G., Chen, D., Parekh, O., Toledo, S.: On factor width and symmetric h-matrices. Linear Algebra Appl. 405, 239\u2013248 (2005)","journal-title":"Linear Algebra Appl."},{"key":"1578_CR9","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001","volume-title":"Concentration Inequalities: A Nonasymptotic Theory of Independence","author":"S Boucheron","year":"2013","unstructured":"Boucheron, S., Lugosi, G., Massart, P.: Concentration Inequalities: A Nonasymptotic Theory of Independence. OUP, Oxford (2013)"},{"key":"1578_CR10","doi-asserted-by":"publisher","first-page":"88","DOI":"10.4153\/CJM-1949-009-2","volume":"1","author":"RH Bruck","year":"1949","unstructured":"Bruck, R.H., Ryser, H.J.: The nonexistence of certain finite projective planes. Can. J. Math. 1, 88\u201393 (1949)","journal-title":"Can. J. Math."},{"key":"1578_CR11","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1109\/JSTSP.2010.2043161","volume":"4","author":"R Calderbank","year":"2010","unstructured":"Calderbank, R., Howard, S., Jafarpour, S.: Construction of a large class of deterministic sensing matrices that satisfy a statistical isometry property. IEEE J. Sel. Top. Signal Process. 4, 358\u2013374 (2010)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"1578_CR12","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"EJ Candes","year":"2006","unstructured":"Candes, E.J., Romberg, J.K., Tao, T.: Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Appl. Math. J. Iss. Courant Inst. Math. Sci. 59, 1207\u20131223 (2006)","journal-title":"Commun. Pure Appl. Math. J. Iss. Courant Inst. Math. Sci."},{"key":"1578_CR13","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Candes","year":"2005","unstructured":"Candes, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51, 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1578_CR14","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.crma.2008.03.014","volume":"346","author":"EJ Cand\u00c8s","year":"2008","unstructured":"Cand\u00c8s, E.J.: The restricted isometry property and its implications for compressed sensing. C. R. Math. 346, 589\u2013592 (2008)","journal-title":"C. R. Math."},{"key":"1578_CR15","doi-asserted-by":"publisher","first-page":"035020","DOI":"10.1088\/0266-5611\/24\/3\/035020","volume":"24","author":"R Chartrand","year":"2008","unstructured":"Chartrand, R., Staneva, V.: Restricted isometry properties and nonconvex compressive sensing. Inverse Prob. 24, 035020 (2008)","journal-title":"Inverse Prob."},{"key":"1578_CR16","doi-asserted-by":"publisher","first-page":"93","DOI":"10.4153\/CJM-1950-009-8","volume":"2","author":"S Chowla","year":"1950","unstructured":"Chowla, S., Ryser, H.J.: Combinatorial problems. Can. J. Math. 2, 93\u201399 (1950)","journal-title":"Can. J. Math."},{"key":"1578_CR17","unstructured":"Coleman, T.F., Li, Y., et\u00a0al.: Large-Scale Numerical Optimization, vol.\u00a046, Siam (1990)"},{"key":"1578_CR18","unstructured":"Dey, S.S., Kazachkov, A., Lodi, A., Munoz, G.: Sparse cutting planes for quadratically-constrained quadratic programs (2019)"},{"key":"1578_CR19","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10107-018-1302-4","volume":"170","author":"SS Dey","year":"2018","unstructured":"Dey, S.S., Molinaro, M.: Theoretical challenges towards cutting-plane selection. Math. Program. 170, 237\u2013266 (2018)","journal-title":"Math. Program."},{"key":"1578_CR20","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10107-015-0925-y","volume":"154","author":"SS Dey","year":"2015","unstructured":"Dey, S.S., Molinaro, M., Wang, Q.: Approximating polyhedra with sparse inequalities. Math. Program. 154, 329\u2013352 (2015)","journal-title":"Math. Program."},{"key":"1578_CR21","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1287\/moor.2017.0866","volume":"43","author":"SS Dey","year":"2017","unstructured":"Dey, S.S., Molinaro, M., Wang, Q.: Analysis of sparse cutting planes for sparse milps with applications to stochastic milps. Math. Oper. Res. 43, 304\u2013332 (2017)","journal-title":"Math. Oper. Res."},{"key":"1578_CR22","unstructured":"Hojny, C., L\u00fcthen, H., Pfetsch, M.\u00a0E.: On the size of integer programs with bounded coefficients or sparse constraints. Technical Report, Technical report, Optimization Online (2017)"},{"key":"1578_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"R Horn","year":"1985","unstructured":"Horn, R., Johnson, C.: Matrix Analysis. Cambridge University Press, Cambridge (1985)"},{"key":"1578_CR24","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1111\/j.1467-9574.1980.tb00681.x","volume":"34","author":"R Kaas","year":"1980","unstructured":"Kaas, R., Buhrman, J.M.: Mean, median and mode in binomial distributions. Stat. Neerl. 34, 13\u201318 (1980)","journal-title":"Stat. Neerl."},{"key":"1578_CR25","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-010-0402-6","volume":"129","author":"S Kim","year":"2011","unstructured":"Kim, S., Kojima, M., Mevissen, M., Yamashita, M.: Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion. Math. Program. 129, 33\u201368 (2011)","journal-title":"Math. Program."},{"key":"1578_CR26","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1287\/opre.2016.1489","volume":"64","author":"B Kocuk","year":"2016","unstructured":"Kocuk, B., Dey, S.S., Sun, X.A.: Strong socp relaxations for the optimal power flow problem. Oper. Res. 64, 1177\u20131196 (2016)","journal-title":"Oper. Res."},{"key":"1578_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-017-1169-9","volume":"171","author":"F Permenter","year":"2018","unstructured":"Permenter, F., Parrilo, P.: Partial facial reduction: simplified, equivalent sdps via approximations of the psd cone. Math. Program. 171, 1\u201354 (2018)","journal-title":"Math. Program."},{"key":"1578_CR28","doi-asserted-by":"crossref","unstructured":"Qualizza, A., Belotti, P., Margot, F.: Linear programming relaxations of quadratically constrained quadratic programs. In: Mixed Integer Nonlinear Programming, Springer, pp.\u00a0407\u2013426 (2012)","DOI":"10.1007\/978-1-4614-1927-3_14"},{"key":"1578_CR29","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01585094","volume":"24","author":"JK Reid","year":"1982","unstructured":"Reid, J.K.: A sparsity-exploiting variant of the bartels-golub decomposition for linear programming bases. Math. Program. 24, 55\u201369 (1982)","journal-title":"Math. Program."},{"key":"1578_CR30","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1137\/130915261","volume":"24","author":"S Sojoudi","year":"2014","unstructured":"Sojoudi, S., Lavaei, J.: Exactness of semidefinite relaxations for nonlinear optimization problems with underlying graph structure. SIAM J. Optim. 24, 1746\u20131778 (2014)","journal-title":"SIAM J. Optim."},{"key":"1578_CR31","volume-title":"Combinatorial Designs","author":"DR Stinson","year":"2004","unstructured":"Stinson, D.R.: Combinatorial Designs. Springer, New York (2004)"},{"key":"1578_CR32","doi-asserted-by":"crossref","unstructured":"Walter, M.: Sparsity of lift-and-project cutting planes. In: Operations Research Proceedings, vol. 2014, Springer, pp. 9\u201314 (2012)","DOI":"10.1007\/978-3-319-00795-3_2"},{"key":"1578_CR33","unstructured":"Wang, Y., Tanaka, A., Yoshise, A.: Polyhedral approximations of the semidefinite cone and their applications. arXiv preprint arXiv:1905.00166 (2019)"},{"key":"1578_CR34","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0097-3165(75)90067-9","volume":"18","author":"RM Wilson","year":"1975","unstructured":"Wilson, R.M.: An existence theory for pairwise balanced designs: III\u2013proof of the existence conjectures. J. Combin. Theory Ser. A 18, 71\u201379 (1975)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1578_CR35","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L.: Handbook of Semidefinite Programming: Theory, Algorithms, and Applications, vol.\u00a027, Springer, Berlin (2012)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01578-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01578-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01578-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T16:06:34Z","timestamp":1645545994000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01578-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,16]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["1578"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01578-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2020,10,16]]},"assertion":[{"value":"7 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}