Key points are not available for this paper at this time.
We consider the decentralized minimization of a separable objective ₈=₁^n fᵢ (xᵢ), where the variables are coupled through an affine constraint ₈=₁ⁿ (Aᵢ xᵢ - bᵢ) = 0. We assume that the functions fᵢ, matrices Aᵢ, and vectors bᵢ are stored locally by the nodes of a computational network, and that the functions fᵢ are smooth and strongly convex. This problem has significant applications in resource allocation and systems control and can also arise in distributed machine learning. We propose lower complexity bounds for decentralized optimization problems with coupled constraints and a first-order algorithm achieving the lower bounds. To the best of our knowledge, our method is also the first linearly convergent first-order decentralized algorithm for problems with general affine coupled constraints.
Yarmoshik et al. (Tue,) studied this question.