{"id":"https://openalex.org/W2885464805","doi":"https://doi.org/10.1109/tac.2019.2930234","title":"AsySPA: An Exact Asynchronous Algorithm for Convex Optimization Over Digraphs","display_name":"AsySPA: An Exact Asynchronous Algorithm for Convex Optimization Over Digraphs","publication_year":2019,"publication_date":"2019-07-22","ids":{"openalex":"https://openalex.org/W2885464805","doi":"https://doi.org/10.1109/tac.2019.2930234","mag":"2885464805"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2019.2930234","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2019.2930234","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1808.04118","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jiaqi Zhang","orcid":"https://orcid.org/0000-0002-8833-1714"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jiaqi Zhang","raw_affiliation_strings":["Department of Automation and Beijing National Research Centre for Information Science and Technology, Tsinghua University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Department of Automation and Beijing National Research Centre for Information Science and Technology, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"last","author":{"id":null,"display_name":"Keyou You","orcid":"https://orcid.org/0000-0003-4355-5340"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Keyou You","raw_affiliation_strings":["Department of Automation and Beijing National Research Centre for Information Science and Technology, Tsinghua University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Department of Automation and Beijing National Research Centre for Information Science and Technology, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":6.1275,"has_fulltext":false,"cited_by_count":67,"citation_normalized_percentile":{"value":0.96614791,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"65","issue":"6","first_page":"2494","last_page":"2509"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.42160001397132874,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.42160001397132874,"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.19210000336170197,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0674000009894371,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/subgradient-method","display_name":"Subgradient method","score":0.7057999968528748},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6500999927520752},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.646399974822998},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6003999710083008},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.5346999764442444},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5310999751091003},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4724999964237213},{"id":"https://openalex.org/keywords/asynchrony","display_name":"Asynchrony (computer programming)","score":0.44519999623298645}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.7057999968528748},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6500999927520752},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.646399974822998},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6003999710083008},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5389000177383423},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.5346999764442444},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5310999751091003},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4724999964237213},{"id":"https://openalex.org/C2779019669","wikidata":"https://www.wikidata.org/wiki/Q25203946","display_name":"Asynchrony (computer programming)","level":3,"score":0.44519999623298645},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43799999356269836},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4163999855518341},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.415800005197525},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4117000102996826},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4115000069141388},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.3910999894142151},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3763999938964844},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.36640000343322754},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3628999888896942},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.3463999927043915},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.32350000739097595},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3163999915122986},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2816999852657318},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2632000148296356},{"id":"https://openalex.org/C107107730","wikidata":"https://www.wikidata.org/wiki/Q2994424","display_name":"Consensus","level":3,"score":0.2596000134944916},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.2587999999523163}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tac.2019.2930234","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2019.2930234","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1808.04118","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1808.04118","pdf_url":"https://arxiv.org/pdf/1808.04118","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1808.04118","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1808.04118","pdf_url":"https://arxiv.org/pdf/1808.04118","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G135221446","display_name":null,"funder_award_id":"61722308","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W1571416372","https://openalex.org/W2044212084","https://openalex.org/W2063403497","https://openalex.org/W2064403618","https://openalex.org/W2084044206","https://openalex.org/W2089855386","https://openalex.org/W2093777540","https://openalex.org/W2129883829","https://openalex.org/W2130263842","https://openalex.org/W2137435346","https://openalex.org/W2152637881","https://openalex.org/W2154834860","https://openalex.org/W2223126829","https://openalex.org/W2251632681","https://openalex.org/W2345689776","https://openalex.org/W2476071355","https://openalex.org/W2533385740","https://openalex.org/W2584572001","https://openalex.org/W2588283177","https://openalex.org/W2590635385","https://openalex.org/W2605369855","https://openalex.org/W2605994693","https://openalex.org/W2737743075","https://openalex.org/W2748196763","https://openalex.org/W2763533254","https://openalex.org/W2773221161","https://openalex.org/W2781354165","https://openalex.org/W2789489570","https://openalex.org/W2789972853","https://openalex.org/W2792751837","https://openalex.org/W2793522527","https://openalex.org/W2912544891","https://openalex.org/W2962760808","https://openalex.org/W2962771678","https://openalex.org/W2963090384","https://openalex.org/W2963385547","https://openalex.org/W2963395095","https://openalex.org/W2963590077","https://openalex.org/W2963607435","https://openalex.org/W2963649943","https://openalex.org/W2963680015","https://openalex.org/W3103793615","https://openalex.org/W6680086414","https://openalex.org/W6745458143","https://openalex.org/W6749849009","https://openalex.org/W6754140693","https://openalex.org/W6758995380","https://openalex.org/W6759078672"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,26,41,56,106,129,144],"novel":[4],"exact":[5],"asynchronous":[6],"subgradient-push":[7],"algorithm":[8],"(AsySPA)":[9],"to":[10,25,83,109,133,157],"solve":[11],"an":[12,34],"additive":[13],"cost":[14],"optimization":[15],"problem":[16],"over":[17],"digraphs":[18],"where":[19],"each":[20,38,116],"node":[21,39,76],"only":[22],"has":[23,150],"access":[24],"local":[27,66],"convex":[28],"function":[29],"and":[30,95,136,138,154,176],"updates":[31,49],"asynchronously":[32],"with":[33],"arbitrary":[35],"rate.":[36],"Specifically,":[37],"of":[40,77,163,170],"strongly":[42],"connected":[43],"digraph":[44],"does":[45],"not":[46],"wait":[47],"for":[48],"from":[50,69,122],"other":[51],"nodes":[52,94],"but":[53],"simply":[54],"starts":[55],"new":[57],"update":[58,91,102,114],"within":[59],"any":[60],"bounded":[61,96],"time":[62],"interval":[63],"by":[64,142],"using":[65],"information":[67],"available":[68],"its":[70,140,151],"in-neighbors.":[71],"\u201cExact\u201d":[72],"means":[73],"that":[74],"every":[75],"the":[78,84,123,160,164,171],"AsySPA":[79,172],"can":[80],"asymptotically":[81],"converge":[82],"same":[85],"optimal":[86],"solution,":[87],"even":[88],"under":[89],"different":[90,121],"rates":[92],"among":[93],"communication":[97],"delays.":[98],"To":[99],"address":[100,134],"uneven":[101],"rates,":[103],"we":[104,127,167],"design":[105],"simple":[107],"mechanism":[108],"adaptively":[110],"adjust":[111],"stepsizes":[112],"per":[113],"in":[115,173],"node,":[117],"which":[118,148],"is":[119],"substantially":[120],"existing":[124],"works.":[125],"Then,":[126],"construct":[128],"delay-free":[130],"augmented":[131],"system":[132],"asynchrony":[135],"delays,":[137],"study":[139],"convergence":[141,161],"proposing":[143],"generalized":[145],"subgradient":[146],"algorithm,":[147],"clearly":[149],"own":[152],"significance":[153],"helps":[155],"us":[156],"explicitly":[158],"evaluate":[159],"rate":[162],"AsySPA.":[165],"Finally,":[166],"demonstrate":[168],"advantages":[169],"both":[174],"theory":[175],"simulation.":[177]},"counts_by_year":[{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2018-08-22T00:00:00"}