{"id":"https://openalex.org/W2136835582","doi":"https://doi.org/10.1109/acc.2011.5991212","title":"Decentralized Online Convex Programming with local information","display_name":"Decentralized Online Convex Programming with local information","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2136835582","doi":"https://doi.org/10.1109/acc.2011.5991212","mag":"2136835582"},"language":"en","primary_location":{"id":"doi:10.1109/acc.2011.5991212","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2011.5991212","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 American Control Conference","raw_type":"proceedings-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/A5044844161","display_name":"Maxim Raginsky","orcid":"https://orcid.org/0000-0002-5586-9219"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Maxim Raginsky","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA","Dept. of Electrical and Computer Engineering, Duke University, Durham, NC 27708, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, Duke University, Durham, NC 27708, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075068599","display_name":"Nooshin Kiarashi","orcid":null},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nooshin Kiarashi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA","Dept. of Electrical and Computer Engineering, Duke University, Durham, NC 27708, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, Duke University, Durham, NC 27708, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061121471","display_name":"Rebecca Willett","orcid":"https://orcid.org/0000-0002-8109-7582"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rebecca Willett","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA","Dept. of Electrical and Computer Engineering, Duke University, Durham, NC 27708, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, Duke University, Durham, NC 27708, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5044844161"],"corresponding_institution_ids":["https://openalex.org/I170897317"],"apc_list":null,"apc_paid":null,"fwci":2.5401,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.89876743,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"5363","last_page":"5369"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9986000061035156,"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/T12288","display_name":"Optimization and Search Problems","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/regret","display_name":"Regret","score":0.7247215509414673},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7226390242576599},{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.7134875655174255},{"id":"https://openalex.org/keywords/hindsight-bias","display_name":"Hindsight bias","score":0.7010469436645508},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6128270626068115},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5097074508666992},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.503351628780365},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.48129597306251526},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4234096109867096},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.42323824763298035},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3848423957824707},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.23849618434906006},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13508769869804382},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1162990927696228},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.09950804710388184},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09012413024902344}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7247215509414673},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7226390242576599},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.7134875655174255},{"id":"https://openalex.org/C10347200","wikidata":"https://www.wikidata.org/wiki/Q1960297","display_name":"Hindsight bias","level":2,"score":0.7010469436645508},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6128270626068115},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5097074508666992},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.503351628780365},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.48129597306251526},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4234096109867096},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.42323824763298035},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3848423957824707},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.23849618434906006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13508769869804382},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1162990927696228},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.09950804710388184},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09012413024902344},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C180747234","wikidata":"https://www.wikidata.org/wiki/Q23373","display_name":"Cognitive psychology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/acc.2011.5991212","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2011.5991212","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 American Control Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.676.8245","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.676.8245","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://willett.ece.wisc.edu/resources/raginsky_kiarashi_willett_ACC2011.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7900000214576721}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W60189517","https://openalex.org/W1529558080","https://openalex.org/W1547358136","https://openalex.org/W1570963478","https://openalex.org/W2010654234","https://openalex.org/W2044212084","https://openalex.org/W2052930177","https://openalex.org/W2075942626","https://openalex.org/W2096199223","https://openalex.org/W2115118348","https://openalex.org/W2124541940","https://openalex.org/W2133081350","https://openalex.org/W2148825261","https://openalex.org/W2154834860","https://openalex.org/W2156216606","https://openalex.org/W2953357783","https://openalex.org/W3101665129","https://openalex.org/W6602391300","https://openalex.org/W6681723013"],"related_works":["https://openalex.org/W3197854638","https://openalex.org/W3140454661","https://openalex.org/W4245029315","https://openalex.org/W2139970489","https://openalex.org/W1492315459","https://openalex.org/W1512434910","https://openalex.org/W2540910169","https://openalex.org/W3089780453","https://openalex.org/W3148904318","https://openalex.org/W2998446700"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"a":[3,11,22,31,123],"novel":[4],"approach":[5],"to":[6,41,64,71,117],"decentralized":[7,130],"online":[8],"optimization":[9,127],"in":[10,55,102],"large":[12],"network":[13,119],"of":[14,30,67],"agents.":[15],"At":[16],"each":[17,35],"stage,":[18],"the":[19,28,65,82,85,94,106],"agents":[20],"face":[21],"new":[23],"objective":[24],"function":[25],"that":[26,97],"reflects":[27],"effects":[29],"changing":[32],"environment,":[33],"and":[34,44,93,114],"agent":[36],"can":[37],"share":[38],"information":[39,92,108],"pertaining":[40],"past":[42],"decisions":[43],"cost":[45,87,96],"functions":[46],"only":[47],"with":[48,129],"his":[49],"neighbors.":[50],"These":[51],"operating":[52],"conditions":[53],"arise":[54],"many":[56],"practical":[57],"applications,":[58],"but":[59],"introduce":[60],"challenging":[61],"questions":[62],"related":[63],"performance":[66],"distributed":[68],"strategies":[69],"relative":[70],"impractical":[72],"centralized":[73],"approaches.":[74],"The":[75],"proposed":[76],"algorithm":[77],"yields":[78],"small":[79],"regret":[80],"(i.e.,":[81],"difference":[83],"between":[84],"total":[86,95],"incurred":[88,101],"using":[89],"causally":[90],"available":[91,110],"would":[98],"have":[99],"been":[100,109],"hindsight":[103],"had":[104],"all":[105,111],"relevant":[107],"at":[112],"once)":[113],"is":[115],"robust":[116],"evolving":[118],"topologies.":[120],"It":[121],"combines":[122],"subgradient-based":[124],"sequential":[125],"convex":[126],"scheme":[128],"decision-making":[131],"via":[132],"approximate":[133],"dynamic":[134],"programming.":[135]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}