{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:41:47Z","timestamp":1761676907689,"version":"3.28.0"},"reference-count":34,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.23919\/acc45564.2020.9147354","type":"proceedings-article","created":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T18:02:33Z","timestamp":1595872953000},"page":"327-332","source":"Crossref","is-referenced-by-count":2,"title":["A Distributed Primal-Dual Algorithm for Bandit Online Convex Optimization with Time-Varying Coupled Inequality Constraints"],"prefix":"10.23919","author":[{"given":"Xinlei","family":"Yi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuxian","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lihua","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianyou","family":"Chai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karl H.","family":"Johansson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","article-title":"On the sublinear regret of distributed primal-dual algorithms for online constrained optimization","author":"lee","year":"2017","journal-title":"arXiv preprint arXiv 1705 11128"},{"key":"ref32","article-title":"Distributed online linear regression","author":"yuan","year":"2019","journal-title":"arXiv preprint arXiv 1902 05023"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ChiCC.2016.7554642"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2839563"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.23919\/ACC45564.2020.9147354"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2964200"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9296-2"},{"key":"ref12","first-page":"697","article-title":"Nearly tight bounds for the continuum-armed bandit problem","author":"kleinberg","year":"2005","journal-title":"Advances in neural information processing systems"},{"key":"ref13","first-page":"385","article-title":"Online convex optimization in the bandit setting: gradient descent without a gradient","author":"flaxman","year":"2005","journal-title":"Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms"},{"key":"ref14","first-page":"345","article-title":"The price of bandit information for online optimization","author":"dani","year":"2008","journal-title":"Advances in neural information processing systems"},{"key":"ref15","first-page":"263","article-title":"Competing in the dark: An efficient algorithm for bandit linear optimization","author":"abernethy","year":"2008","journal-title":"Conference on Learning Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2192096"},{"key":"ref17","first-page":"636","article-title":"Improved regret guarantees for online smooth convex optimization with bandit feedback","author":"saha","year":"2011","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref18","first-page":"784","article-title":"Bandit convex optimization: Towards tight bounds","author":"hazan","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref19","first-page":"266","article-title":"Bandit convex optimization: $\\sqrt T $ regret in one dimension","author":"bubeck","year":"2015","journal-title":"Conference on Learning Theory"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/LCSYS.2019.2921593","article-title":"Online optimization using zeroth order oracles","volume":"4","author":"shames","year":"2019","journal-title":"Systems & Control Letters"},{"key":"ref4","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"International Conference on Machine Learning"},{"key":"ref27","article-title":"Minimizing regret in bandit online optimization in unconstrained and constrained action spaces","author":"tatarenko","year":"2018","journal-title":"arXiv preprint arXiv 1806 05069"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/307400.307410"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"ref29","first-page":"2503","article-title":"Trading regret for efficiency: online convex optimization with long term constraints","volume":"13","author":"mahdavi","year":"2012","journal-title":"Journal of Machine Learning Research"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref8","first-page":"402","article-title":"Adaptive algorithms for online convex optimization with long-term constraints","author":"jenatton","year":"2016","journal-title":"International Conference on Machine Learning"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"ref2","first-page":"225","article-title":"Linear hinge loss and average margin","author":"gentile","year":"1999","journal-title":"Advances in neural information processing systems"},{"key":"ref9","first-page":"3280","article-title":"Safety-aware algorithms for adversarial contextual bandit","author":"sun","year":"2017","journal-title":"International Conference on Machine Learning"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/72.501719"},{"key":"ref20","first-page":"583","article-title":"Multi-scale exploration of convex functions and bandit convex optimization","author":"bubeck","year":"2016","journal-title":"Conference on Learning Theory"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1134\/S0005117917020035"},{"key":"ref21","article-title":"An optimal algorithm for bandit convex optimization","author":"hazan","year":"2016","journal-title":"arXiv preprint arXiv 1603 02895"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2409256"},{"key":"ref23","first-page":"28","article-title":"Optimal algorithms for online convex optimization with multi-point bandit feedback","author":"agarwal","year":"2010","journal-title":"Conference on Learning Theory"},{"key":"ref26","first-page":"449","article-title":"Tracking slowly moving clairvoyant: Optimal dynamic regret of online learning with true and noisy gradient","author":"yang","year":"2016","journal-title":"International Conference on Machine Learning"},{"key":"ref25","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":"Journal of Machine Learning Research"}],"event":{"name":"2020 American Control Conference (ACC)","start":{"date-parts":[[2020,7,1]]},"location":"Denver, CO, USA","end":{"date-parts":[[2020,7,3]]}},"container-title":["2020 American Control Conference (ACC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9140048\/9147203\/09147354.pdf?arnumber=9147354","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T17:47:22Z","timestamp":1598896042000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9147354\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":34,"URL":"https:\/\/doi.org\/10.23919\/acc45564.2020.9147354","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}