{"id":"https://openalex.org/W2963515790","doi":"https://doi.org/10.1109/tnse.2017.2713396","title":"Stochastic Subgradient Algorithms for Strongly Convex Optimization Over Distributed Networks","display_name":"Stochastic Subgradient Algorithms for Strongly Convex Optimization Over Distributed Networks","publication_year":2017,"publication_date":"2017-06-08","ids":{"openalex":"https://openalex.org/W2963515790","doi":"https://doi.org/10.1109/tnse.2017.2713396","mag":"2963515790"},"language":"en","primary_location":{"id":"doi:10.1109/tnse.2017.2713396","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnse.2017.2713396","pdf_url":null,"source":{"id":"https://openalex.org/S2484352698","display_name":"IEEE Transactions on Network Science and Engineering","issn_l":"2327-4697","issn":["2327-4697","2334-329X"],"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 Network Science and Engineering","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/A5081851582","display_name":"Muhammed O. Sayin","orcid":"https://orcid.org/0000-0001-5779-3986"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Muhammed O. Sayin","raw_affiliation_strings":["Coordinated Science Laboratory, University of Illinois at Urbana-Champaign (UIUC), Urbana, IL"],"raw_orcid":"https://orcid.org/0000-0001-5779-3986","affiliations":[{"raw_affiliation_string":"Coordinated Science Laboratory, University of Illinois at Urbana-Champaign (UIUC), Urbana, IL","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061392794","display_name":"N. Denizcan Vanli","orcid":"https://orcid.org/0000-0001-5271-8020"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"N. Denizcan Vanli","raw_affiliation_strings":["Laboratory for Information and Decision Systems, Massachusetts Institute of Technology (MIT), Cambridge, MA"],"raw_orcid":"https://orcid.org/0000-0001-5271-8020","affiliations":[{"raw_affiliation_string":"Laboratory for Information and Decision Systems, Massachusetts Institute of Technology (MIT), Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103267259","display_name":"S\u00fcleyman S. Kozat","orcid":"https://orcid.org/0000-0002-6488-3848"},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Suleyman S. Kozat","raw_affiliation_strings":["Department of Electrical and Electronics Engineering, Bilkent University, Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Bilkent University, Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019604570","display_name":"Tamer Ba\u015far","orcid":"https://orcid.org/0000-0003-4406-7875"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tamer Basar","raw_affiliation_strings":["Coordinated Science Laboratory, University of Illinois at Urbana-Champaign (UIUC), Urbana, IL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Coordinated Science Laboratory, University of Illinois at Urbana-Champaign (UIUC), Urbana, IL","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.6846,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.96999468,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"4","issue":"4","first_page":"248","last_page":"260"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9991999864578247,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9988999962806702,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9977999925613403,"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/subgradient-method","display_name":"Subgradient method","score":0.8086618781089783},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6126885414123535},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5985702276229858},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5394827127456665},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.5223130583763123},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.45837026834487915},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4583539068698883},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4530678391456604},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.4409123659133911},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4135447144508362},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4047284722328186},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3686731457710266},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2732483744621277},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2477090060710907}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.8086618781089783},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6126885414123535},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5985702276229858},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5394827127456665},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.5223130583763123},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.45837026834487915},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4583539068698883},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4530678391456604},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.4409123659133911},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4135447144508362},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4047284722328186},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3686731457710266},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2732483744621277},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2477090060710907},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tnse.2017.2713396","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnse.2017.2713396","pdf_url":null,"source":{"id":"https://openalex.org/S2484352698","display_name":"IEEE Transactions on Network Science and Engineering","issn_l":"2327-4697","issn":["2327-4697","2334-329X"],"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 Network Science and Engineering","raw_type":"journal-article"},{"id":"pmh:oai:repository.bilkent.edu.tr:11693/37101","is_oa":false,"landing_page_url":"http://hdl.handle.net/11693/37101","pdf_url":null,"source":{"id":"https://openalex.org/S4306400079","display_name":"Bilkent University Institutional Repository (Bilkent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I168864056","host_organization_name":"Bilkent University","host_organization_lineage":["https://openalex.org/I168864056"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Network Science and Engineering","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G750930579","display_name":null,"funder_award_id":"CCF 11-11342","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8325026323","display_name":null,"funder_award_id":"N00014-16-1-2710","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W391578156","https://openalex.org/W1534416612","https://openalex.org/W1600293573","https://openalex.org/W1701050018","https://openalex.org/W1903515055","https://openalex.org/W1966992934","https://openalex.org/W2002356046","https://openalex.org/W2007208291","https://openalex.org/W2024307985","https://openalex.org/W2029080014","https://openalex.org/W2042664989","https://openalex.org/W2044212084","https://openalex.org/W2051245758","https://openalex.org/W2052179119","https://openalex.org/W2066332749","https://openalex.org/W2075677880","https://openalex.org/W2080467172","https://openalex.org/W2086502731","https://openalex.org/W2093795816","https://openalex.org/W2096840748","https://openalex.org/W2106510159","https://openalex.org/W2106901427","https://openalex.org/W2112269233","https://openalex.org/W2112603423","https://openalex.org/W2118776392","https://openalex.org/W2121820607","https://openalex.org/W2129160848","https://openalex.org/W2130359405","https://openalex.org/W2135677363","https://openalex.org/W2148087609","https://openalex.org/W2149778463","https://openalex.org/W2151565294","https://openalex.org/W2151695970","https://openalex.org/W2154682027","https://openalex.org/W2156415659","https://openalex.org/W2159585070","https://openalex.org/W2295500362","https://openalex.org/W2750308350","https://openalex.org/W2962907301","https://openalex.org/W2963427711","https://openalex.org/W3101665129","https://openalex.org/W3101737857","https://openalex.org/W4238850922","https://openalex.org/W4297685995","https://openalex.org/W6637228341","https://openalex.org/W6676963778","https://openalex.org/W6680086414","https://openalex.org/W6682774789"],"related_works":["https://openalex.org/W2037613239","https://openalex.org/W2359120930","https://openalex.org/W2781777036","https://openalex.org/W2390469630","https://openalex.org/W4383814107","https://openalex.org/W4297153560","https://openalex.org/W2465405765","https://openalex.org/W2964186284","https://openalex.org/W2804400349","https://openalex.org/W4224283687"],"abstract_inverted_index":{"We":[0,68,189],"study":[1],"diffusion":[2],"and":[3,39,186],"consensus":[4],"based":[5,61],"optimization":[6,59],"of":[7,10,30,43,76,85,101,118,124,143,153,160,171,184,193],"a":[8,36,40,57,70,82,99],"sum":[9],"unknown":[11],"convex":[12,58],"objective":[13],"functions":[14,23],"over":[15,202],"distributed":[16],"networks.":[17],"The":[18],"only":[19,33],"access":[20],"to":[21,132,136,198],"these":[22],"is":[24,32,47,164,179],"through":[25],"stochastic":[26,63],"gradient":[27,44,93],"oracles,":[28],"each":[29,50,96],"which":[31,80],"available":[34],"at":[35,49],"different":[37],"node;":[38],"limited":[41],"number":[42],"oracle":[45],"calls":[46],"allowed":[48],"node.":[51],"In":[52],"this":[53],"framework,":[54],"we":[55],"introduce":[56],"algorithm":[60,146,178,195],"on":[62,98],"subgradient":[64],"descent":[65],"(SSD)":[66],"updates.":[67],"use":[69],"carefully":[71],"designed":[72],"time-dependent":[73],"weighted":[74],"averaging":[75],"the":[77,113,119,127,137,140,144,151,154,157,161,165,168,172,176,191,194,199],"SSD":[78,138,173],"iterates,":[79],"yields":[81],"convergence":[83,125],"rate":[84,123],"<inline-formula>":[86,90,102],"<tex-math":[87,91,103],"notation=\"LaTeX\">$O\\left(\\frac{N\\sqrt{N}}{(1-\\sigma)T}\\right)$</tex-math></inline-formula>":[88],"after":[89],"notation=\"LaTeX\">$T$</tex-math></inline-formula>":[92],"updates":[94],"for":[95],"node":[97],"network":[100],"notation=\"LaTeX\">$N$</tex-math></inline-formula>":[104],"nodes,":[105],"where":[106],"<inline-formula><tex-math":[107],"notation=\"LaTeX\">$0\\leq":[108],"\\sigma":[109],"&lt;1$</tex-math>":[110],"</inline-formula>":[111],"denotes":[112],"second":[114],"largest":[115],"singular":[116],"value":[117],"communication":[120,158,169,187],"matrix.":[121],"This":[122],"matches":[126],"performance":[128],"lower":[129],"bound":[130],"up":[131],"constant":[133],"terms.":[134],"Similar":[135],"algorithm,":[139],"computational":[141],"complexity":[142,185],"proposed":[145,162,177],"also":[147],"scales":[148],"linearly":[149],"with":[150,196],"dimensionality":[152],"data.":[155],"Furthermore,":[156],"load":[159,170],"method":[163],"same":[166],"as":[167],"algorithm.":[174],"Thus,":[175],"highly":[180],"efficient":[181],"in":[182],"terms":[183],"load.":[188],"illustrate":[190],"merits":[192],"respect":[197],"state-of-art":[200],"methods":[201],"benchmark":[203],"real":[204],"life":[205],"data":[206],"sets.":[207]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":6}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}
