摘要
This article is concerned with the distributed convex constrained optimization over a time-varying multiagent network in the non-Euclidean sense, where the bandwidth limitation of the network is considered. To save the network resources so as to reduce the communication costs, we apply an event-triggered strategy (ETS) in the information interaction of all the agents over the network. Then, an event-triggered distributed stochastic mirror descent (ET-DSMD) algorithm, which utilizes the Bregman divergence as the distance-measuring function, is presented to investigate the multiagent optimization problem subject to a convex constraint set. Moreover, we also analyze the convergence of the developed ET-DSMD algorithm. An upper bound for the convergence result of each agent is established, which is dependent on the trigger threshold. It shows that a sublinear upper bound can be guaranteed if the trigger threshold converges to zero as time goes to infinity. Finally, a distributed logistic regression example is provided to prove the feasibility of the developed ET-DSMD algorithm.
学科与关键词
- Distributed Stochastic Constrained Composite Optimization Over Time-Varying Network With a Class of Communication NoiseYu, Zhan*; Ho, Daniel W. C.; Yuan, Deming; Liu, JieIEEE Transactions on Cybernetics, 2023, 53(6): 3561-3573.被引 8
- Distributed Randomized Gradient-Free Mirror Descent Algorithm for Constrained OptimizationYu, Zhan*; Ho, Daniel W. C.; Yuan, DemingIEEE Transactions on Automatic Control, 2022, 67(2): 957-964.被引 14
- A Bi-Event-Triggered Multi-Agent System for Distributed OptimizationHuang, Banghua; Liu, Yang*; Xia, Zicong; Wang, Jun*IEEE Transactions on Network Science and Engineering, 2023, 10(2): 1074-1084.被引 2
