{
  "abstract": "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}, which integrate Nesterov-type acceleration with primal-dual techniques under two prominent settings: (i) \\textit{Lipschitz continuity of $G_i$ and maximal monotonicity of $G_i+T_i$}; and (ii) \\textit{co-coercivity of $G_i$ and maximal monotonicity of $T_i$}. While \\texttt{ND-DFFP} utilizes a homogeneous network-dependent stepsize, \\texttt{NI-DFFP} reformulates the problem into a three-operator inclusion to decouple the network topology, enabling heterogeneous network-independent stepsizes. Under appropriate assumptions, we establish an $\\mathcal{O}(1/k)$ convergence rate for the consensus error and an $\\mathcal{O}(1/k)$ rate for both the restricted gap function and the squared forward-backward splitting residual, with the latter two metrics evaluated at the network-average iterate or its projection onto the effective domain. Finally, numerical experiments on distributed bilinear matrix games and a virtual power plant problem demonstrate the competitive performance and computational efficiency of our methods over recent decentralized baselines in the literature.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.14953",
  "author_total": 3,
  "authors": [
    {
      "name": "Nghia Nguyen-Trung"
    },
    {
      "name": "Ion Necoara"
    },
    {
      "name": "Quoc Tran-Dinh"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/9481g51mn7ffp.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.14953",
  "fulltext_url": null,
  "id": "9481g51mn7ffp",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.14953",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.OC"
    ],
    [
      "arxiv",
      "stat.ML"
    ],
    [
      "openalex",
      "1705|Distributed Control Multi-Agent Systems"
    ]
  ],
  "openalex": "W7213363608",
  "pdf_url": "https://arxiv.org/pdf/2609.14953",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-14",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/9481g51mn7ffp.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:21:29Z",
      "native_id": "2609.14953",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.14953"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.OC",
      "subfield": "optimisation-control"
    },
    {
      "field": "mathematics",
      "origin": "arxiv:stat.ML",
      "subfield": "statistics"
    }
  ],
  "title": "Distributed Fast Fixed-Point Algorithms for Composite Monotone Inclusions over Networks",
  "title_text": "Distributed Fast Fixed-Point Algorithms for Composite Monotone Inclusions over Networks",
  "type": "preprint",
  "updated_at": "2026-10-30T12:21:36Z",
  "url": "https://research.draconitic.com/paper/9481g51mn7ffp",
  "venue": "arXiv",
  "versions": []
}