.png){kind=icon}
返回
Multi-cluster distributed optimization via random sleep strategy
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jfranklin.2019.03.021.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, the distributed optimization problem over multi-cluster networks is considered. Different from the existing works, this paper studies the optimization algorithm under uncoordinated step sizes. More specifically, by combining a random sleep strategy and the round-robin communication among clusters, a new hierarchical algorithm is developed to solve the considered problem. In the proposed algorithm, the random sleep strategy enables each agent to independently choose either performing the projected subgradient descent, or keeping the previous estimate by a Bernoulli decision, based on which the step size of each agent is selected as an uncoordinated form that only relates to the independent Bernoulli decision variable. Technically, by introducing a key definition on the algorithm history, it is proven that the estimates of the proposed algorithm can converge to the optimal solution even with the uncoordinated step sizes. In addition, we also study the convergence performance of the proposed algorithm with simpler constant step sizes. In this case, it is proven that the random sleep strategy can efficiently improve the convergence accuracy of the algorithm. Finally, the theoretical findings are verified via simulation examples. (C) 2019 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
Keyword:
NASH EQUILIBRIUM SEEKING
CONSTRAINED CONSENSUS
CONVEX-OPTIMIZATION
ECONOMIC-DISPATCH
AGGREGATIVE GAMES
ALGORITHMS
CONVERGENCE
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
3.7
论文数:
6.4K
被引数:
1.5W
机构
引用论文
.png){kind=icon}
查看更多内容