{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T16:21:40Z","timestamp":1781194900206,"version":"3.54.1"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-17-2-0196"],"award-info":[{"award-number":["W911NF-17-2-0196"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tsp.2022.3185897","type":"journal-article","created":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T19:34:29Z","timestamp":1656099269000},"page":"3468-3483","source":"Crossref","is-referenced-by-count":18,"title":["Distributed Constrained Online Convex Optimization Over Multiple Access Fading Channels"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0190-4362","authenticated-orcid":false,"given":"Xuanyu","family":"Cao","sequence":"first","affiliation":[{"name":"Department of Electronic and Computer Engineering, The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4406-7875","authenticated-orcid":false,"given":"Tamer","family":"Basar","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680831719"},{"key":"ref2","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","volume-title":"Proc. 20th Int. Conf. Mach. Learn.","author":"Zinkevich","year":"2003"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2404790"},{"key":"ref5","first-page":"385","article-title":"Online convex optimization in the bandit setting: Gradient descent without a gradient","volume-title":"Proc. 16th ACM-SIAM Symp. Discrete Algorithms","author":"Flaxman","year":"2005"},{"key":"ref6","first-page":"28","article-title":"Optimal algorithms for online convex optimization with multi-point bandit feedback","volume-title":"Proc. Conf. Learn. Theory","author":"Agarwal","year":"2010"},{"issue":"1","key":"ref7","first-page":"2503","article-title":"Trading regret for efficiency: Online convex optimization with long term constraints","volume":"13","author":"Mahdavi","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2750109"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2627401"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2884653"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2449255"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2014.2363554"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.191"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2015.2505149"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3044843"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2021.109676"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3090323"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2989580"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2024789118"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2961673"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2981904"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.2974748"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3024629"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3037554"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3042530"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3126060"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3041388"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2022.3140788"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2946245"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9675017\/09806334.pdf?arnumber=9806334","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T03:48:07Z","timestamp":1706759287000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9806334\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/tsp.2022.3185897","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}