SOURCE-LINKED INTELLIGENCE

Distributed Fast Fixed-Point Algorithms for Composite Monotone Inclusions over Networks

arXiv · AI, language, vision and robotics · article · Sep 14, 2026 · UTC

This paper aims to develop new and efficient distributed algorithms for solving a class of monotone inclusions, $0 \in \sum_{i=1}^n (G_ix + T_ix)$, over a connected network of $n$ agents, where the single-valued operator $G_i$ and the possibly multivalued operator $T_i$ remain private to agent $i$. Existing distributed algorithms for this problem class are primarily non-accelerated, and their exact convergence rates in the original primal space are largely unexplored. To bridge this gap, we propose two Decentralized Fast Fixed-Point-based algorithms, \texttt{ND-DFFP} and \texttt{NI-DFFP}, whic

Read original source ↗ Open in workspace

recordType

paper

region

Global