{"id":"https://openalex.org/W7097467255","doi":null,"title":"Distributed Subgradient Methods over Random Networks","display_name":"Distributed Subgradient Methods over Random Networks","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7097467255"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.421.1456","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.421.1456","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/asuman/www/documents/diststoch-optimv10.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7097467255"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5079438376","display_name":"Ilan Lobel","orcid":"https://orcid.org/0000-0002-5396-8117","observed_orcids":["https://orcid.org/0000-0002-5396-8117"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ilan Lobel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5067307504","display_name":"Asuman Ozdaglar","orcid":"https://orcid.org/0000-0002-1827-1285","observed_orcids":["https://orcid.org/0000-0002-1827-1285"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Asuman Ozdaglar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10545","display_name":"Optimization and Variational Analysis","score":0.00019999999494757503,"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"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/distributed-optimization","display_name":"distributed optimization","score":0.8080000281333923},{"id":"https://openalex.org/keywords/subgradient-method","display_name":"subgradient method","score":0.8859999775886536},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"convex optimization","score":0.6209999918937683},{"id":"https://openalex.org/keywords/random-networks","display_name":"random networks","score":0.6200000047683716},{"id":"https://openalex.org/keywords/time-varying-topology","display_name":"time-varying topology","score":0.9639999866485596},{"id":"https://openalex.org/keywords/link-failure","display_name":"link failure","score":0.718999981880188},{"id":"https://openalex.org/keywords/averaging-algorithms","display_name":"averaging algorithms","score":0.9210000038146973},{"id":"https://openalex.org/keywords/convergence-analysis","display_name":"convergence analysis","score":0.6309999823570251},{"id":"https://openalex.org/keywords/convergence-rate","display_name":"convergence rate","score":0.8899999856948853},{"id":"https://openalex.org/keywords/multi-agent-systems","display_name":"multi-agent systems","score":0.6449999809265137}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.8892999887466431},{"id":"https://openalex.org/C141513077","wikidata":"https://www.wikidata.org/wiki/Q378542","display_name":"Independent and identically distributed random variables","level":3,"score":0.8385000228881836},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6039999723434448},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5979999899864197},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5117999911308289},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49880000948905945},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.48339998722076416},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4424999952316284},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.3952000141143799},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.387800008058548},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.3725000023841858},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3596000075340271},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.35760000348091125},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.31869998574256897},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.31619998812675476},{"id":"https://openalex.org/C95763700","wikidata":"https://www.wikidata.org/wiki/Q578985","display_name":"Convergence of random variables","level":3,"score":0.3149999976158142},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.30090001225471497},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.2802000045776367},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.2639999985694885}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.421.1456","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.421.1456","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/asuman/www/documents/diststoch-optimv10.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1556217901","https://openalex.org/W2106901427","https://openalex.org/W602135814","https://openalex.org/W2168803043","https://openalex.org/W7099670620","https://openalex.org/W4405599480","https://openalex.org/W4406012666","https://openalex.org/W2147063178","https://openalex.org/W2235438386","https://openalex.org/W4210629412"],"abstract_inverted_index":{"We":[0,22],"consider":[1],"the":[2,7,13,20,36,62,74,77,98,101],"problem":[3],"of":[4,9,19,76],"cooperatively":[5],"minimizing":[6],"sum":[8],"convex":[10],"functions,":[11],"where":[12],"functions":[14,18],"represent":[15],"local":[16,31],"objective":[17],"agents.":[21,63],"assume":[23,87],"that":[24,53,69,88,100],"each":[25],"agent":[26],"has":[27],"information":[28,60],"about":[29,73],"his":[30],"function,":[32],"and":[33,106,119],"communicate":[34],"with":[35],"other":[37],"agents":[38,78],"over":[39,109],"a":[40,49,93],"time-varying":[41],"network":[42],"topology.":[43],"For":[44],"this":[45],"problem,":[46],"we":[47,86,115],"propose":[48],"distributed":[50,108],"subgradient":[51,125],"method":[52],"uses":[54],"averaging":[55],"algorithms":[56],"for":[57,123],"locally":[58],"sharing":[59],"among":[61],"In":[64],"contrast":[65],"to":[66,92],"previous":[67],"works":[68],"make":[70],"worst-case":[71],"assumptions":[72],"connectivity":[75],"(such":[79],"as":[80],"bounded":[81],"communication":[82],"intervals":[83],"between":[84],"nodes),":[85],"links":[89],"fail":[90],"according":[91],"given":[94],"stochastic":[95],"process.":[96],"Under":[97],"assumption":[99],"link":[102],"failures":[103],"are":[104],"independent":[105],"identically":[107],"time":[110],"(possibly":[111],"correlated":[112],"across":[113],"links),":[114],"provide":[116],"convergence":[117,120],"results":[118],"rate":[121],"estimates":[122],"our":[124],"algorithm.":[126]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7097467255","counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2025-10-27T00:00:00"}
