Skip to content
DraconiticResearch
Search Sources API
194,161 studies31 sourcesUpdated 30 min ago
PreprintarXiv licencearXiv

Graph splitting algorithms for inconsistent feasibility problems

  • Rubén Campoy
  • César López-Pastor
  • David Torregrosa-Belén
Open at sourcePDFDOICite

Abstract

In this work, we study graph splitting algorithms for feasibility problems involving closed and convex sets whose intersection may be empty. We characterize their minimal displacement vector, which is known to be the limit of the differences between successive iterates, in terms of a least-squares problem measuring disagreement between the sets according to the graph structure. We then specialize to closed affine subspaces, proving strong convergence of the shadow sequence to a solution of such a least-squares problem whenever one exists. Our analysis extends classical Douglas-Rachford results on best approximation pairs to graph splitting algorithms.

Related

  1. Local W2,1p convergence of penalization for time-inconsistent stopping problems
    Xiaodong Luo, Xiang Yu
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Equilibria for Time-inconsistent Regular-singular Control Problems
    Yuting Jia, Zongxia Liang, Xiaodong Luo
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  3. Splitting Algorithms Using Pairs Monotonicity to Solve the Sum of Two Non-monotone Operators Problem
    Ba Khiet Le, Zakaria Mazgouri, Michel Théra
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  4. Accelerated Convergence of a Second-Order Dynamical System and its Application to Splitting Algorithms for Comonotone Inclusions
    Yan Tang, Jun Dong
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  5. A new operator splitting method for coupled PDE problems, with an application to poromechanics
    Francesca Marcon, Stefano Scialò
    arXivPreprintCC BY-NC-ND 4.0Full textNumerical analysis & scientific computingarXiv

Cite

BibTeXRIS
BibTeX
@misc{campoy2026graph,
  title = {{Graph splitting algorithms for inconsistent feasibility problems}},
  author = {Rubén Campoy and César López-Pastor and David Torregrosa-Belén},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.02825},
  eprint = {2611.02825},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.02825},
}
RIS
TY  - UNPB
TI  - Graph splitting algorithms for inconsistent feasibility problems
AU  - Rubén Campoy
AU  - César López-Pastor
AU  - David Torregrosa-Belén
PY  - 2026
DA  - 2026/11/02
PB  - arXiv
DO  - 10.48550/arxiv.2611.02825
UR  - https://arxiv.org/abs/2611.02825
AB  - In this work, we study graph splitting algorithms for feasibility problems involving closed and convex sets whose intersection may be empty. We characterize their minimal displacement vector, which is known to be the limit of the differences between successive iterates, in terms of a least-squares problem measuring disagreement between the sets according to the graph structure. We then specialize to closed affine subspaces, proving strong convergence of the shadow sequence to a solution of such a least-squares problem whenever one exists. Our analysis extends classical Douglas-Rachford results on best approximation pairs to graph splitting algorithms.
ER  -