{"id":"https://openalex.org/W2001334051","doi":"https://doi.org/10.1137/100814147","title":"On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems","display_name":"On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2001334051","doi":"https://doi.org/10.1137/100814147","mag":"2001334051"},"language":"en","primary_location":{"id":"doi:10.1137/100814147","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100814147","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ir.cwi.nl/pub/18610/18610D.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019341464","display_name":"Etienne de Klerk","orcid":"https://orcid.org/0000-0003-3377-0063"},"institutions":[{"id":"https://openalex.org/I193700539","display_name":"Tilburg University","ror":"https://ror.org/04b8v1s79","country_code":"NL","type":"education","lineage":["https://openalex.org/I193700539"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Etienne de Klerk","raw_affiliation_strings":["(Tilburg University)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"(Tilburg University)","institution_ids":["https://openalex.org/I193700539"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047819350","display_name":"Monique Laurent","orcid":"https://orcid.org/0000-0001-8474-2121"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Monique Laurent","raw_affiliation_strings":["Centrum Wiskunde & Informatica (CWI), Science Park 123, 1098 XG Amsterdam, and Tilburg University, Department of Econometrics and Operations Research, 5000 LE Tilburg, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centrum Wiskunde & Informatica (CWI), Science Park 123, 1098 XG Amsterdam, and Tilburg University, Department of Econometrics and Operations Research, 5000 LE Tilburg, Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.176,"has_fulltext":true,"cited_by_count":59,"citation_normalized_percentile":{"value":0.98450947,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"21","issue":"3","first_page":"824","last_page":"832"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9818000197410583,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8736817240715027},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.7910711765289307},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.6729081273078918},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6267793774604797},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5058157444000244},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5021169185638428},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49269989132881165},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4802670478820801},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4497147798538208},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4033873677253723},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36256158351898193},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3413105607032776},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.12752118706703186},{"id":"https://openalex.org/keywords/law","display_name":"Law","score":0.0614875853061676},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06117519736289978}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8736817240715027},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7910711765289307},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.6729081273078918},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6267793774604797},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5058157444000244},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5021169185638428},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49269989132881165},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4802670478820801},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4497147798538208},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4033873677253723},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36256158351898193},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3413105607032776},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.12752118706703186},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0614875853061676},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06117519736289978},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1137/100814147","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100814147","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:tilburguniversity.edu:openaire_cris_publications/063416e7-63d9-404f-98eb-b1378b4c5a68","is_oa":false,"landing_page_url":"https://research.tilburguniversity.edu/en/publications/063416e7-63d9-404f-98eb-b1378b4c5a68","pdf_url":null,"source":{"id":"https://openalex.org/S4406923027","display_name":"Tilburg University Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"de Klerk, E & Laurent, M 2011, 'On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems', SIAM Journal on Optimization, vol. 21, no. 3, pp. 824-832. < http://epubs.siam.org/siopt/resource/1/sjope8/v21/i3/p824_s1 >","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:cwi.nl:18610","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/18610","pdf_url":"https://ir.cwi.nl/pub/18610/18610D.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization vol. 21, pp. 824-832","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:cwi:oai:cwi.nl:16990","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/16990","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.186.1130","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.1130","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cwi.nl/%7Emonique/files/convex_pop_hierarchy4.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.221.5034","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.5034","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cwi.nl/%7Emonique/files/convex_pop_hierarchy_rev2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.226.4226","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.226.4226","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://oai.cwi.nl/oai/asset/16990/16990A.pdf","raw_type":"text"},{"id":"pmh:oai:tilburguniversity.edu:publications/063416e7-63d9-404f-98eb-b1378b4c5a68","is_oa":false,"landing_page_url":"http://epubs.siam.org/siopt/resource/1/sjope8/v21/i3/p824_s1","pdf_url":null,"source":{"id":"https://openalex.org/S4406923027","display_name":"Tilburg University Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"de Klerk, E & Laurent, M 2011, 'On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems', SIAM Journal on Optimization, vol. 21, no. 3, pp. 824-832. < http://epubs.siam.org/siopt/resource/1/sjope8/v21/i3/p824_s1 >","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:cwi.nl:18610","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/18610","pdf_url":"https://ir.cwi.nl/pub/18610/18610D.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization vol. 21, pp. 824-832","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2001334051.pdf","grobid_xml":"https://content.openalex.org/works/W2001334051.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1503221585","https://openalex.org/W1572246416","https://openalex.org/W1681064468","https://openalex.org/W1884347414","https://openalex.org/W1967344706","https://openalex.org/W1970515840","https://openalex.org/W1970699014","https://openalex.org/W1974962384","https://openalex.org/W2011039300","https://openalex.org/W2017436952","https://openalex.org/W2028777326","https://openalex.org/W2071846104","https://openalex.org/W2083449425","https://openalex.org/W2097743263","https://openalex.org/W2165281529","https://openalex.org/W2321772449","https://openalex.org/W2476096155","https://openalex.org/W2611293703","https://openalex.org/W2769907661","https://openalex.org/W3029645440","https://openalex.org/W3105811395"],"related_works":["https://openalex.org/W2912909874","https://openalex.org/W4288573727","https://openalex.org/W2768754015","https://openalex.org/W2981448761","https://openalex.org/W4312206320","https://openalex.org/W2160052563","https://openalex.org/W1544933314","https://openalex.org/W2115832833","https://openalex.org/W2803118069","https://openalex.org/W2126408684"],"abstract_inverted_index":{"The":[0],"Lasserre":[1],"hierarchy":[2],"of":[3,42,65,77],"semidefinite":[4],"programming":[5],"approximations":[6],"to":[7,14],"convex":[8],"polynomial":[9,28],"optimization":[10],"problems":[11],"is":[12],"known":[13,52],"converge":[15],"finitely":[16],"under":[17,47],"some":[18],"assumptions.":[19],"[J.":[20],"B.":[21],"Lasserre,":[22],"Convexity":[23],"in":[24],"semialgebraic":[25],"geometry":[26],"and":[27],"optimization,":[29],"SIAM":[30],"J.":[31],"Optim.,":[32],"19":[33],"(2009),":[34],"pp.":[35],"1995\u20132014].":[36],"We":[37],"give":[38],"a":[39],"new":[40],"proof":[41],"the":[43,59,74,78],"finite":[44,62],"convergence":[45,69],"property":[46],"weaker":[48],"assumptions":[49,60],"than":[50,73],"were":[51],"before.":[53],"In":[54],"addition,":[55],"we":[56],"show":[57],"that\u2014under":[58],"for":[61,68],"convergence\u2014the":[63],"number":[64],"steps":[66],"needed":[67],"depends":[70],"on":[71],"more":[72],"input":[75],"size":[76],"problem.":[79]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}