.png){kind=icon}
Return
Distributed Algorithm for Constrained Optimization Over Weight-Unbalanced Digraphs
.png){kind=icon}
PRE
AI
DOI：10.1109/tcns.2026.3700335.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article addresses distributed optimization problems with compact convex set constraints and nonsmooth objectives over weight-unbalanced directed communication graphs, where the objective function is a sum of local convex functions endowed only by the corresponding agent. The weight unbalance destroys the doubly stochastic property required by standard consensus algorithms, while the nonsmooth objectives and coupled constraints further complicate distributed computation. To tackle these challenges, we propose a novel continuous-time projection algorithm that achieves finite-time weight balancing and finite-time convergence to the feasible set from any initial values, followed by asymptotic convergence to an optimal solution. Finally, two numerical examples are performed to substantiate the effectiveness, demonstrating its strong adaptability to both weight-balanced and weight-unbalanced graphs compared with existing methods.
Keywords:
Distributed optimization
finite-time projection
set constraint
weight-unbalanced digraph
Journal
IF:
5
Papers:
1.7K
Citations:
5.8K
Organization
View more organizations
Cited Papers
No cited papers available