Papers › Graph and distributed extensions of the Douglas-Rachford method
Graph and distributed extensions of the Douglas-Rachford method
Kristian Bredies, Enis Chenchene, Emanuele Naldi
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this paper, we propose several graph-based extensions of the Douglas-Rachford splitting (DRS) method to solve monotone inclusion problems involving the sum of N maximal monotone operators. Our construction is based on a two-layer architecture that we refer to as bilevel graphs, to which we associate a generalization of the DRS algorithm that presents the prescribed structure. The resulting schemes can be understood as unconditionally stable frugal resolvent splitting methods with a minimal lifting in the sense of Ryu [Math Program 182(1):233-273, 2020], as well as instances of the (degenerate) Preconditioned Proximal Point method, which provides robust convergence guarantees. We further describe how the graph-based extensions of the DRS method can be leveraged to design new fully distributed protocols. Applications to a congested optimal transport problem and to distributed Support Vector Machines show interesting connections with the underlying graph topology and highly competitive performances with state-of-the-art distributed optimization approaches.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections