摘要
This paper uses the mirror descent algorithm with periodic dynamic quantization to solve constrained distributed optimization problems with limited communication channels. Due to the imperfect network environment, obtaining accurate information is impractical, and thus a communication scheme under quantization needs to be considered. A periodic dynamic quantizer with finite quantization levels is proposed in this paper to achieve exact optimization. Moreover, a time -varying control parameter in the mirror descent algorithm is designed to control the quantization error. After a comprehensive analysis, the proposed algorithm can obtain an optimal value, and the optimal convergence rate is O(1/T0.25).
学科与关键词
关键词
Distributed optimizationMirror descent algorithmPeriodic dynamic quantization
- Distributed Constrained Optimization With Delayed Subgradient Information Over Time-Varying Network Under Adaptive QuantizationLiu, Jie*; Yu, Zhan; Ho, Daniel W. C.IEEE Transactions on Neural Networks and Learning Systems, 2024, 35(1): 143-156.被引 3
- Distributed online bandit optimization under random quantizationYuan, Deming*; Zhang, Baoyong; Ho, Daniel W. C.; Zheng, Wei Xing; Xu, ShengyuanAutomatica, 2022, 146: 110590.被引 6
- Distributed Stochastic Constrained Composite Optimization Over Time-Varying Network With a Class of Communication NoiseYu, Zhan*; Ho, Daniel W. C.; Yuan, Deming; Liu, JieIEEE Transactions on Cybernetics, 2023, 53(6): 3561-3573.被引 8
