{"id":"https://openalex.org/W2001098796","doi":"https://doi.org/10.1137/04060562x","title":"Semidefinite Approximations for Global Unconstrained Polynomial Optimization","display_name":"Semidefinite Approximations for Global Unconstrained Polynomial Optimization","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2001098796","doi":"https://doi.org/10.1137/04060562x","mag":"2001098796"},"language":"en","primary_location":{"id":"doi:10.1137/04060562x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/04060562x","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://research.tue.nl/en/publications/a2fec9c6-e228-4dc3-b5a8-5c32c40a8fae","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011988106","display_name":"D. Jibetean","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Dorina Jibetean","raw_affiliation_strings":["TUe, Postbus 513, 5600 MB Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TUe, Postbus 513, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"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":["CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CWI, Kruislaan 413, 1098 SJ Amsterdam, The 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":7.7564,"has_fulltext":true,"cited_by_count":43,"citation_normalized_percentile":{"value":0.980717,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"16","issue":"2","first_page":"490","last_page":"514"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9983000159263611,"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/semidefinite-programming","display_name":"Semidefinite programming","score":0.9040251970291138},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8427278399467468},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.784730076789856},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4981696605682373},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4618794620037079},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43721118569374084},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.42156392335891724},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3889944553375244},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.35311704874038696},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33842208981513977},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.33276697993278503},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.15712133049964905},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09921061992645264}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.9040251970291138},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8427278399467468},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.784730076789856},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4981696605682373},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4618794620037079},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43721118569374084},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.42156392335891724},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3889944553375244},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.35311704874038696},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33842208981513977},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.33276697993278503},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.15712133049964905},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09921061992645264},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/04060562x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/04060562x","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:pure.tue.nl:openaire_cris_publications/a2fec9c6-e228-4dc3-b5a8-5c32c40a8fae","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/a2fec9c6-e228-4dc3-b5a8-5c32c40a8fae","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e 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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jibetean, D & Laurent, M 2005, 'Semidefinite approximations for global unconstrained polynomial optimization', SIAM Journal on Discrete Mathematics, vol. 16, no. 2, pp. 490-514. https://doi.org/10.1137/04060562X","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/a2fec9c6-e228-4dc3-b5a8-5c32c40a8fae","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/a2fec9c6-e228-4dc3-b5a8-5c32c40a8fae","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":"SIAM Journal on Discrete Mathematics, 16(2), 490 - 514. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/a2fec9c6-e228-4dc3-b5a8-5c32c40a8fae","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/a2fec9c6-e228-4dc3-b5a8-5c32c40a8fae","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e 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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jibetean, D & Laurent, M 2005, 'Semidefinite approximations for global unconstrained polynomial optimization', SIAM Journal on Discrete Mathematics, vol. 16, no. 2, pp. 490-514. https://doi.org/10.1137/04060562X","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1483218536","https://openalex.org/W1543064558","https://openalex.org/W1574151794","https://openalex.org/W1605206672","https://openalex.org/W1622063347","https://openalex.org/W1904611021","https://openalex.org/W1967184028","https://openalex.org/W1967344706","https://openalex.org/W1996338984","https://openalex.org/W2001033871","https://openalex.org/W2011039300","https://openalex.org/W2027470314","https://openalex.org/W2030072108","https://openalex.org/W2037142574","https://openalex.org/W2049087128","https://openalex.org/W2061186416","https://openalex.org/W2079135578","https://openalex.org/W2133404041","https://openalex.org/W2133602590","https://openalex.org/W2319466955","https://openalex.org/W2325692311","https://openalex.org/W2498144272","https://openalex.org/W2962725330","https://openalex.org/W4214631368","https://openalex.org/W4255442211"],"related_works":["https://openalex.org/W2348903644","https://openalex.org/W2975050997","https://openalex.org/W2737505353","https://openalex.org/W2912522929","https://openalex.org/W1653317167","https://openalex.org/W1989828432","https://openalex.org/W2364528045","https://openalex.org/W2352839224","https://openalex.org/W2385886188","https://openalex.org/W4240313861"],"abstract_inverted_index":{"We":[0,63],"consider":[1],"the":[2,46,49,76],"problem":[3,51],"of":[4,25,48,55],"minimizing":[5],"a":[6,53,66],"polynomial":[7,78],"function":[8],"on":[9,74],"${\\mathbb":[10],"R}^n$,":[11],"known":[12],"to":[13,87],"be":[14],"hard":[15],"even":[16],"for":[17,68],"degree":[18],"4":[19],"polynomials.":[20],"Therefore":[21],"approximation":[22],"algorithms":[23],"are":[24],"interest.":[26],"Lasserre":[27],"[SIAM":[28],"J.":[29],"Optim.,":[30],"11":[31],"(2001),":[32],"pp.":[33,41],"796--817]":[34],"and":[35,79],"Parrilo":[36],"[Math.":[37],"Program.,":[38],"96":[39],"(2003),":[40],"293--320]":[42],"have":[43],"proposed":[44],"approximating":[45],"minimum":[47],"original":[50,77],"using":[52,80],"hierarchy":[54],"lower":[56],"bounds":[57,72],"obtained":[58],"via":[59],"semidefinite":[60,81],"programming":[61],"relaxations.":[62],"propose":[64],"here":[65],"method":[67,84],"computing":[69],"tight":[70],"upper":[71],"based":[73],"perturbing":[75],"programming.":[82],"The":[83],"is":[85],"applied":[86],"several":[88],"examples.":[89]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-13T07:54:00.901334","created_date":"2025-10-10T00:00:00"}