.png){kind=icon}
返回
Distributed constrained optimization with periodic dynamic quantization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2023.111364.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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). (c) 2023 Elsevier Ltd. All rights reserved.
Keyword:
Distributed optimization
Mirror descent algorithm
Periodic dynamic quantization
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
分享收藏
分享收藏Reinforcement Learning for Selective Key Applications in Power Systems: Recent Advances and Future Challenges电力系统选择性关键应用的强化学习: 最新进展和未来挑战
OAAI
OAAI分享收藏Distributed discrete-time convex optimization with nonidentical local constraints over time-varying unbalanced directed graphs时变不平衡有向图上具有不相同局部约束的分布式离散时间凸优化.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏
查看更多内容