{"id":"https://openalex.org/W4295885108","doi":"https://doi.org/10.1007/s10107-022-01881-w","title":"Robust convex optimization: A new perspective that unifies and extends","display_name":"Robust convex optimization: A new perspective that unifies and extends","publication_year":2022,"publication_date":"2022-09-12","ids":{"openalex":"https://openalex.org/W4295885108","doi":"https://doi.org/10.1007/s10107-022-01881-w"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-022-01881-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-022-01881-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-022-01881-w.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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","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/s10107-022-01881-w.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025940525","display_name":"Dimitris Bertsimas","orcid":"https://orcid.org/0000-0002-1985-1003"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dimitris Bertsimas","raw_affiliation_strings":["Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA, United States"],"affiliations":[{"raw_affiliation_string":"Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA, United States","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029123069","display_name":"Dick den Hertog","orcid":"https://orcid.org/0000-0002-1829-855X"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Dick den Hertog","raw_affiliation_strings":["Amsterdam Business School, University of Amsterdam, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Amsterdam Business School, University of Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000162562","display_name":"Jean Pauphilet","orcid":"https://orcid.org/0000-0001-6352-0984"},"institutions":[{"id":"https://openalex.org/I61544103","display_name":"London Business School","ror":"https://ror.org/001c2sn75","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I61544103"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jean Pauphilet","raw_affiliation_strings":["London Business School, London, United Kingdom"],"affiliations":[{"raw_affiliation_string":"London Business School, London, United Kingdom","institution_ids":["https://openalex.org/I61544103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048669137","display_name":"Jianzhe Zhen","orcid":"https://orcid.org/0000-0001-9826-2209"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jianzhe Zhen","raw_affiliation_strings":["swissQuant, Z\u00fcrich, Switzerland"],"affiliations":[{"raw_affiliation_string":"swissQuant, Z\u00fcrich, Switzerland","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5029123069"],"corresponding_institution_ids":["https://openalex.org/I887064364"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2890},"fwci":1.6947,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.85315608,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"200","issue":"2","first_page":"877","last_page":"918"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.989300012588501,"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9824000000953674,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7256784439086914},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.6405618190765381},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.628774106502533},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6181095838546753},{"id":"https://openalex.org/keywords/linearization","display_name":"Linearization","score":0.5655750036239624},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5459408760070801},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.5182023644447327},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5104693174362183},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.4439657926559448},{"id":"https://openalex.org/keywords/perspective","display_name":"Perspective (graphical)","score":0.42861080169677734},{"id":"https://openalex.org/keywords/proper-convex-function","display_name":"Proper convex function","score":0.41108250617980957},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22028085589408875},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.09791672229766846}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7256784439086914},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.6405618190765381},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.628774106502533},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6181095838546753},{"id":"https://openalex.org/C11210021","wikidata":"https://www.wikidata.org/wiki/Q1520713","display_name":"Linearization","level":3,"score":0.5655750036239624},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5459408760070801},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.5182023644447327},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5104693174362183},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.4439657926559448},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.42861080169677734},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.41108250617980957},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22028085589408875},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.09791672229766846},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s10107-022-01881-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-022-01881-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-022-01881-w.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire/53ea4f9e-5a3e-40b1-b1bb-3f12387bc2c3","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/robust-convex-optimization-a-new-perspective-that-unifies-and-extends(53ea4f9e-5a3e-40b1-b1bb-3f12387bc2c3).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bertsimas, D, den Hertog, D, Pauphilet, J & Zhen, J 2023, 'Robust convex optimization: A new perspective that unifies and extends', Mathematical programming, vol. 200, pp. 877\u2013918. https://doi.org/10.1007/s10107-022-01881-w","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:lbsresearch.london.edu:2617","is_oa":true,"landing_page_url":"https://lbsresearch.london.edu/view/lbs_authors/b8b65cc4d95fba0a72df29bfb62e87f5.html>","pdf_url":"https://lbsresearch.london.edu/id/eprint/2617/1/s10107-022-01881-w.pdf","source":{"id":"https://openalex.org/S4306400580","display_name":"London Business School Research Online (London Business School)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I61544103","host_organization_name":"London Business School","host_organization_lineage":["https://openalex.org/I61544103"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:dspace.mit.edu:1721.1/145481","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/145481","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Springer Berlin Heidelberg","raw_type":"http://purl.org/eprint/type/JournalArticle"},{"id":"pmh:uvapub:oai:dare.uva.nl:openaire_cris_publications/53ea4f9e-5a3e-40b1-b1bb-3f12387bc2c3","is_oa":true,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/robust-convex-optimization-a-new-perspective-that-unifies-and-extends(53ea4f9e-5a3e-40b1-b1bb-3f12387bc2c3).html","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":"Mathematical programming, 200. Springer-Verlag GmbH and Co. KG","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s10107-022-01881-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-022-01881-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-022-01881-w.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4295885108.pdf","grobid_xml":"https://content.openalex.org/works/W4295885108.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1976392670","https://openalex.org/W2005678164","https://openalex.org/W2057511182","https://openalex.org/W2071439977","https://openalex.org/W2078355481","https://openalex.org/W2102426156","https://openalex.org/W2107968842","https://openalex.org/W2123309836","https://openalex.org/W2162210915","https://openalex.org/W2962752138","https://openalex.org/W3125338181","https://openalex.org/W3130935034","https://openalex.org/W3138682964","https://openalex.org/W3212560181","https://openalex.org/W4220896980","https://openalex.org/W4251616545"],"related_works":["https://openalex.org/W2040676043","https://openalex.org/W3139158759","https://openalex.org/W3135309989","https://openalex.org/W3107799181","https://openalex.org/W4256242347","https://openalex.org/W3125145310","https://openalex.org/W2051968184","https://openalex.org/W2153986439","https://openalex.org/W1496637723","https://openalex.org/W2017397317"],"abstract_inverted_index":{"Abstract":[0],"Robust":[1],"convex":[2,18,89,93],"constraints":[3,32],"are":[4],"difficult":[5],"to":[6,15,28,87,107],"handle,":[7],"since":[8],"finding":[9],"the":[10,39,56,60,81,115,121],"worst-case":[11],"scenario":[12],"is":[13,50,75],"equivalent":[14],"maximizing":[16],"a":[17,25,45,98,128],"function.":[19],"In":[20],"this":[21],"paper,":[22],"we":[23],"propose":[24],"new":[26],"approach":[27,126],"deal":[29],"with":[30],"such":[31],"that":[33],"unifies":[34],"most":[35],"approaches":[36],"known":[37],"in":[38,44,59],"literature":[40],"and":[41,83,91,111,131],"extends":[42],"them":[43],"significant":[46],"way.":[47],"The":[48],"extension":[49,79],"either":[51],"obtaining":[52,63],"better":[53],"solutions":[54,64],"than":[55],"ones":[57],"proposed":[58],"literature,":[61],"or":[62],"for":[65,114],"classes":[66],"of":[67,80,100,124],"problems":[68],"unaddressed":[69],"by":[70],"previous":[71],"approaches.":[72],"Our":[73],"solution":[74],"based":[76],"on":[77,127],"an":[78],"Reformulation-Linearization-Technique,":[82],"can":[84,104],"be":[85,105],"applied":[86],"general":[88,92],"inequalities":[90],"uncertainty":[94],"sets.":[95],"It":[96],"generates":[97],"sequence":[99],"conservative":[101],"approximations":[102],"which":[103],"used":[106],"obtain":[108],"both":[109],"upper-":[110],"lower-":[112],"bounds":[113],"optimal":[116],"objective":[117],"value.":[118],"We":[119],"illustrate":[120],"numerical":[122],"benefit":[123],"our":[125],"robust":[129,132],"control":[130],"geometric":[133],"optimization":[134],"example.":[135]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}