{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T17:40:31Z","timestamp":1781545231161,"version":"3.54.5"},"reference-count":11,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1137\/100814147","type":"journal-article","created":{"date-parts":[[2011,9,2]],"date-time":"2011-09-02T10:26:02Z","timestamp":1314959162000},"page":"824-832","source":"Crossref","is-referenced-by-count":38,"title":["On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems"],"prefix":"10.1137","volume":"21","author":[{"given":"Etienne","family":"de Klerk","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Monique","family":"Laurent","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"A. A. Ahmadi , A. Olshevsky , P. A. Parrilo and J. N. Tsitsiklis , NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems, preprint, MIT, Cambridge, MA, 2010.","DOI":"10.1007\/s10107-011-0499-2"},{"key":"R5","unstructured":"G. Blekherman , Convex Forms That are Not Sums of Squares, arXiv:0910.0656v1, 2009."},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-1989-15750-9"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0240-y"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400366802"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/080728214"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0222-0"},{"key":"R14","unstructured":"J. Nie , An Approximation Bound Analysis for Lasserre\u2019s Relaxation in Multivariate Polynomial Optimization, preprint, University of California, La Jolla, CA, 2010. Available online at http:\/\/math.ucsd.edu\/~njw\/PUBLICPAPERS\/LasBd.pdf."},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2006.07.002"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1515\/advg.2001.005"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1007\/s00209-003-0568-1"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/100814147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T17:35:30Z","timestamp":1560533730000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/100814147"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["10.1137\/100814147"],"URL":"https:\/\/doi.org\/10.1137\/100814147","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7]]}}}