{"id":"https://openalex.org/W3011501919","doi":"https://doi.org/10.1007/s12532-020-00185-4","title":"Asynchronous Lagrangian scenario decomposition","display_name":"Asynchronous Lagrangian scenario decomposition","publication_year":2020,"publication_date":"2020-03-14","ids":{"openalex":"https://openalex.org/W3011501919","doi":"https://doi.org/10.1007/s12532-020-00185-4","mag":"3011501919"},"language":"en","primary_location":{"id":"doi:10.1007/s12532-020-00185-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-020-00185-4","pdf_url":null,"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://doi.org/10.1007/s12532-020-00185-4","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113271783","display_name":"Ignacio Aravena","orcid":null},"institutions":[{"id":"https://openalex.org/I1282311441","display_name":"Lawrence Livermore National Laboratory","ror":"https://ror.org/041nk4h53","country_code":"US","type":"facility","lineage":["https://openalex.org/I1282311441","https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210138311"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ignacio Aravena","raw_affiliation_strings":["Lawrence Livermore National Laboratory, Livermore, California, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lawrence Livermore National Laboratory, Livermore, California, USA","institution_ids":["https://openalex.org/I1282311441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004239862","display_name":"Anthony Papavasiliou","orcid":"https://orcid.org/0000-0002-2236-2251"},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Anthony Papavasiliou","raw_affiliation_strings":["CORE, Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CORE, Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium","institution_ids":["https://openalex.org/I95674353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113271783"],"corresponding_institution_ids":["https://openalex.org/I1282311441"],"apc_list":{"value":2390,"currency":"EUR","value_usd":3090},"apc_paid":{"value":2390,"currency":"EUR","value_usd":3090},"fwci":1.487,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.83611381,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"13","issue":"1","first_page":"1","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9997000098228455,"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.9997000098228455,"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/T10424","display_name":"Electric Power System Optimization","score":0.9984999895095825,"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/T10067","display_name":"Stochastic processes and financial applications","score":0.9889000058174133,"subfield":{"id":"https://openalex.org/subfields/2003","display_name":"Finance"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7702633142471313},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7685447335243225},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.629999577999115},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5953827500343323},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5475455522537231},{"id":"https://openalex.org/keywords/coordinate-descent","display_name":"Coordinate descent","score":0.5342658162117004},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49359261989593506},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.46785834431648254},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4327279031276703},{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.43089181184768677},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.35053014755249023},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13090431690216064}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7702633142471313},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7685447335243225},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.629999577999115},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5953827500343323},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5475455522537231},{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.5342658162117004},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49359261989593506},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.46785834431648254},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4327279031276703},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.43089181184768677},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35053014755249023},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13090431690216064},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s12532-020-00185-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-020-00185-4","pdf_url":null,"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"},{"id":"pmh:oai:dial.uclouvain.be:boreal:228170","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/228170","pdf_url":null,"source":{"id":"https://openalex.org/S4306400166","display_name":"Digital Access to Libraries","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800384882","host_organization_name":"Harris County Public Library","host_organization_lineage":["https://openalex.org/I2800384882"],"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 Computation, Vol. 13, p. 1-50 (2021)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s12532-020-00185-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-020-00185-4","pdf_url":null,"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":[{"score":0.46000000834465027,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W75241701","https://openalex.org/W600957409","https://openalex.org/W610390588","https://openalex.org/W1506295250","https://openalex.org/W1540764732","https://openalex.org/W1569990960","https://openalex.org/W1576452626","https://openalex.org/W1658377468","https://openalex.org/W1834552176","https://openalex.org/W1975553364","https://openalex.org/W1990994993","https://openalex.org/W1992179166","https://openalex.org/W1995033525","https://openalex.org/W2000769684","https://openalex.org/W2008789074","https://openalex.org/W2013340830","https://openalex.org/W2025652703","https://openalex.org/W2027852107","https://openalex.org/W2043116361","https://openalex.org/W2055427220","https://openalex.org/W2064073681","https://openalex.org/W2065860274","https://openalex.org/W2076428552","https://openalex.org/W2082322377","https://openalex.org/W2095984592","https://openalex.org/W2099119387","https://openalex.org/W2109277200","https://openalex.org/W2117784255","https://openalex.org/W2119273405","https://openalex.org/W2123362433","https://openalex.org/W2130469840","https://openalex.org/W2149307604","https://openalex.org/W2159647569","https://openalex.org/W2161090654","https://openalex.org/W2167732364","https://openalex.org/W2168283238","https://openalex.org/W2188647300","https://openalex.org/W2311531209","https://openalex.org/W2405230269","https://openalex.org/W2473113327","https://openalex.org/W2476080091","https://openalex.org/W2492126716","https://openalex.org/W2505844790","https://openalex.org/W2587215006","https://openalex.org/W2616811598","https://openalex.org/W2766886803","https://openalex.org/W3123072800","https://openalex.org/W3147320355","https://openalex.org/W4249667877","https://openalex.org/W4394053121","https://openalex.org/W6968261107"],"related_works":["https://openalex.org/W2095293854","https://openalex.org/W1529126195","https://openalex.org/W2082862030","https://openalex.org/W1562495473","https://openalex.org/W3177299425","https://openalex.org/W2364921833","https://openalex.org/W2612103136","https://openalex.org/W4323650391","https://openalex.org/W3050209628","https://openalex.org/W3167336199"],"abstract_inverted_index":{"Abstract":[0],"We":[1,93,118,149],"present":[2,94],"a":[3,66,95],"distributed":[4,52,228],"asynchronous":[5,102,220],"algorithm":[6,29,60,174,196],"for":[7,218],"solving":[8],"two-stage":[9],"stochastic":[10,23],"mixed-integer":[11],"programs":[12],"(SMIP)":[13],"using":[14,65,76,91,122],"scenario":[15,40,89],"decomposition,":[16],"aimed":[17],"at":[18],"industrial-scale":[19,180],"instances":[20,124,157,182],"of":[21,42,51,88,100,125,138,171,204],"the":[22,86,101,105,113,126,139,159,168,172,205,216],"unit":[24],"commitment":[25],"(SUC)":[26],"problem.":[27],"The":[28,165],"is":[30],"motivated":[31],"by":[32,55,108],"large":[33],"differences":[34],"in":[35,48,223],"run":[36],"times":[37],"observed":[38],"among":[39,116],"subproblems":[41,90],"SUC":[43,123,181],"instances,":[44,211],"which":[45,71,214],"can":[46],"result":[47],"inefficient":[49],"use":[50],"computing":[53,98,229],"resources":[54],"synchronous":[56,194],"parallel":[57,110,195],"algorithms.":[58],"Our":[59],"performs":[61],"dual":[62],"iterations":[63],"asynchronously":[64],"block-coordinate":[67,74],"subgradient":[68],"descent":[69],"method":[70],"allows":[72],"performing":[73],"updates":[75],"delayed":[77],"information,":[78],"while":[79],"candidate":[80],"primal":[81],"solutions":[82,87],"are":[83],"recovered":[84],"from":[85,158],"heuristics.":[92],"high":[96],"performance":[97],"implementation":[99],"algorithm,":[103],"detailing":[104],"operations":[106],"performed":[107],"each":[109],"process":[111],"and":[112,137,163,175],"communication":[114],"mechanisms":[115],"them.":[117],"conduct":[119,151],"numerical":[120,152],"experiments":[121,153],"Western":[127,141],"Electricity":[128],"Coordinating":[129],"Council":[130],"system":[131,143],"with":[132,144],"up":[133,145,201],"to":[134,146,178,202,225],"1000":[135],"scenarios":[136],"Central":[140],"European":[142],"120":[147],"scenarios.":[148],"also":[150],"on":[154,207,230],"generic":[155],"SMIP":[156],"SIPLIB":[160],"library":[161],"(DCAP":[162],"SSLP).":[164],"results":[166],"demonstrate":[167],"general":[169],"applicability":[170],"proposed":[173],"its":[176],"ability":[177],"solve":[179],"within":[183],"operationally":[184],"acceptable":[185],"time":[186,206],"frames.":[187],"Moreover,":[188],"we":[189],"find":[190],"that":[191],"an":[192,212],"equivalent":[193],"would":[197],"leave":[198],"cores":[199],"idle":[200],"80.4%":[203],"our":[208],"realistic":[209],"test":[210],"observation":[213],"underscores":[215],"need":[217],"designing":[219],"optimization":[221],"schemes":[222],"order":[224],"fully":[226],"exploit":[227],"real":[231],"world":[232],"applications.":[233]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}