{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T01:44:41Z","timestamp":1777340681789,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s11424-026-5394-2","type":"journal-article","created":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T00:03:18Z","timestamp":1777334598000},"page":"677-696","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Online Optimization with Switching Costs"],"prefix":"10.1007","volume":"39","author":[{"given":"Yang","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuxian","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lihua","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,28]]},"reference":[{"issue":"2","key":"5394_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1561\/2200000018","volume":"4","author":"S Shalev-Shwartz","year":"2012","unstructured":"Shalev-Shwartz S, Online learning and online convex optimization, Foundations and Trends in Machine Learning, 2012, 4(2): 107\u2013194.","journal-title":"Foundations and Trends in Machine Learning"},{"key":"5394_CR2","first-page":"1","volume-title":"Proceedings of the First ACM International Conference on AI in Finance","author":"E Vittori","year":"2020","unstructured":"Vittori E, De-Luca M B, Trov\u00f2 F, et al., Dealing with transaction costs in portfolio optimization: Online gradient descent with momentum, Proceedings of the First ACM International Conference on AI in Finance, 2020, 1\u20138."},{"issue":"10","key":"5394_CR3","doi-asserted-by":"publisher","first-page":"4761","DOI":"10.1109\/TAC.2020.3040249","volume":"66","author":"Y Y Li","year":"2020","unstructured":"Li Y Y, Qu G N, and Li N, Online optimization with predictions and switching costs: Fast algorithms and the fundamental limit, IEEE Transactions on Automatic Control, 2020, 66(10): 4761\u20134768.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"5394_CR4","first-page":"2104","volume-title":"American Control Conference","author":"Q S Liu","year":"2022","unstructured":"Liu Q S and Zhang Y Y, Optimal dynamic regret for online convex optimization with squared l2 norm switching cost, American Control Conference, 2022, 2104\u20132109."},{"issue":"6","key":"5394_CR5","doi-asserted-by":"publisher","first-page":"4297","DOI":"10.1016\/j.jfranklin.2023.02.013","volume":"360","author":"Y Y Zhang","year":"2023","unstructured":"Zhang Y Y, Liu Q S, Sun J, et al., The optimal dynamic regret for smoothed online convex optimization with squared l2 norm switching costs, Journal of the Franklin Institute, 2023, 360(6): 4297\u20134330.","journal-title":"Journal of the Franklin Institute"},{"key":"5394_CR6","first-page":"1","volume-title":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","author":"W C Pan","year":"2022","unstructured":"Pan W C, Shi G Y, Lin Y H, et al., Online optimization with feedback delay and nonlinear switching cost, Proceedings of the ACM on Measurement and Analysis of Computing Systems, 2022, 6: 1\u201334."},{"key":"5394_CR7","first-page":"2504","volume-title":"the 22nd International Conference on Artificial Intelligence and Statistics","author":"G Goel","year":"2019","unstructured":"Goel G and Wierman A, An online algorithm for smoothed regression and LQR control, the 22nd International Conference on Artificial Intelligence and Statistics, 2019, 2504\u20132513."},{"issue":"1","key":"5394_CR8","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1109\/TCNS.2016.2631452","volume":"5","author":"G Cofano","year":"2018","unstructured":"Cofano G, De-Cicco L, and Mascolo S, Modeling and design of adaptive video streaming control systems, IEEE Transactions on Control of Network Systems, 2018, 5(1): 548\u2013559.","journal-title":"IEEE Transactions on Control of Network Systems"},{"key":"5394_CR9","first-page":"5174","volume":"34","author":"Y H Lin","year":"2021","unstructured":"Lin Y H, Hu Y, Shi G Y, et al., Perturbation-based regret analysis of predictive control in linear time varying systems, Advances in Neural Information Processing Systems, 2021, 34: 5174\u20135185.","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"4","key":"5394_CR10","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1109\/TCNS.2016.2615158","volume":"4","author":"Y Abdallah","year":"2017","unstructured":"Abdallah Y, Zheng Z Z, Shroff N B, et al., The impact of stealthy attacks on smart grid performance: Tradeoffs and implications, IEEE Transactions on Control of Network Systems, 2017, 4(4): 886\u2013898.","journal-title":"IEEE Transactions on Control of Network Systems"},{"issue":"1","key":"5394_CR11","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/TCNS.2022.3141017","volume":"9","author":"N Dahlin","year":"2022","unstructured":"Dahlin N and Jain R, Scheduling flexible nonpreemptive loads in smart-grid networks, IEEE Transactions on Control of Network Systems, 2022, 9(1): 14\u201324.","journal-title":"IEEE Transactions on Control of Network Systems"},{"key":"5394_CR12","doi-asserted-by":"publisher","first-page":"100904","DOI":"10.1016\/j.arcontrol.2023.100904","volume":"56","author":"X X Li","year":"2023","unstructured":"Li X X, Xie L H, and Li N, A survey on distributed online optimization and online games, Annual Reviews in Control, 2023, 56: 100904.","journal-title":"Annual Reviews in Control"},{"issue":"2","key":"5394_CR13","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1287\/moor.2015.0742","volume":"41","author":"N Buchbinder","year":"2016","unstructured":"Buchbinder N, Chen S, Naor J S, et al., Unified algorithms for online learning and competitive analysis, Mathematics of Operations Research, 2016, 41(2): 612\u2013625.","journal-title":"Mathematics of Operations Research"},{"key":"5394_CR14","first-page":"1","volume-title":"International Green Computing Conference","author":"M H Lin","year":"2012","unstructured":"Lin M H, Liu Z H, Wierman A, et al., Online algorithms for geographical load balancing, International Green Computing Conference, 2012, 1\u201310."},{"key":"5394_CR15","first-page":"13599","volume":"17","author":"L J Zhang","year":"2021","unstructured":"Zhang L J, Jiang W, Lu S Y, et al., Revisiting smoothed online learning, Neural Information Processing Systems, 2021, 17: 13599\u201313612.","journal-title":"Neural Information Processing Systems"},{"key":"5394_CR16","first-page":"1","volume-title":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","author":"D Rutten","year":"2023","unstructured":"Rutten D, Christianson N, Mukherjee D, et al., Smoothed online optimization with unreliable predictions, Proceedings of the ACM on Measurement and Analysis of Computing Systems, 2023, 1\u201336."},{"issue":"3","key":"5394_CR17","doi-asserted-by":"publisher","first-page":"2391","DOI":"10.1109\/TNET.2024.3350990","volume":"32","author":"M Shi","year":"2024","unstructured":"Shi M, Lin X, and Jiao L, Combining regularization with look-ahead for competitive online convex optimization, IEEE\/ACM Transactions on Networking, 2024, 32(3): 2391\u20132405.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"3","key":"5394_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3375788","volume":"11","author":"Y W Zhao","year":"2020","unstructured":"Zhao Y W, Zhao Q, Zhang X X, et al., Understand dynamic regret with switching cost for online decision making, ACM Transactions on Intelligent Systems and Technology, 2020, 11(3): 1\u201321.","journal-title":"ACM Transactions on Intelligent Systems and Technology"},{"issue":"2","key":"5394_CR19","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1109\/TNET.2024.3495522","volume":"33","author":"Q S Liu","year":"2025","unstructured":"Liu Q S, Li Z R, and Fang Z X, Smoothed online decision making in communication: Algorithms and applications, IEEE\/ACM Transactions on Networking, 2025, 33(2): 463\u2013478.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"2","key":"5394_CR20","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1109\/TNET.2021.3053910","volume":"29","author":"M Shi","year":"2021","unstructured":"Shi M, Lin X J, and Fahmy S, Competitive online convex optimization with switching costs and ramp constraints, IEEE\/ACM Transactions on Networking, 2021, 29(2): 876\u2013889.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"1","key":"5394_CR21","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/3673660.3655074","volume":"52","author":"A Lechowicz","year":"2024","unstructured":"Lechowicz A, Christianson N, Sun B, et al., Online conversion with switching costs: Robust and learning-augmented algorithms, Performance Evaluation Review, 2024, 52(1): 45\u201346.","journal-title":"Performance Evaluation Review"},{"issue":"1","key":"5394_CR22","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1145\/2494232.2465533","volume":"41","author":"L Andrew","year":"2013","unstructured":"Andrew L, Barman S, Liggett K, et al., A tale of two metrics: Simultaneous bounds on competitiveness and regret, Performance Evaluation Review, 2013, 41(1): 329\u2013330.","journal-title":"Performance Evaluation Review"},{"issue":"4","key":"5394_CR23","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/3649477.3649490","volume":"51","author":"S Senapati","year":"2024","unstructured":"Senapati S and Vaze R, Online convex optimization with switching cost and delayed gradients, ACM SIGMETRICS Performance Evaluation Review, 2024, 51(4): 22\u201323.","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"5394_CR24","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1146\/annurev-control-060117-105131","volume":"1","author":"A Nedic","year":"2018","unstructured":"Nedic A and Liu J, Distributed optimization for control, Annual Review of Control, Robotics, and Autonomous Systems, 2018, 1: 77\u2013103.","journal-title":"Annual Review of Control, Robotics, and Autonomous Systems"},{"key":"5394_CR25","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.arcontrol.2019.05.006","volume":"47","author":"T Yang","year":"2019","unstructured":"Yang T, Yi X L, Wu J F, et al., A survey of distributed optimization, Annual Reviews in Control, 2019, 47: 278\u2013305.","journal-title":"Annual Reviews in Control"},{"key":"5394_CR26","doi-asserted-by":"publisher","first-page":"110259","DOI":"10.1016\/j.automatica.2022.110259","volume":"141","author":"L Li","year":"2022","unstructured":"Li L, Yu Y, Li X X, et al., Exponential convergence of distributed optimization for heterogeneous linear multi-agent systems over unbalanced digraphs, Automatica, 2022, 141: 110259.","journal-title":"Automatica"},{"issue":"3","key":"5394_CR27","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/TAC.2017.2743462","volume":"63","author":"S Shahrampour","year":"2018","unstructured":"Shahrampour S and Jadbabaie S, Distributed online optimization in dynamic environments using mirror descent, IEEE Transactions on Automatic Control, 2018, 63(3): 714\u2013725.","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"1","key":"5394_CR28","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1109\/TAC.2019.2915745","volume":"65","author":"K H Lu","year":"2020","unstructured":"Lu K H, Jing G S, and Wang L, Online distributed optimization with strongly pseudoconvex-sum cost functions, IEEE Transactions on Automatic Control, 2020, 65(1): 426\u2013433.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"5394_CR29","first-page":"637","volume-title":"Learning for Dynamics and Control Conference","author":"N Eshraghi","year":"2022","unstructured":"Eshraghi N and Liang B, Improving dynamic regret in distributed online mirror descent using primal and dual information, Learning for Dynamics and Control Conference, 2022, 637\u2013649."},{"key":"5394_CR30","first-page":"1752","volume-title":"IEEE 61st Conference on Decision and Control","author":"Y Yu","year":"2022","unstructured":"Yu Y, Li X X, Li L, et al., Continuous-time and event-triggered online optimization for linear multi-agent systems, IEEE 61st Conference on Decision and Control, 2022, 1752\u20131757."},{"issue":"5","key":"5394_CR31","doi-asserted-by":"publisher","first-page":"2875","DOI":"10.1109\/TAC.2022.3230766","volume":"68","author":"X L Yi","year":"2023","unstructured":"Yi X L, Li X X, Yang T, et al., Regret and cumulative constraint violation analysis for distributed online constrained convex optimization, IEEE Transactions on Automatic Control, 2023, 68(5): 2875\u20132890.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"5394_CR32","doi-asserted-by":"publisher","first-page":"111407","DOI":"10.1016\/j.automatica.2023.111407","volume":"159","author":"Y Yu","year":"2024","unstructured":"Yu Y, Li X X, Li L, et al., Distributed online optimization for heterogeneous linear multi-agent systems with coupled constraints, Automatica, 2024, 159: 111407.","journal-title":"Automatica"},{"issue":"2","key":"5394_CR33","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1109\/TCNS.2016.2524983","volume":"4","author":"G Oliva","year":"2017","unstructured":"Oliva G, Setola R, and Hadjicostis C N, Distributed finite-time average-consensus with limited computational and storage capability, IEEE Transactions on Control of Network Systems, 2017, 4(2): 380\u2013391.","journal-title":"IEEE Transactions on Control of Network Systems"},{"key":"5394_CR34","first-page":"711","volume-title":"American Control Conference","author":"S Sundaram","year":"2007","unstructured":"Sundaram S and Hadjicostis C N, Finite-time distributed consensus in graphs with time-invariant topologies, American Control Conference, 2007, 711\u2013716."},{"key":"5394_CR35","first-page":"5764","volume-title":"Chinese Control Conference","author":"Z H Qu","year":"2019","unstructured":"Qu Z H, Wu X Y, and Lu J, Finite-time-consensus-based methods for distributed optimization, Chinese Control Conference, 2019, 5764\u20135769."},{"issue":"5","key":"5394_CR36","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.1109\/TNET.2012.2226216","volume":"21","author":"M H Lin","year":"2013","unstructured":"Lin M H, Wierman A, Andrew L H, et al., Dynamic right-sizing for power-proportional data centers, IEEE\/ACM Transactions on Networking, 2013, 21(5): 1378\u20131391.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"5394_CR37","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1109\/TSP.2020.2964200","volume":"68","author":"X L Yi","year":"2020","unstructured":"Yi X L, Li X X, Xie L H, et al., Distributed online convex optimization with time-varying coupled inequality constraints, IEEE Transactions on Signal Processing, 2020, 68: 731\u2013746.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"4","key":"5394_CR38","doi-asserted-by":"publisher","first-page":"1840","DOI":"10.1109\/TAC.2020.2996178","volume":"66","author":"X Y Cao","year":"2020","unstructured":"Cao X Y, Zhang J S, and Poor H V, Online stochastic optimization with time-varying distributions, IEEE Transactions on Automatic Control, 2020, 66(4): 1840\u20131847.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"5394_CR39","first-page":"2104","volume-title":"American Control Conference","author":"Q S Liu","year":"2022","unstructured":"Liu Q S and Zhang Y Y, Optimal dynamic regret for online convex optimization with squared l2 norm switching cost, American Control Conference, 2022, 2104\u20132109."},{"issue":"4","key":"5394_CR40","doi-asserted-by":"publisher","first-page":"2597","DOI":"10.1137\/16M1084316","volume":"27","author":"A Nedic","year":"2017","unstructured":"Nedic A, Olshevsky A, and Shi W, Achieving geometric convergence for distributed optimization over time-varying graphs, SIAM Journal on Optimization, 2017, 27(4): 2597\u20132633.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"5394_CR41","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1109\/TCNS.2021.3107480","volume":"9","author":"X X Li","year":"2022","unstructured":"Li X X, Yi X L, and Xie L H, Distributed online convex optimization with an aggregative variable, IEEE Transactions on Control of Network Systems, 2022, 9(1): 438\u2013449.","journal-title":"IEEE Transactions on Control of Network Systems"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-026-5394-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11424-026-5394-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-026-5394-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T01:02:30Z","timestamp":1777338150000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11424-026-5394-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["5394"],"URL":"https:\/\/doi.org\/10.1007\/s11424-026-5394-2","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"8 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}