.png){kind=icon}
返回
Resilient consensus-based distributed optimization under deception attacks
.png){kind=icon}
PRE
AI
DOI：10.1002/rnc.5026.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article considers distributed optimization problems of complex cyber-physical networks, whose goal is to minimize a global function consisting of a sum of local functions possessed by each node, when the communication network is sufferingL-local deception attacks. After showing that merely 1-local deception attacks can arbitrarily affect the outcome of any distributed optimization algorithms without being detected, we propose a resilient consensus-based distributed optimization algorithm, where the estimation for the optimizer of each node is updated according to its subgradient and its partial neighbors' estimation. Then, we provide the conditions for the proposed algorithm to ensure that all the nodes can make an agreement and converge to the convex hull of the local optimizer of their functions in the presence ofL-local deception attacks. Finally, some simulation examples are presented to demonstrate the effectiveness of the proposed algorithm.
Keyword:
complex cyber-physical networks
consensus
deception attacks
resilient distributed optimization
robust graph
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.2
论文数:
7.0K
被引数:
1.4W
机构
引用论文
.png){kind=icon}
查看更多内容