[1] [1] YANG T, YI X, WU J, et al. A survey of distributed optimization[J]. Annual Reviews in Control, 2019, 47：278-305.

[2] [2] NEDIC A, OZDAGLAR A. Distributed subgradient methods for multi-agent optimization[J]. IEEE Transactions on Automatic Control, 2009, 540（1）：48-61.

[3] [3] NEDIC A, OZDAGLAR A, PARRILO P A. Constrained consensus and optimization in multi-agent networks [J]. IEEE Transactions on Automatic Control, 2010, 550（4）：922-938.

[4] [4] DUCHI J C, AGARWAL A, WAINWRIGHT M J. Dual averaging for distributed optimization：Convergence analysis and network scaling[J]. IEEE Transactions on Automatic Control, 2011, 570（3）：592-606.

[5] [5] LI H, FANG C, LIN Z. Accelerated first-order optimization algorithms for machine learning[J]. Proceedings of the IEEE, 2020, 1080（11）：2067-2082.

[6] [6] YUAN D, XU S, ZHAO H, et al. Distributed dual averaging method for multi-agent optimization with quantized communication[J]. Systems & Control Letters, 2012, 610（11）：1053-1061.

[7] [7] YI P, HONG Y. Quantized subgradient algorithm and data-rate analysis for distributed optimization[J]. IEEE Transactions on Control of Network Systems, 2014, 10（4）：380-392.

[8] [8] LI J, CHEN G, WU Z, et al. Distributed subgradient method for multi-agent optimization with quantized communication[J]. Mathematical Methods in the Applied Sciences, 2017, 400（4）：1201-1213.

[9] [9] LI H, HUANG C, CHEN G, et al. Distributed consensus optimization in multiagent networks with time-varying directed topologies and quantized communication[J]. IEEE Transactions on Cybernetics, 2017, 470（8）：2044-2057.

[10] [10] XIONG Y, WU L, YOU K, et al. Quantized distributed gradient tracking algorithm with linear convergence in directed networks[J]. IEEE Transactions on Automatic Control, 2023, 680（9）：5368-5645.

[11] [11] XIONG M H, ZHANG B Y, YUAN D M, et al. Distributed quantized mirror descent for strongly convex optimization over time-varying directed graph[J]. Science China Information Sciences, 2022, 650（10）：202202.

[12] [12] LIU J, YU Z, HO D W C. Distributed constrained optimization with delayed subgradient information over time-varying network under adaptive quantization[J]. IEEE Transactions on Neural Networks and Learning Systems, 2024, 350（1）：143-156.

[13] [13] BREGMAN L M. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming[J]. USSR Computational Mathematics and Mathematical Physics, 1967, 70（3）：200-217.

[14] [14] BECK A, TEBOULLE M. Mirror descent and nonlinear projected subgradient methods for convex optimization[J]. Operations Research Letters, 2003, 310（3）：167-175.

[15] [15] YUAN D, ZHANG B, HO D W, et al. Distributed online bandit optimization under random quantization[J]. Automatica, 2022, 146：110590.

[16] [16] SURESH A T, FELIX X Y, KUMAR S, et al. Distributed mean estimation with limited communication[C]//34th International Conference on Machine Learning, 2017：3329-3337.

[17] [17] KOLOSKOVA A, STICH S, JAGGI M. Decentralized stochastic optimization and gossip algorithms with compressed communication[C]//36th International Conference on Machine Learning, 2019：3478-3487.

[18] [18] NEDIC A, OLSHEVSKY A, OZDGLAR A, et al. Distributed subgradient methods and quantization effects [C]//47th IEEE Conference on Decision and Control, 2008：4177-4184.

[19] [19] BUBECK S. Convex optimization：Algorithms and complexity[J]. Foundations and Trends in Machine Learning, 2015, 80（3/4）：231-357.

[20] [20] BECK A. First-order Methods in Optimization[M]. Philadelphia：SIAM, 2017.

[21] [21] HAZAN E. Introduction to online convex optimization[J]. Foundations and Trends in Optimization, 2016, 20（3/4）：157-325.

[22] [22] BOYD S, VANDENBERGHE L. Convex Optimization[M]. New York：Cambridge University Press, 2004.