{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T19:47:27Z","timestamp":1780602447981,"version":"3.54.1"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1109\/tsp.2020.2997394","type":"journal-article","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T20:17:55Z","timestamp":1590697075000},"page":"3296-3311","source":"Crossref","is-referenced-by-count":22,"title":["Decentralized Multi-Agent Stochastic Optimization With Pairwise Constraints and Quantized Communications"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0190-4362","authenticated-orcid":false,"given":"Xuanyu","family":"Cao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4406-7875","authenticated-orcid":false,"given":"Tamer","family":"Basar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"385","article-title":"Online convex optimization in the bandit setting: Gradient descent without a gradient","author":"flaxman","year":"0","journal-title":"Proc 16th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2884653"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2308612"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TAC.2011.2167817","article-title":"On distributed convex optimization under inequality and equality constraints","volume":"57","author":"zhu","year":"2012","journal-title":"IEEE Trans Autom Control"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-009-9522-7"},{"key":"ref30","author":"arrow","year":"1958","journal-title":"Studies in Linear and Non-linear Programming"},{"key":"ref37","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":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2750109"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2908906"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2662019"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2932876"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2884998"},{"key":"ref29","first-page":"3478","article-title":"Decentralized stochastic optimization and gossip algorithms with compressed communication","author":"koloskova","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/130943170"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843546"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2012.06.004"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2008.4738860"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472455"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2504341"},{"key":"ref26","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","author":"alistarh","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2600597"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2797164"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2018.2823901"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2519894"},{"key":"ref53","author":"rudin","year":"1964","journal-title":"Principles of Mathematical Analysis"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2019.2945864"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2014.2363554"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2449255"},{"key":"ref40","first-page":"28","article-title":"Optimal algorithms for online convex optimization with multi-point bandit feedback","author":"agarwal","year":"2010","journal-title":"Proc 23rd Annu Conf Learn Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2015.2505149"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2333560"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2518991"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2686368"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2894803"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2031203"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2530939"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2007.01.002"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2298712"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2161027"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2304432"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1109\/JSTSP.2011.2118740","article-title":"Distributed asynchronous constrained stochastic optimization","volume":"5","author":"nedic","year":"2011","journal-title":"IEEE J Sel Topics Signal Process"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1007\/s10957-010-9737-7","article-title":"Distributed stochastic subgradient projection algorithms for convex optimization","volume":"147","author":"ram","year":"2010","journal-title":"J Optim Theory Appl"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919690"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1355-4"},{"key":"ref46","first-page":"7202","article-title":"ZO-AdaMM: Zeroth-order adaptive momentum method for black-box optimization","author":"chen","year":"0","journal-title":"Proc Conf Workshop Neural Inf Process Syst"},{"key":"ref45","first-page":"3727","article-title":"Zeroth-order stochastic variance reduction for nonconvex optimization","author":"liu","year":"0","journal-title":"Proc Conf Workshop Neural Inf Process Syst"},{"key":"ref48","first-page":"4951","article-title":"Distributed zeroth order optimization over random networks: A Kiefer-Wolfowitz stochastic approximation approach","author":"sahu","year":"0","journal-title":"Proc IEEE Conf Decis Control"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2896025"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/16M1059011"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2294614"},{"key":"ref44","first-page":"1","article-title":"An optimal algorithm for bandit and zero-order convex optimization with two-point feedback","volume":"18","author":"shamir","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2409256"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8933520\/09103200.pdf?arnumber=9103200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:41:18Z","timestamp":1651070478000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9103200\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":54,"URL":"https:\/\/doi.org\/10.1109\/tsp.2020.2997394","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}