A fully distributed primal-dual algorithm solves nonsmooth strongly convex problems with coupled constraints on time-varying digraphs at O(1/k) rate without communicating primal variables.
A dual splitting approach for distributed resource allocation with regularization,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distributed Optimization with Coupled Constraints over Time-Varying Digraph
A fully distributed primal-dual algorithm solves nonsmooth strongly convex problems with coupled constraints on time-varying digraphs at O(1/k) rate without communicating primal variables.