Distributed algorithm for solving variational inequalities over time-varying unbalanced digraphs  

作　　者：Yichen Zhang Yutao Tang Zhipeng Tu Yiguang Hong 

机构地区：[1]School of Artificial Intelligence,Beijing University of Posts and Telecommunications,Beijing 100876,China [2]Network Technology Laboratory,Huawei Technologies Co.,Ltd.,Beijing 100095,China [3]Department of Control Science and Engineering,Tongji University,Shanghai 200092,China [4]Shanghai Research Institute for Intelligent Autonomous Systems,Tongji University,Shanghai 200092,China

出　　处：《Control Theory and Technology》2024年第3期431-441,共11页控制理论与技术（英文版）

基　　金：supported by the National Natural Science Foundation of China(No.61973043);Shanghai Municipal Science and Technology Major Project(No.2021SHZDZX0100).

摘　　要：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.

关 键 词：Variational inequality Distributed computation Multi-agent system Weight-unbalanced graph 

分 类 号：O178[理学—数学] TP31[理学—基础数学]