.png){kind=icon}
返回
Quantized subgradient algorithm with limited bandwidth communications for solving distributed optimization over general directed multi-agent networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2015.12.043.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we consider the quantized distributed optimization problem over general directed digital multi-agent networks, where the communication channels have limited data transmission rates. To solve the optimization problem, a distributed quantized subgradient algorithm is presented among agents. Based on an encoder-decoder scheme and a zoom-in technique, we can achieve not only a consensus, but also an optimal solution. In particular, we study two cases of the quantization levels of each connected directed digital communication channel. One is under the case that the quantization levels are time-varying at each time step, and the other is under the case of fixed quantization level. Two rigorous theoretical analyses are performed and the optimal solutions can be obtained asymptotically. Moreover, the upper bound of the quantization levels at each time step and the convergence rate are analytically characterized. The effectiveness of proposed algorithm is demonstrated by two illustrative examples. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Distributed optimization
Quantization
Directed digital networks
Subgradient algorithm multi-agent networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
.png){kind=icon}
Percutaneous glycerol rhizotomy for trigeminal neuralgia: safety and efficacy of repeat procedures
PREAI
分享收藏
分享收藏
查看更多内容