{"id":"https://openalex.org/W2967223162","doi":"https://doi.org/10.1080/10556788.2019.1637433","title":"Adaptive online distributed optimization in dynamic environments","display_name":"Adaptive online distributed optimization in dynamic environments","publication_year":2019,"publication_date":"2019-08-12","ids":{"openalex":"https://openalex.org/W2967223162","doi":"https://doi.org/10.1080/10556788.2019.1637433","mag":"2967223162"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2019.1637433","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2019.1637433","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5038060953","display_name":"Parvin Nazari","orcid":"https://orcid.org/0000-0003-3435-6219"},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Parvin Nazari","raw_affiliation_strings":["Department of Mathematics & Computer Science, Amirkabir University of Technology, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics & Computer Science, Amirkabir University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I158248296"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055305384","display_name":"Esmaeil Khorram","orcid":null},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Esmaeil Khorram","raw_affiliation_strings":["Department of Mathematics & Computer Science, Amirkabir University of Technology, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics & Computer Science, Amirkabir University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I158248296"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014974115","display_name":"Davoud Ataee Tarzanagh","orcid":"https://orcid.org/0000-0003-1267-3889"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Davoud Ataee Tarzanagh","raw_affiliation_strings":["Department of Mathematics, University of Florida, Gainesville, FL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Florida, Gainesville, FL, USA","institution_ids":["https://openalex.org/I33213144"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5014974115"],"corresponding_institution_ids":["https://openalex.org/I33213144"],"apc_list":null,"apc_paid":null,"fwci":0.8843,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.76727222,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"36","issue":"5","first_page":"973","last_page":"997"},"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.9998000264167786,"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.9998000264167786,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.992900013923645,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9898999929428101,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.8342593908309937},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6907526254653931},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.6652090549468994},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6478776335716248},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5786300301551819},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5261787176132202},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5120044350624084},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5048585534095764},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4581214189529419},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45754191279411316},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.42472490668296814},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.33153554797172546},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25864607095718384},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11517250537872314},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.07837095856666565}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8342593908309937},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6907526254653931},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.6652090549468994},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6478776335716248},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5786300301551819},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5261787176132202},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5120044350624084},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5048585534095764},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4581214189529419},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45754191279411316},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.42472490668296814},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.33153554797172546},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25864607095718384},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11517250537872314},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.07837095856666565},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2019.1637433","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2019.1637433","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1117774183","https://openalex.org/W1571416372","https://openalex.org/W1616857247","https://openalex.org/W1974661392","https://openalex.org/W1979289676","https://openalex.org/W2016384870","https://openalex.org/W2020887976","https://openalex.org/W2020909452","https://openalex.org/W2024233567","https://openalex.org/W2044212084","https://openalex.org/W2097380742","https://openalex.org/W2107915509","https://openalex.org/W2117412539","https://openalex.org/W2121217729","https://openalex.org/W2134711723","https://openalex.org/W2144244418","https://openalex.org/W2146502635","https://openalex.org/W2154834860","https://openalex.org/W2162195727","https://openalex.org/W2165519686","https://openalex.org/W2171978417","https://openalex.org/W2591151878","https://openalex.org/W2951777528","https://openalex.org/W2962806981","https://openalex.org/W2963127789","https://openalex.org/W2963732316","https://openalex.org/W2964309292","https://openalex.org/W3123456921","https://openalex.org/W3123661679","https://openalex.org/W6846889679"],"related_works":["https://openalex.org/W2912909874","https://openalex.org/W4288573727","https://openalex.org/W2768754015","https://openalex.org/W2981448761","https://openalex.org/W2393350255","https://openalex.org/W257189624","https://openalex.org/W2356369451","https://openalex.org/W4390176194","https://openalex.org/W4297903463","https://openalex.org/W3153752017"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,16,26,60,101,122],"dynamic":[4,57,89,138],"regret":[5,58,90,144],"analysis":[6],"on":[7,131],"the":[8,34,46,56,69,72,76,79,88,97,117,132,137,162,167,170],"decentralized":[9,61,126],"online":[10],"convex":[11],"optimization":[12],"problems":[13],"computed":[14],"over":[15],"network":[17],"of":[18,36,48,59,71,103,111,116,125,150,169],"agents.":[19],"The":[20],"goal":[21],"is":[22],"to":[23,99],"distributively":[24],"optimize":[25],"global":[27],"function":[28],"which":[29],"can":[30,64,91],"be":[31,65,92],"decomposed":[32],"into":[33],"summation":[35],"local":[37],"cost":[38,49],"functions":[39,152],"associated":[40],"with":[41],"each":[42],"agent.":[43],"By":[44],"exploiting":[45],"convexity":[47],"functions,":[50],"previous":[51],"studies":[52],"have":[53],"shown":[54],"that":[55,87,142],"gradient-based":[62],"algorithm":[63],"upper":[66],"bounded":[67],"by":[68,95],"path-length":[70],"comparator":[73],"sequence":[74],"and":[75,107,113,127,140,165],"connectivity":[77],"in":[78,136,174],"underlying":[80],"network.":[81],"In":[82],"this":[83],"paper,":[84],"we":[85,120],"illustrate":[86],"further":[93],"improved":[94],"allowing":[96],"learner":[98],"use":[100],"class":[102,124],"adaptive":[104,133],"search":[105],"directions":[106],"step-sizes":[108],"from":[109],"estimates":[110],"first":[112],"second":[114],"moments":[115],"gradients.":[118],"Specifically,":[119],"develop":[121],"new":[123,171],"stochastic":[128],"algorithms":[129],"based":[130],"gradient":[134],"method":[135,173],"environment":[139],"show":[141],"their":[143],"bounds":[145],"for":[146],"certain":[147],"realistic":[148],"classes":[149],"loss":[151],"are":[153],"considerably":[154],"better":[155],"than":[156],"existing":[157],"bounds.":[158],"Numerical":[159],"simulations":[160],"verify":[161],"theoretical":[163],"results":[164],"demonstrate":[166],"efficiency":[168],"proposed":[172],"practice.":[175]},"counts_by_year":[{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}