{"id":"https://openalex.org/W2023653074","doi":"https://doi.org/10.1137/090772204","title":"A Unifying Polyhedral Approximation Framework for Convex Optimization","display_name":"A Unifying Polyhedral Approximation Framework for Convex Optimization","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2023653074","doi":"https://doi.org/10.1137/090772204","mag":"2023653074"},"language":"en","primary_location":{"id":"doi:10.1137/090772204","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090772204","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":"http://hdl.handle.net/10138/33051","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039911471","display_name":"Dimitri P. Bertsekas","orcid":"https://orcid.org/0000-0001-6909-7208"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dimitri P. Bertsekas","raw_affiliation_strings":["dimitrib@mit.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"dimitrib@mit.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014937312","display_name":"Huizhen Yu","orcid":"https://orcid.org/0000-0002-3673-0094"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huizhen Yu","raw_affiliation_strings":["janey_yu@mit.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"janey_yu@mit.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.727,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.96529896,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"21","issue":"1","first_page":"333","last_page":"360"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social 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.9832000136375427,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9390000104904175,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7291913032531738},{"id":"https://openalex.org/keywords/linearization","display_name":"Linearization","score":0.7171719074249268},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.5804203152656555},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5748772621154785},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.5393616557121277},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5053618550300598},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4883248507976532},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.45670080184936523},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.42761099338531494},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3931281268596649},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.19482383131980896},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.10897168517112732},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.0801050066947937}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7291913032531738},{"id":"https://openalex.org/C11210021","wikidata":"https://www.wikidata.org/wiki/Q1520713","display_name":"Linearization","level":3,"score":0.7171719074249268},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5804203152656555},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5748772621154785},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5393616557121277},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5053618550300598},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4883248507976532},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.45670080184936523},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.42761099338531494},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3931281268596649},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.19482383131980896},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.10897168517112732},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.0801050066947937},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/090772204","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090772204","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:helda.helsinki.fi:10138/33051","is_oa":true,"landing_page_url":"http://hdl.handle.net/10138/33051","pdf_url":null,"source":{"id":"https://openalex.org/S4210213322","display_name":"Ty\u00f6v\u00e4entutkimus Vuosikirja","issn_l":"0784-1272","issn":["0784-1272","1459-7780"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:helda.helsinki.fi:10138/33051","is_oa":true,"landing_page_url":"http://hdl.handle.net/10138/33051","pdf_url":null,"source":{"id":"https://openalex.org/S4210213322","display_name":"Ty\u00f6v\u00e4entutkimus Vuosikirja","issn_l":"0784-1272","issn":["0784-1272","1459-7780"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W42730899","https://openalex.org/W191607929","https://openalex.org/W633277346","https://openalex.org/W1537335979","https://openalex.org/W1538755060","https://openalex.org/W1553702074","https://openalex.org/W1559582792","https://openalex.org/W1573199930","https://openalex.org/W1669104078","https://openalex.org/W1963481290","https://openalex.org/W1977545325","https://openalex.org/W2005477778","https://openalex.org/W2007389878","https://openalex.org/W2013267947","https://openalex.org/W2016184081","https://openalex.org/W2032606187","https://openalex.org/W2034306657","https://openalex.org/W2040771350","https://openalex.org/W2103725866","https://openalex.org/W2121756644","https://openalex.org/W2145072018","https://openalex.org/W2155370486","https://openalex.org/W2168405789","https://openalex.org/W2582993536","https://openalex.org/W2798766386","https://openalex.org/W3029645440","https://openalex.org/W3139603399"],"related_works":["https://openalex.org/W4308588612","https://openalex.org/W4308203931","https://openalex.org/W4312204330","https://openalex.org/W4315641021","https://openalex.org/W2015131155","https://openalex.org/W1011247862","https://openalex.org/W1031119431","https://openalex.org/W1990328879","https://openalex.org/W1520256929","https://openalex.org/W2423508375"],"abstract_inverted_index":{"We":[0,131],"propose":[1],"a":[2,35,43,67,126],"unifying":[3],"framework":[4,57],"for":[5,39,49,135],"polyhedral":[6],"approximation":[7,47],"in":[8,125,146],"convex":[9,50],"optimization.":[10],"It":[11],"subsumes":[12],"classical":[13],"methods,":[14,32],"such":[15,33],"as":[16,34,73],"cutting":[17],"plane":[18],"and":[19,27,42,78,82,88,97,112,115,120,141],"simplicial":[20,36],"decomposition,":[21],"but":[22],"also":[23],"includes":[24,72],"new":[25,28,44],"methods":[26],"versions/extensions":[29],"of":[30,64,100,118],"old":[31],"decomposition":[37],"method":[38,48],"nondifferentiable":[40],"optimization":[41],"piecewise":[45],"linear":[46],"single":[51],"commodity":[52],"network":[53],"flow":[54],"problems.":[55],"Our":[56,92],"is":[58,83,106],"based":[59],"on":[60],"an":[61,86],"extended":[62],"form":[63],"monotropic":[65,80],"programming,":[66,81],"broadly":[68],"applicable":[69],"model,":[70],"which":[71],"special":[74],"cases":[75],"Fenchel":[76],"duality":[77,90],"Rockafellar's":[79],"characterized":[84],"by":[85,109],"elegant":[87],"symmetric":[89],"theory.":[91],"algorithm":[93],"combines":[94],"flexibly":[95],"outer":[96,119,140],"inner":[98,121,142],"linearization":[99,105,122,143],"the":[101,116,136,147],"cost":[102],"function.":[103],"The":[104],"progressively":[107],"refined":[108],"using":[110],"primal":[111],"dual":[113,129],"differentiation,":[114],"roles":[117],"are":[123,144],"reversed":[124],"mathematically":[127],"equivalent":[128],"algorithm.":[130,149],"provide":[132],"convergence":[133],"results":[134],"general":[137],"case":[138],"where":[139],"combined":[145],"same":[148]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}