{"id":"https://openalex.org/W2003208028","doi":"https://doi.org/10.1137/080743706","title":"Fully Distributed Algorithms for Convex Optimization Problems","display_name":"Fully Distributed Algorithms for Convex Optimization Problems","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2003208028","doi":"https://doi.org/10.1137/080743706","mag":"2003208028"},"language":"en","primary_location":{"id":"doi:10.1137/080743706","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080743706","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/A5007095622","display_name":"Damon Mosk-Aoyama","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Damon Mosk-Aoyama","raw_affiliation_strings":["damonma@cs.stanford.edu and tim@cs.stanford.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"damonma@cs.stanford.edu and tim@cs.stanford.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022886322","display_name":"Tim Roughgarden","orcid":"https://orcid.org/0000-0002-7163-8306"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tim Roughgarden","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5029499294","display_name":"Devavrat Shah","orcid":"https://orcid.org/0000-0003-0737-3259"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Devavrat Shah","raw_affiliation_strings":["devavrat@mit.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"devavrat@mit.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2903,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.92064836,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"20","issue":"6","first_page":"3260","last_page":"3279"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9943000078201294,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.7322791814804077},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6246092915534973},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.6038152575492859},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5821231603622437},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5125365257263184},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5009200572967529},{"id":"https://openalex.org/keywords/curvature","display_name":"Curvature","score":0.47862759232521057},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.44246500730514526}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.7322791814804077},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6246092915534973},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.6038152575492859},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5821231603622437},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5125365257263184},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5009200572967529},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.47862759232521057},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.44246500730514526},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/080743706","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080743706","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":[{"score":0.6299999952316284,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1997996213","https://openalex.org/W2013470587","https://openalex.org/W2078381259","https://openalex.org/W2159715570"],"related_works":["https://openalex.org/W2068832901","https://openalex.org/W2059909660","https://openalex.org/W2617248812","https://openalex.org/W1543769580","https://openalex.org/W3153752017","https://openalex.org/W2970569119","https://openalex.org/W2756132392","https://openalex.org/W3035814349","https://openalex.org/W4285101096","https://openalex.org/W4320477335"],"abstract_inverted_index":{"We":[0],"design":[1,70],"and":[2,25,41,64],"analyze":[3],"a":[4,42,55],"fully":[5],"distributed":[6],"algorithm":[7,20],"for":[8],"convex":[9],"constrained":[10],"optimization":[11,50],"in":[12,28,31,47,54],"networks":[13],"without":[14],"any":[15],"consistent":[16],"naming":[17],"infrastructure.":[18],"The":[19],"produces":[21],"an":[22],"approximately":[23],"feasible":[24],"near-optimal":[26],"solution":[27],"time":[29],"polynomial":[30],"the":[32,35,38,48,65,69],"network":[33],"size,":[34],"inverse":[36],"of":[37,44,71],"permitted":[39],"error,":[40],"measure":[43],"curvature":[45],"variation":[46],"dual":[49],"problem.":[51],"It":[52],"blends,":[53],"novel":[56],"way,":[57],"gossip-based":[58],"information":[59],"spreading,":[60],"iterative":[61],"gradient":[62],"ascent,":[63],"barrier":[66],"method":[67],"from":[68],"interior-point":[72],"algorithms.":[73]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}