{"id":"https://openalex.org/W4385249278","doi":"https://doi.org/10.1137/22m1485309","title":"Optimal Methods for Convex Risk-Averse Distributed Optimization","display_name":"Optimal Methods for Convex Risk-Averse Distributed Optimization","publication_year":2023,"publication_date":"2023-07-25","ids":{"openalex":"https://openalex.org/W4385249278","doi":"https://doi.org/10.1137/22m1485309"},"language":"en","primary_location":{"id":"doi:10.1137/22m1485309","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1137/22m1485309","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042544900","display_name":"Guanghui Lan","orcid":"https://orcid.org/0000-0002-2103-087X"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Guanghui Lan","raw_affiliation_strings":["H. Milton Stewart School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332 USA"],"affiliations":[{"raw_affiliation_string":"H. Milton Stewart School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332 USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100442950","display_name":"Zhe Zhang","orcid":"https://orcid.org/0000-0001-8407-3167"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhe Zhang","raw_affiliation_strings":["H. Milton Stewart School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332 USA"],"affiliations":[{"raw_affiliation_string":"H. Milton Stewart School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332 USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042544900"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07887437,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"3","first_page":"1518","last_page":"1557"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6349362134933472},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5557265281677246},{"id":"https://openalex.org/keywords/saddle-point","display_name":"Saddle point","score":0.5312597155570984},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5210441946983337},{"id":"https://openalex.org/keywords/ambiguity","display_name":"Ambiguity","score":0.5168778896331787},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4852032959461212},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4676365852355957},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.4655844271183014},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4604499936103821},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.45391231775283813},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4529992938041687},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.4132738709449768},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.413190633058548},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.34761518239974976},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2450695037841797},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.13188251852989197}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6349362134933472},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5557265281677246},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.5312597155570984},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5210441946983337},{"id":"https://openalex.org/C2780522230","wikidata":"https://www.wikidata.org/wiki/Q1140419","display_name":"Ambiguity","level":2,"score":0.5168778896331787},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4852032959461212},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4676365852355957},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.4655844271183014},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4604499936103821},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.45391231775283813},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4529992938041687},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.4132738709449768},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.413190633058548},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.34761518239974976},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2450695037841797},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.13188251852989197},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/22m1485309","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1137/22m1485309","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3057746509","display_name":null,"funder_award_id":"NSF-2112533","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7249327428","display_name":null,"funder_award_id":"N00014-20-1-2089","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1873244950","https://openalex.org/W1986874783","https://openalex.org/W2024165284","https://openalex.org/W2033957915","https://openalex.org/W2053434217","https://openalex.org/W2092663520","https://openalex.org/W2103559027","https://openalex.org/W2107205575","https://openalex.org/W2124541940","https://openalex.org/W2140514146","https://openalex.org/W2141682101","https://openalex.org/W2167732364","https://openalex.org/W2170344528","https://openalex.org/W2294586855","https://openalex.org/W2604272474","https://openalex.org/W2763081248","https://openalex.org/W2784277076","https://openalex.org/W2964037929","https://openalex.org/W2964268944","https://openalex.org/W2965299328","https://openalex.org/W2969738732","https://openalex.org/W2995022099","https://openalex.org/W3025638325","https://openalex.org/W3097661180","https://openalex.org/W3179558415","https://openalex.org/W4247489173","https://openalex.org/W4301435544"],"related_works":["https://openalex.org/W2391861012","https://openalex.org/W4285469493","https://openalex.org/W1593224248","https://openalex.org/W2080384954","https://openalex.org/W2375766869","https://openalex.org/W4382519933","https://openalex.org/W3151465598","https://openalex.org/W3036663304","https://openalex.org/W2086393803","https://openalex.org/W3103191366"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"the":[3,16,28,40,60,67,77,80,99,106,120,123,130,148,165,170],"communication":[4,46,85,149],"complexity":[5,86,144],"of":[6,132,151,169],"convex":[7],"risk-averse":[8,50,62,69],"optimization":[9,21,63,70],"over":[10,122],"a":[11,42,89,111],"network.":[12],"The":[13,102],"problem":[14],"generalizes":[15],"well-studied":[17],"risk-neutral":[18,52],"finite-sum":[19],"distributed":[20,57,61,68],"problem,":[22],"and":[23,51,66,154],"its":[24],"importance":[25],"stems":[26],"from":[27],"need":[29],"to":[30,75,146,156,163],"handle":[31],"risk":[32],"in":[33,39,45,98],"an":[34],"uncertain":[35],"environment.":[36],"For":[37],"algorithms":[38],"literature,":[41],"gap":[43],"exists":[44],"complexities":[47,150],"for":[48],"solving":[49],"problems.":[53],"We":[54,127],"propose":[55],"two":[56],"algorithms,":[58],"namely":[59],"(DRAO)":[64],"method":[65,82,104],"with":[71],"sliding":[72,115],"(DRAO-S)":[73],"method,":[74],"close":[76],"gap.":[78],"Specifically,":[79],"DRAO":[81,153],"achieves":[83],"optimal":[84],"by":[87,109,135],"assuming":[88],"certain":[90],"saddle":[91,113],"point":[92,114],"subproblem":[93],"can":[94],"be":[95,157],"easily":[96],"solved":[97],"server":[100],"node.":[101],"DRAO-S":[103,136,155,171],"removes":[105],"strong":[107],"assumption":[108],"introducing":[110],"novel":[112],"subroutine":[116],"which":[117],"only":[118],"requires":[119],"projection":[121],"ambiguity":[124],"set":[125],".":[126],"observe":[128],"that":[129],"number":[131],"-projections":[133],"performed":[134],"is":[137],"optimal.":[138],"Moreover,":[139],"we":[140],"develop":[141],"matching":[142],"lower":[143],"bounds":[145],"show":[147],"both":[152],"unimprovable.":[158],"Numerical":[159],"experiments":[160],"are":[161],"conducted":[162],"demonstrate":[164],"encouraging":[166],"empirical":[167],"performance":[168],"method.":[172]},"counts_by_year":[],"updated_date":"2025-12-23T23:11:35.936235","created_date":"2025-10-10T00:00:00"}