Metraipolis › archive › dc_bd396cc6c25f

Splitting Compositions of Monotone Operators — arXiv:2610.39480

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.39480
License (as archived)
CC0-1.0
Archived
2026-11-01T02:32:13.937Z
SHA-256 of the archived text
a0b391d72e73489a8e5fe65e8247f57bc4d1abbc9f8e0c59094b84bdcec97f5c
Stable URL of this page
https://metraipolis.com/documento/dc_bd396cc6c25f

How to cite

Splitting Compositions of Monotone Operators — arXiv:2610.39480 — arXiv (en), https://arxiv.org/abs/2610.39480 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bd396cc6c25f (Metraipolis archive dc_bd396cc6c25f, sha256 a0b391d72e73489a8e5fe65e8247f57bc4d1abbc9f8e0c59094b84bdcec97f5c)
BibTeX
@misc{dcbd396cc6c25f,
  title = {Splitting Compositions of Monotone Operators — arXiv:2610.39480},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.39480},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bd396cc6c25f; sha256 a0b391d72e73489a8e5fe65e8247f57bc4d1abbc9f8e0c59094b84bdcec97f5c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.39480. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Coupled convex optimisation equilibria, bilinear saddle and potential systems, and nonlinear electronic device laws lead naturally to inclusions of the form $0\in Hx+A(Bx)-b$, where $A$ and $B$ are maximal monotone but their composition need not be monotone. We introduce a new class of splitting algorithms that solve such inclusions. Introducing the intermediate graph variable $y\in Bx$ exposes a directed two-row system. A one-parameter family of kernels produces a lower-triangular warped-resolvent iteration evaluated with one application of $H$ and the ordinary resolvents $J_{\alpha A}$ and $J_{\beta B}$. Appropriate specializations of the problem data and algorithmic parameters recover forward--backward, inertial, primal--dual, and Douglas--Rachford constructions, while setting $H=b=0$ generates three novel algorithms for the pure composition $0\in A(Bx)$. Convergence of the coupled method is certified by an explicit nonnegative two-block gain matrix. Its Schur condition yields contraction in particular weighted norms, global linear convergence, and residual error estimates. For the general problem class, our convergence condition is shown to be sharp for an explicitly constructed linear family. When the problem is specialized to a pure composition, we prove convergence under the weaker assumption that only one operator is strongly monotone. This weaker regime is illustrated on a nonlinear circuit problem. We further illustrate our methods by solving inference problems for cascaded equilibrium neural networks.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.39480 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:14:28.318Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).