{"id":"https://openalex.org/W4408177675","doi":"https://doi.org/10.1007/s12532-025-00275-1","title":"Instance-specific linear relaxations of semidefinite optimization problems","display_name":"Instance-specific linear relaxations of semidefinite optimization problems","publication_year":2025,"publication_date":"2025-03-06","ids":{"openalex":"https://openalex.org/W4408177675","doi":"https://doi.org/10.1007/s12532-025-00275-1"},"language":"en","primary_location":{"id":"doi:10.1007/s12532-025-00275-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-025-00275-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-025-00275-1.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s12532-025-00275-1.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002617809","display_name":"Daniel de Roux","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Daniel de Roux","raw_affiliation_strings":["Tepper School of Business, Carnegie Mellon University, Pittsburgh, USA"],"affiliations":[{"raw_affiliation_string":"Tepper School of Business, Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101158812","display_name":"Robert Carr","orcid":null},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Carr","raw_affiliation_strings":["University of New Mexico, Albuquerque, USA"],"affiliations":[{"raw_affiliation_string":"University of New Mexico, Albuquerque, USA","institution_ids":["https://openalex.org/I169521973"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051770184","display_name":"R. Ravi","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Ravi","raw_affiliation_strings":["Tepper School of Business, Carnegie Mellon University, Pittsburgh, USA"],"affiliations":[{"raw_affiliation_string":"Tepper School of Business, Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002617809"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":{"value":2390,"currency":"EUR","value_usd":3090},"apc_paid":{"value":2390,"currency":"EUR","value_usd":3090},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07608696,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"2","first_page":"385","last_page":"435"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9952999949455261,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/theory-of-computation","display_name":"Theory of computation","score":0.7304519414901733},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.6629051566123962},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5430694222450256},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45614051818847656},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.42857831716537476},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3712764382362366},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.24382281303405762},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2326417863368988}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7304519414901733},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.6629051566123962},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5430694222450256},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45614051818847656},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.42857831716537476},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3712764382362366},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.24382281303405762},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2326417863368988},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s12532-025-00275-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-025-00275-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-025-00275-1.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s12532-025-00275-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-025-00275-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-025-00275-1.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320310207","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4408177675.pdf"},"referenced_works_count":72,"referenced_works":["https://openalex.org/W161953739","https://openalex.org/W431400460","https://openalex.org/W1499675658","https://openalex.org/W1536930209","https://openalex.org/W1564910180","https://openalex.org/W1568307856","https://openalex.org/W1668282207","https://openalex.org/W1861508522","https://openalex.org/W1878408459","https://openalex.org/W1963753244","https://openalex.org/W1967184028","https://openalex.org/W1967344706","https://openalex.org/W1969962394","https://openalex.org/W1985123706","https://openalex.org/W1985142495","https://openalex.org/W2012605254","https://openalex.org/W2019855902","https://openalex.org/W2023349184","https://openalex.org/W2026709222","https://openalex.org/W2029485617","https://openalex.org/W2042044648","https://openalex.org/W2045148236","https://openalex.org/W2051306216","https://openalex.org/W2058772615","https://openalex.org/W2069808690","https://openalex.org/W2078289947","https://openalex.org/W2082782506","https://openalex.org/W2083858754","https://openalex.org/W2085595139","https://openalex.org/W2086953401","https://openalex.org/W2087999447","https://openalex.org/W2092812429","https://openalex.org/W2099799470","https://openalex.org/W2137190019","https://openalex.org/W2144560699","https://openalex.org/W2150285483","https://openalex.org/W2158907148","https://openalex.org/W2163428398","https://openalex.org/W2176812374","https://openalex.org/W2282919306","https://openalex.org/W2288174618","https://openalex.org/W2294347342","https://openalex.org/W2336317531","https://openalex.org/W2494834885","https://openalex.org/W2527757967","https://openalex.org/W2567437854","https://openalex.org/W2885127571","https://openalex.org/W2912522929","https://openalex.org/W2926319838","https://openalex.org/W2942536350","https://openalex.org/W2963010019","https://openalex.org/W2964239200","https://openalex.org/W2979731212","https://openalex.org/W2997964792","https://openalex.org/W3007427904","https://openalex.org/W3106195685","https://openalex.org/W3119649271","https://openalex.org/W3120904440","https://openalex.org/W3124790153","https://openalex.org/W3135581793","https://openalex.org/W3161470040","https://openalex.org/W3167683174","https://openalex.org/W4229706427","https://openalex.org/W4233681555","https://openalex.org/W4235946010","https://openalex.org/W4243880374","https://openalex.org/W4287164425","https://openalex.org/W4298236575","https://openalex.org/W4312258136","https://openalex.org/W4377231287","https://openalex.org/W4384068558","https://openalex.org/W6607587766"],"related_works":["https://openalex.org/W2385886188","https://openalex.org/W2288891047","https://openalex.org/W2524928742","https://openalex.org/W2362452378","https://openalex.org/W2353517195","https://openalex.org/W3166939022","https://openalex.org/W1727084346","https://openalex.org/W2544939111","https://openalex.org/W2386048074","https://openalex.org/W2572095861"],"abstract_inverted_index":{"Abstract":[0],"We":[1,27,58,131],"introduce":[2],"a":[3,50,97],"generic":[4],"technique":[5],"to":[6,48,53,62,116],"obtain":[7],"linear":[8,41,56,64,90],"relaxations":[9,158],"of":[10,20,35,127,152,159],"semidefinite":[11,69,121,142,153],"programs":[12,65,70,122,154],"with":[13],"provable":[14],"guarantees":[15],"based":[16],"on":[17,138,149],"the":[18,21,24,32,36,39,72,82,89,102,128,139,144],"commutativity":[19],"constraint":[22],"and":[23,38,79,81,106,148],"objective":[25],"matrices.":[26],"study":[28],"conditions":[29],"under":[30],"which":[31,44],"optimal":[33],"value":[34,105],"SDP":[37],"proposed":[40,76,92],"relaxation":[42],"match,":[43],"we":[45,86],"then":[46],"relax":[47],"provide":[49,63],"flexible":[51],"methodology":[52],"derive":[54],"effective":[55],"relaxations.":[57],"specialize":[59],"these":[60],"results":[61],"that":[66,88,119],"approximate":[67],"well-known":[68],"for":[71,93,101],"max":[73,94,140],"cut":[74,95,104,141],"problem":[75],"by":[77,123],"Poljak":[78],"Rendl,":[80],"Lov\u00e1sz":[83,145],"theta":[84,146],"number;":[85],"prove":[87],"program":[91],"certifies":[96],"known":[98],"eigenvalue":[99],"bound":[100],"maximum":[103],"is":[107],"in":[108],"fact":[109],"stronger.":[110],"Our":[111],"ideas":[112],"can":[113],"be":[114],"used":[115],"warm-start":[117],"algorithms":[118],"solve":[120],"iterative":[124],"polyhedral":[125],"approximation":[126],"feasible":[129],"region.":[130],"verify":[132],"this":[133],"capability":[134],"through":[135],"multiple":[136],"experiments":[137],"program,":[143],"number":[147],"three":[150],"families":[151],"obtained":[155],"as":[156],"convex":[157],"certain":[160],"quadratically":[161],"constrained":[162],"quadratic":[163],"problems.":[164]},"counts_by_year":[],"updated_date":"2025-12-22T23:10:17.713674","created_date":"2025-10-10T00:00:00"}