{"id":"https://openalex.org/W2792751837","doi":"https://doi.org/10.1109/lcsys.2018.2834316","title":"A Linear Algorithm for Optimization Over Directed Graphs With Geometric Convergence","display_name":"A Linear Algorithm for Optimization Over Directed Graphs With Geometric Convergence","publication_year":2018,"publication_date":"2018-05-08","ids":{"openalex":"https://openalex.org/W2792751837","doi":"https://doi.org/10.1109/lcsys.2018.2834316","mag":"2792751837"},"language":"en","primary_location":{"id":"doi:10.1109/lcsys.2018.2834316","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcsys.2018.2834316","pdf_url":null,"source":{"id":"https://openalex.org/S4306422535","display_name":"IEEE Control Systems Letters","issn_l":"2475-1456","issn":["2475-1456"],"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 Control Systems Letters","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1803.02503","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ran Xin","orcid":"https://orcid.org/0000-0002-1697-9116"},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ran Xin","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Tufts University, Medford, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-1697-9116","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Tufts University, Medford, MA, USA","institution_ids":["https://openalex.org/I121934306"]}]},{"author_position":"last","author":{"id":null,"display_name":"Usman A. Khan","orcid":"https://orcid.org/0000-0002-0853-6518"},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Usman A. Khan","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Tufts University, Medford, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-0853-6518","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Tufts University, Medford, MA, USA","institution_ids":["https://openalex.org/I121934306"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I121934306"],"apc_list":null,"apc_paid":null,"fwci":14.0518,"has_fulltext":false,"cited_by_count":231,"citation_normalized_percentile":{"value":0.98957348,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"2","issue":"3","first_page":"315","last_page":"320"},"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.9294999837875366,"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.9294999837875366,"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.017899999395012856,"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/T11347","display_name":"Neural Networks Stability and Synchronization","score":0.0038999998942017555,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6184999942779541},{"id":"https://openalex.org/keywords/frank\u2013wolfe-algorithm","display_name":"Frank\u2013Wolfe algorithm","score":0.5354999899864197},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5157999992370605},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4805999994277954},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.45249998569488525},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.4392000138759613},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43479999899864197},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.41659998893737793}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7164000272750854},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6184999942779541},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.5354999899864197},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5157999992370605},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4936000108718872},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4805999994277954},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.45249998569488525},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.4392000138759613},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43479999899864197},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42579999566078186},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.41659998893737793},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41280001401901245},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.40869998931884766},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.36480000615119934},{"id":"https://openalex.org/C134466208","wikidata":"https://www.wikidata.org/wiki/Q1520657","display_name":"Weight function","level":2,"score":0.3560999929904938},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.33809998631477356},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2969000041484833},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.2775999903678894},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2757999897003174},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25929999351501465},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.2533000111579895},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.25220000743865967},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.2515000104904175}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lcsys.2018.2834316","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcsys.2018.2834316","pdf_url":null,"source":{"id":"https://openalex.org/S4306422535","display_name":"IEEE Control Systems Letters","issn_l":"2475-1456","issn":["2475-1456"],"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 Control Systems Letters","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1803.02503","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1803.02503","pdf_url":"https://arxiv.org/pdf/1803.02503","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:1803.02503","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1803.02503","pdf_url":"https://arxiv.org/pdf/1803.02503","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1571416372","https://openalex.org/W1616857247","https://openalex.org/W1788292158","https://openalex.org/W1954823950","https://openalex.org/W1994860969","https://openalex.org/W2044212084","https://openalex.org/W2053745833","https://openalex.org/W2063403497","https://openalex.org/W2084044206","https://openalex.org/W2110100895","https://openalex.org/W2137435346","https://openalex.org/W2291434103","https://openalex.org/W2400034325","https://openalex.org/W2476071355","https://openalex.org/W2590635385","https://openalex.org/W2612249769","https://openalex.org/W2962840086","https://openalex.org/W2963596156","https://openalex.org/W2963649943","https://openalex.org/W2963940890","https://openalex.org/W2964017936","https://openalex.org/W4230471307","https://openalex.org/W6730260407","https://openalex.org/W6742146140"],"related_works":[],"abstract_inverted_index":{"In":[0,71],"this":[1],"letter,":[2],"we":[3,73,102],"study":[4],"distributed":[5],"optimization,":[6],"where":[7],"a":[8,14,75,85,115],"network":[9],"of":[10,22,28,55],"agents,":[11],"abstracted":[12],"as":[13],"directed":[15,33],"graph,":[16],"collaborates":[17],"to":[18,46,110,122],"minimize":[19],"the":[20,29,50,56,69,90,105,111,124],"average":[21],"locally":[23],"known":[24],"convex":[25,98],"functions.":[26],"Most":[27],"existing":[30],"approaches":[31],"over":[32],"graphs":[34],"are":[35],"based":[36,78],"on":[37,79],"push-sum":[38],"(type)":[39],"techniques,":[40],"which":[41],"use":[42],"an":[43,80],"independent":[44],"algorithm":[45,77,107],"asymptotically":[47],"learn":[48],"either":[49],"left":[51],"or":[52],"right":[53],"eigenvector":[54],"underlying":[57],"weight":[58],"matrices.":[59],"This":[60],"strategy":[61],"causes":[62],"additional":[63],"computation,":[64],"communication,":[65],"and":[66,84],"nonlinearity":[67],"in":[68],"algorithm.":[70],"contrast,":[72],"propose":[74],"linear":[76],"inexact":[81],"gradient":[82,86],"method":[83],"estimation":[87],"technique.":[88],"Under":[89],"assumptions":[91],"that":[92,104],"each":[93],"local":[94],"function":[95],"is":[96],"strongly":[97],"with":[99,114],"Lipschitz-continuous":[100],"gradients,":[101],"show":[103],"proposed":[106],"geometrically":[108],"converges":[109],"global":[112],"minimizer":[113],"sufficiently":[116],"small":[117],"step-size.":[118],"We":[119],"present":[120],"simulations":[121],"illustrate":[123],"theoretical":[125],"findings.":[126]},"counts_by_year":[{"year":2026,"cited_by_count":7},{"year":2025,"cited_by_count":31},{"year":2024,"cited_by_count":34},{"year":2023,"cited_by_count":39},{"year":2022,"cited_by_count":38},{"year":2021,"cited_by_count":19},{"year":2020,"cited_by_count":40},{"year":2019,"cited_by_count":20},{"year":2018,"cited_by_count":3}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2018-03-29T00:00:00"}