{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T16:53:03Z","timestamp":1783183983002,"version":"3.54.6"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2022YFB3305904"],"award-info":[{"award-number":["2022YFB3305904"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62133003"],"award-info":[{"award-number":["62133003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62325304"],"award-info":[{"award-number":["62325304"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U22B2046"],"award-info":[{"award-number":["U22B2046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U24A20279"],"award-info":[{"award-number":["U24A20279"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Jiangsu Provincial Scientific Research Center of Applied Mathematics","award":["BK20233002"],"award-info":[{"award-number":["BK20233002"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Control Netw. Syst."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1109\/tcns.2025.3608004","type":"journal-article","created":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T17:33:45Z","timestamp":1757439225000},"page":"3062-3072","source":"Crossref","is-referenced-by-count":2,"title":["One-Point Sampling for Distributed Bandit Convex Optimization With Time-Varying Constraints"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5511-3174","authenticated-orcid":false,"given":"Kunpeng","family":"Zhang","sequence":"first","affiliation":[{"name":"State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4753-4774","authenticated-orcid":false,"given":"Lei","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering, University of Victoria, Victoria, BC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4299-0471","authenticated-orcid":false,"given":"Xinlei","family":"Yi","sequence":"additional","affiliation":[{"name":"Department of Control Science and Engineering, College of Electronics and Information Engineering, Tongji University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0070-8597","authenticated-orcid":false,"given":"Guanghui","family":"Wen","sequence":"additional","affiliation":[{"name":"School of Automation, Southeast University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7137-4136","authenticated-orcid":false,"given":"Lihua","family":"Xie","sequence":"additional","affiliation":[{"name":"School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4623-1483","authenticated-orcid":false,"given":"Tianyou","family":"Chai","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4090-8497","authenticated-orcid":false,"given":"Tao","family":"Yang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680831719"},{"key":"ref2","first-page":"385","article-title":"Online convex optimization in the bandit setting: Gradient descent without a gradient","volume-title":"Proc. 16th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Flaxman","year":"2005"},{"key":"ref3","first-page":"345","article-title":"The price of bandit information for online optimization","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Dani","year":"2008"},{"key":"ref4","first-page":"263","article-title":"Competing in the dark: An efficient algorithm for bandit linear optimization","volume-title":"Proc. Annu. Conf. Learn. Theory","author":"Abernethy","year":"2009"},{"key":"ref5","first-page":"636","article-title":"Improved regret guarantees for online smooth convex optimization with bandit feedback","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Saha","year":"2011"},{"key":"ref6","first-page":"784","article-title":"Bandit convex optimization: Towards tight bounds","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Hazan","year":"2014"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2409256"},{"key":"ref8","first-page":"449","article-title":"Tracking slowly moving clairvoyant: Optimal dynamic regret of online learning with true and noisy gradient","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yang","year":"2016"},{"issue":"1","key":"ref9","first-page":"1703","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":"ref10","first-page":"28","article-title":"Optimal algorithms for online convex optimization with multi-point bandit feedback","volume-title":"Proc. Annu. Conf. Learn. Theory","author":"Agarwal","year":"2010"},{"key":"ref11","article-title":"Minimizing regret of bandit online optimization in unconstrained action spaces","author":"Tatarenko","year":"2018"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2019.2921593"},{"key":"ref13","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zinkevich","year":"2003"},{"issue":"1","key":"ref14","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":"ref15","first-page":"6140","article-title":"Online convex optimization for cumulative constraints","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Yuan","year":"2018"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2839563"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2884653"},{"key":"ref18","first-page":"6426","article-title":"Online convex optimization with hard constraints: Towards the best of two worlds and beyond","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Guo","year":"2022"},{"key":"ref19","first-page":"8","article-title":"Regret and cumulative constraint violation analysis for online convex optimization with long term constraints","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"11","author":"Yi","year":"2021"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-060117-105131"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2999309"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3044843"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3093536"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2987379"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029304"},{"key":"ref26","first-page":"34492","article-title":"Distributed online convex optimization with compressed communication","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Tu","year":"2022"},{"key":"ref27","article-title":"Distributed online and bandit convex optimization","volume-title":"Proc. Int. OPT Workshop Optim. Mach. Learn.","author":"Patel","year":"2022"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2023.127865"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2021.3057601"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2022.3230766"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2025.3608004"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3030883"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2024.3471330"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2025.3560099"}],"container-title":["IEEE Transactions on Control of Network Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6509490\/11315888\/11153802.pdf?arnumber=11153802","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T20:56:47Z","timestamp":1770843407000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11153802\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":34,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tcns.2025.3608004","relation":{},"ISSN":["2325-5870","2372-2533"],"issn-type":[{"value":"2325-5870","type":"electronic"},{"value":"2372-2533","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12]]}}}