.png){kind=icon}
返回
Modified graph systems for distributed optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-022-3781-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In distributed optimization theory, network topology graphs are important in communications among multiple agents. However, distributed optimization approaches cannot solve optimization problems well if the graphs are infeasible or tampered. To this end, this paper develops two types of modified graph systems for modifying or recovering the communication graphs among agents employed in distributed optimization. Two optimization problems for obtaining feasible graphs are formulated. Based on the two optimization problems, two modified graph systems are derived accordingly and their convergence to the optimal solution is proven. Via a coordination mechanism consisting of a distributed optimization approach and a modified graph system, we can modify an infeasible communication graph into a feasible one or recover a tampered graph, and the distributed optimization approach can resume its solver capability with the modified graphs. Several examples are provided to demonstrate the efficiency of the main results.
Keyword:
distributed optimization
modified graph system
neurodynamic optimization
communication graph
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
引用论文
分享收藏Distributed Optimization for Multiagent Systems: An Edge-Based Fixed-Time Consensus Approach多代理系统的分布式优化: 基于边缘的固定时间共识方法
PREAI
分享收藏
Distributed Continuous-Time Algorithms for Resource Allocation Problems Over Weight-Balanced Digraphs权重平衡有向图上资源分配问题的分布式连续时间算法
PREAI
分享收藏Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation.png)
AUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAI分享收藏
查看更多内容