# Decentralized optimization with affine constraints over time-varying networks

arXiv: https://arxiv.org/abs/2307.01655 · HTML: https://mlsanity.com/paper/2307.01655/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 4 Jul 2023.

## Built on by (most cited first, 1 of 1)

- [Decentralized Optimization with Cross-Coupled Mixed Affine Constraints](https://mlsanity.com/paper/2609.33021/) (2026)

## Abstract (arXiv)

The decentralized optimization paradigm assumes that each term of a finite-sum objective is privately stored by the corresponding agent. Agents are only allowed to communicate with their neighbors in the communication graph. We consider the case when the agents additionally have local affine constraints and the communication graph can change over time. We provide the first linearly convergent decentralized algorithm for time-varying networks by generalizing the optimal decentralized algorithm ADOM to the case of affine constraints. We show that its rate of convergence is optimal for first-order methods by providing the lower bounds for the number of communications and oracle calls.