{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T16:38:20Z","timestamp":1774715900052,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T00:00:00Z","timestamp":1616716800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T00:00:00Z","timestamp":1616716800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s10208-021-09508-w","type":"journal-article","created":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T21:02:36Z","timestamp":1616792556000},"page":"161-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Exploiting Sparsity for Semi-Algebraic Set Volume Computation"],"prefix":"10.1007","volume":"22","author":[{"given":"Matteo","family":"Tacchi","sequence":"first","affiliation":[]},{"given":"Tillmann","family":"Weisser","sequence":"additional","affiliation":[]},{"given":"Jean Bernard","family":"Lasserre","sequence":"additional","affiliation":[]},{"given":"Didier","family":"Henrion","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,26]]},"reference":[{"key":"9508_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0167-7152(99)00134-0","volume":"47","author":"C Belisle","year":"2000","unstructured":"C. Belisle, Slow hit-and-run sampling, Statist. Probab. Lett. 47 (2000), 33\u201343.","journal-title":"Statist. Probab. Lett."},{"key":"9508_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1287\/moor.18.2.255","volume":"18","author":"C Belisle","year":"1993","unstructured":"C. Belisle, E. Romeijn, and R. L. Smith, Hit-and-run algorithms for generating multivariate distributions, Math. Oper. Res. 18 (1993), 255\u2013266.","journal-title":"Math. Oper. Res."},{"key":"9508_CR3","doi-asserted-by":"crossref","unstructured":"J. R. S. Blair, B. Peyton, An introduction to chordal graphs and clique trees, in Graph Theory and Sparse Matrix Computation (A. George, J. R. Gilbert and J. W. H. Liu, eds.), Springer, 1993, pp 1\u201329.","DOI":"10.1007\/978-1-4613-8369-7_1"},{"key":"9508_CR4","unstructured":"B. Bollob\u00e1s, Volume estimates and rapid mixing, in Flavors of geometry (MSRI Publ. 31), Cambridge University Press, 1997, pp. 151\u2013180."},{"key":"9508_CR5","doi-asserted-by":"crossref","unstructured":"B. B\u00fceler, A. Enge and K. Fukuda, Exact volume computation for polytopes: a practical study, in Polytopes: combinatorics and computation (G. Kalai and G. M. Ziegler eds.), Birkh\u00e4user, 2000, pp. 131\u2013154.","DOI":"10.1007\/978-3-0348-8438-9_6"},{"issue":"3","key":"9508_CR6","doi-asserted-by":"publisher","first-page":"1534","DOI":"10.1137\/151002666","volume":"30","author":"D Cifuentes","year":"2016","unstructured":"D. Cifuentes and A. Parrilo, Exploiting Chordal Structure in Polynomial Ideals: A Gr\u00f6bner Bases Approach, SIAM J. Discrete Math. 30 issue 3 (2016),1534\u20131570.","journal-title":"SIAM J. Discrete Math."},{"key":"9508_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s12532-015-0097-z","volume":"8","author":"B Cousins","year":"2016","unstructured":"B. Cousins and S. Vempala, A practical volume algorithm, Math. Program. Comput. 8 (2016), 133\u2013160.","journal-title":"Math. Program. Comput."},{"key":"9508_CR8","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1137\/0217060","volume":"17","author":"ME Dyer","year":"1988","unstructured":"M. E. Dyer and A. M. Frieze, On the complexity of computing the volume of a polyhedron, SIAM J. Comput. 17 (1988), 967\u2013974.","journal-title":"SIAM J. Comput."},{"key":"9508_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/102782.102783","volume":"38","author":"ME Dyer","year":"1992","unstructured":"M. E. Dyer, A. M. Frieze and R. Kannan, A random polynomial-time algorithm for approximating the volume of convex bodies, J. ACM 38 (1992), 1\u201317.","journal-title":"J. ACM"},{"key":"9508_CR10","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF02187701","volume":"1","author":"G Elekes","year":"1986","unstructured":"G. Elekes, A geometric inequality and the complexity of measuring the volume, Discrete Comput. Geom. 1 (1986), 289\u2013292.","journal-title":"Discrete Comput. Geom."},{"key":"9508_CR11","doi-asserted-by":"crossref","unstructured":"D. Henrion, J. B. Lasserre and J. Loefberg, GloptiPoly 3: moments, optimization and semidefinite programming, Optimization Methods and Software 24 issues 4-5 (2009), 761-779.","DOI":"10.1080\/10556780802699201"},{"issue":"4","key":"9508_CR12","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1137\/080730287","volume":"51","author":"D Henrion","year":"2009","unstructured":"D. Henrion, J.B. Lasserre and C. Savorgnan, Approximate volume and integration for basic semialgebraic sets, SIAM Review 51 issue 4 (2009), 722\u2013743.","journal-title":"SIAM Review"},{"issue":"2","key":"9508_CR13","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1109\/TAC.2013.2283095","volume":"59","author":"D Henrion","year":"2014","unstructured":"D. Henrion and M. Korda, Convex computation of the region of attraction of polynomial control systems, IEEE Trans. Autom. Control 59 issue 2 (2014), 297-312.","journal-title":"IEEE Trans. Autom. Control"},{"key":"9508_CR14","unstructured":"J. H. Hubbard and B. Burke Hubbard, Vector calculus, linear algebra, and differential forms - A unified approach. 2nd Ed., Prentice Hall, 2002."},{"key":"9508_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s11590-015-0868-5","volume":"10","author":"C Josz","year":"2016","unstructured":"C. Josz and D. Henrion, Strong duality in Lasserre\u2019s hierarchy for polynomial optimization, Optim. Lett. 10 (2016), 3-10.","journal-title":"Optim. Lett."},{"key":"9508_CR16","doi-asserted-by":"publisher","unstructured":"C. Josz, D.K. Molzahn, M. Tacchi and S. Sojoudi, Transient stability analysis of power systems via occupation measures, Innovative Smart Grid Technologies (2019) https:\/\/doi.org\/10.1109\/ISGT.2019.8791570","DOI":"10.1109\/ISGT.2019.8791570"},{"key":"9508_CR17","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1137\/05064504X","volume":"17","author":"JB Lasserre","year":"2006","unstructured":"J.B. Lasserre, Convergent SDP relaxations in polynomial optimization with sparsity, SIAM J. Optim. 17 (2006), 822\u201384.","journal-title":"SIAM J. Optim."},{"key":"9508_CR18","doi-asserted-by":"crossref","unstructured":"J. B. Lasserre, Moments, positive polynomials and their applications, Imperial College Press, 2010.","DOI":"10.1142\/p665"},{"key":"9508_CR19","doi-asserted-by":"crossref","unstructured":"J.B. Lasserre, Computing Gaussian and exponential measures of semi-algebraic sets, Adv. Appl. Math. 91 \u20192017), 137\u2013163.","DOI":"10.1016\/j.aam.2017.06.006"},{"issue":"1","key":"9508_CR20","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/LCSYS.2017.2704295","volume":"1","author":"JB Lasserre","year":"2017","unstructured":"J. B. Lasserre, Representation of chance-constraints with strong asymptotic guarantees, IEEE Control Systems Letters 1 issue 1 (2017), 50\u201355.","journal-title":"IEEE Control Systems Letters"},{"key":"9508_CR21","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.1287\/opre.32.6.1296","volume":"32","author":"RL Smith","year":"1984","unstructured":"R. L. Smith, Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions, Oper. Res. 32 (1984), 1296\u20131308.","journal-title":"Oper. Res."},{"issue":"5","key":"9508_CR22","doi-asserted-by":"publisher","first-page":"396","DOI":"10.2307\/2321106","volume":"86","author":"R Stanley","year":"1979","unstructured":"R. Stanley, I. G. Macdonald and R. B. Nelsen, Solution of elementary problem E2701, The American Mathematical Monthly 86 issue 5 (1979),396.","journal-title":"The American Mathematical Monthly"},{"issue":"1","key":"9508_CR23","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1137\/050623802","volume":"17","author":"H Waki","year":"2006","unstructured":"H. Waki, S. Kim, M. Kojima and M. Muramatsu, Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity, SIAM J. Optim. 17 issue 1 (2006), 218\u2013242.","journal-title":"SIAM J. Optim."}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-021-09508-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10208-021-09508-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-021-09508-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,4]],"date-time":"2022-02-04T23:20:55Z","timestamp":1644016855000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10208-021-09508-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,26]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["9508"],"URL":"https:\/\/doi.org\/10.1007\/s10208-021-09508-w","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,26]]},"assertion":[{"value":"19 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}