arXiv Analytics

Sign in

arXiv:2208.12123 [math.OC]AbstractReferencesReviewsResources

Distributed Algorithm Over Time-Varying Unbalanced Topologies for Optimization Problem Subject to Multiple Local Constraints

Hongzhe Liu, Wenwu Yu, Guanghui Wen, Wei Xing Zheng

Published 2022-08-25Version 1

This paper studies the distributed optimization problem with possibly nonidentical local constraints, where its global objective function is composed of $N$ convex functions. The aim is to solve the considered optimization problem in a distributed manner over time-varying unbalanced directed topologies by using only local information and performing only local computations. Towards this end, a new distributed discrete-time algorithm is developed by synthesizing the row stochastic matrices sequence and column stochastic matrices sequence analysis technique. Furthermore, for the developed distributed discrete-time algorithm, its convergence property to the optimal solution as well as its convergence rate are established under some mild assumptions. Numerical simulations are finally presented to verify the theoretical results.

Related articles: Most relevant | Search more
arXiv:2305.17240 [math.OC] (Published 2023-05-26)
A Distributed Algorithm for Multi-Agent Optimization under Edge-Agreements
arXiv:2209.06391 [math.OC] (Published 2022-09-14)
Distributed Algorithm for Continuous-type Bayesian Nash Equilibrium in Subnetwork Zero-sum Games
arXiv:1602.01483 [math.OC] (Published 2016-02-03)
A Distributed Algorithm for Computing a Common Fixed Point of a Family of Paracontractions