摘要
In this paper,we develop a distributed solver for a group of strict(non-strict)linear matrix inequalities over a multi-agent network,where each agent only knows one inequality,and all agents co-operate to reach a consensus solution in the intersection of all the feasible regions.The formulation is transformed into a distributed optimization problem by introducing slack variables and consensus constraints.Then,by the primal–dual methods,a distributed algorithm is proposed with the help of projection operators and derivative feedback.Finally,the convergence of the algorithm is analyzed,followed by illustrative simulations.
基金
This work was supported by the Shanghai Municipal Science and Technology Major Project(No.2021SHZDZX0100)
the National Natural Science Foundation of China(Nos.61733018,62073035)。
