{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:39Z","timestamp":1740109299023,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T00:00:00Z","timestamp":1646438400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T00:00:00Z","timestamp":1646438400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1637598"],"award-info":[{"award-number":["CCF-1637598"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-20-1-0320"],"award-info":[{"award-number":["FA9550-20-1-0320"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2113724"],"award-info":[{"award-number":["DMS-2113724"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DE210101056"],"award-info":[{"award-number":["DE210101056"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present a generalization of the notion of neighborliness to non-polyhedral convex cones. Although a definition of neighborliness is available in the non-polyhedral case in the literature, it is fairly restrictive as it requires all the low-dimensional faces to be polyhedral. Our approach is more flexible and includes, for example, the cone of positive-semidefinite matrices as a special case (this cone is not neighborly in general). We term our generalization Terracini convexity due to its conceptual similarity with the conclusion of Terracini\u2019s lemma from algebraic geometry. Polyhedral cones are Terracini convex if and only if they are neighborly. More broadly, we derive many families of non-polyhedral Terracini convex cones based on neighborly cones, linear images of cones of positive-semidefinite matrices, and derivative relaxations of Terracini convex hyperbolicity cones. As a demonstration of the utility of our framework in the non-polyhedral case, we give a characterization based on Terracini convexity of the tightness of semidefinite relaxations for certain inverse problems.<\/jats:p>","DOI":"10.1007\/s10107-022-01774-y","type":"journal-article","created":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T10:02:25Z","timestamp":1646474545000},"page":"399-441","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Terracini convexity"],"prefix":"10.1007","volume":"198","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5456-0180","authenticated-orcid":false,"given":"James","family":"Saunderson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkat","family":"Chandrasekaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,5]]},"reference":[{"issue":"3","key":"1774_CR1","first-page":"224","volume":"3","author":"D Amelunxen","year":"2014","unstructured":"Amelunxen, D., Lotz, M., McCoy, M., Tropp, J.: Living on the edge: phase transitions in convex programs with random data. Inf. Inference J. IMA 3(3), 224\u2013294 (2014)","journal-title":"Inf. Inference J. IMA"},{"key":"1774_CR2","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.aim.2018.03.038","volume":"334","author":"N Amini","year":"2018","unstructured":"Amini, N., Br\u00e4nd\u00e9n, P.: Non-representable hyperbolic matroids. Adv. Math. 334, 417\u2013449 (2018)","journal-title":"Adv. Math."},{"issue":"1","key":"1774_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF02394570","volume":"124","author":"MF Atiyah","year":"1970","unstructured":"Atiyah, M.F., Bott, R., G\u00e5rding, L.: Lacunas for hyperbolic differential operators with constant coefficients I. Acta Math. 124(1), 109\u2013189 (1970)","journal-title":"Acta Math."},{"issue":"1","key":"1774_CR4","doi-asserted-by":"publisher","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."},{"unstructured":"Blekherman, G.: Dimensional differences between nonnegative polynomials and sums of squares (2009). arXiv preprint arXiv:0907.1339","key":"1774_CR5"},{"issue":"1","key":"1774_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1137\/16M1084560","volume":"1","author":"G Blekherman","year":"2017","unstructured":"Blekherman, G., Sinn, R., Velasco, M.: Do sums of squares dream of free resolutions? SIAM J. Appl. Algebra Geom. 1(1), 175\u2013199 (2017)","journal-title":"SIAM J. Appl. Algebra Geom."},{"issue":"4","key":"1774_CR7","doi-asserted-by":"publisher","first-page":"2342","DOI":"10.1109\/TIT.2011.2111771","volume":"57","author":"E Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E., Plan, Y.: Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements. IEEE Trans. Inf. Theory 57(4), 2342\u20132359 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1774_CR8","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s10208-012-9135-7","volume":"12","author":"V Chandrasekaran","year":"2012","unstructured":"Chandrasekaran, V., Recht, B., Parrilo, P.A., Willsky, A.S.: The convex geometry of linear inverse problems. Found. Comput. Math. 12(6), 805\u2013849 (2012)","journal-title":"Found. Comput. Math."},{"issue":"27","key":"1774_CR9","doi-asserted-by":"publisher","first-page":"9446","DOI":"10.1073\/pnas.0502269102","volume":"102","author":"DL Donoho","year":"2005","unstructured":"Donoho, D.L., Tanner, J.: Sparse nonnegative solution of underdetermined linear equations by linear programming. Proc. Natl. Acad. Sci. 102(27), 9446\u20139451 (2005)","journal-title":"Proc. Natl. Acad. Sci."},{"unstructured":"Fawzi, H., Gouveia, J., Parrilo, P.A., Saunderson, J., Thomas, R.R.: Lifting for simplicity: Concise descriptions of convex sets (2020). arXiv preprint arXiv:2002.09788","key":"1774_CR10"},{"key":"1774_CR11","first-page":"957","volume":"8","author":"L G\u00e5rding","year":"1959","unstructured":"G\u00e5rding, L.: An inequality for hyperbolic polynomials. J. Math. Mech. 8, 957\u2013965 (1959)","journal-title":"J. Math. Mech."},{"issue":"1317","key":"1774_CR12","first-page":"84","volume":"1986\u20131987","author":"Y Gordon","year":"1988","unstructured":"Gordon, Y.: On Milman\u2019s inequality and random subspaces which escape through a mesh in $$\\mathbb{R}^n$$. Geom. Asp. Funct. Anal. Isr. Semin. 1986\u20131987(1317), 84\u2013106 (1988)","journal-title":"Geom. Asp. Funct. Anal. Isr. Semin."},{"key":"1774_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0019-9","volume-title":"Convex Polytopes","author":"B Grunbaum","year":"2003","unstructured":"Grunbaum, B.: Convex Polytopes. Springer, Berlin (2003)"},{"issue":"3","key":"1774_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s00454-008-9065-y","volume":"40","author":"G Kalai","year":"2008","unstructured":"Kalai, G., Wigderson, A.: Neighborly embedded manifolds. Discrete Comput. Geom. 40(3), 319\u2013324 (2008)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"1774_CR15","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"1774_CR16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718812","volume-title":"A Mathematical View of Interior-Point Methods in Convex Optimization","author":"J Renegar","year":"2001","unstructured":"Renegar, J.: A Mathematical View of Interior-Point Methods in Convex Optimization. MOS-SIAM Series on Optimization, Lausanne (2001)"},{"issue":"1","key":"1774_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10208-004-0136-z","volume":"6","author":"J Renegar","year":"2006","unstructured":"Renegar, J.: Hyperbolic programs, and their derivative relaxations. Found. Comput. Math. 6(1), 59\u201379 (2006)","journal-title":"Found. Comput. Math."},{"key":"1774_CR18","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"2015","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (2015)"},{"key":"1774_CR19","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/BF03018812","volume":"31","author":"A Terracini","year":"1911","unstructured":"Terracini, A.: Sulle $$v_k$$ per cui la variet\u00e0 degli $${S}_h$$$$(h+1)$$-seganti ha dimensione minore dell\u2019ordinario. Rendiconti del Circolo Matematico di Palermo 31, 392\u2013396 (1911)","journal-title":"Rendiconti del Circolo Matematico di Palermo"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01774-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01774-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01774-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T22:20:35Z","timestamp":1677018035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01774-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,5]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1774"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01774-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2022,3,5]]},"assertion":[{"value":"19 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}