Distributed algorithm for solving variational inequalities over time-varying unbalanced digraphs
Yichen Zhang1
Yutao Tang1
Zhipeng Tu2
Yiguang Hong3
1.School of Artificial Intelligence,Beijing University of Posts and Telecommunications,Beijing 100876,China2.Network Technology Laboratory,Huawei Technologies Co.,Ltd.,Beijing 100095,China3.Department of Control Science and Engineering,Tongji University,Shanghai 200092,China;Shanghai Research Institute for Intelligent Autonomous Systems,Tongji University,Shanghai 200092,China
摘要：In this paper,we study a distributed model to cooperatively compute variational inequalities over time-varying directed graphs.Here,each agent has access to a part of the full mapping and holds a local view of the global set constraint.By virtue of an auxiliary vector to compensate the graph imbalance,we propose a consensus-based distributed projection algorithm relying on local computation and communication at each agent.We show the convergence of this algorithm over uniformly jointly strongly connected unbalanced digraphs with nonidentical local constraints.We also provide a numerical example to illustrate the effectiveness of our algorithm.
机标关键词：distributedalgorithmoverdigraphsinequalitiessolvingtime-varyingunbalanced
论文发表日期：2024-08-05
在线出版日期：2025-08-15（本平台首次上网日期，不代表文献的发表时间）
页数：11( 431-441 )
英文信息