Metraipolis › archive › dc_8d0f29539bb2
Accelerated Convergence of a Second-Order Dynamical System and its Application to Splitting Algorithms for Comonotone Inclusions — arXiv:2609.02479
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.02479
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T05:25:50.378Z
- SHA-256 of the archived text
f5f69abc4993dfa727ed3449633d011e1702c79c56cd4fb81f105adbb8da4ef2- Stable URL of this page
https://metraipolis.com/documento/dc_8d0f29539bb2
How to cite
Accelerated Convergence of a Second-Order Dynamical System and its Application to Splitting Algorithms for Comonotone Inclusions — arXiv:2609.02479 — arXiv (en), https://arxiv.org/abs/2609.02479 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8d0f29539bb2 (Metraipolis archive dc_8d0f29539bb2, sha256 f5f69abc4993dfa727ed3449633d011e1702c79c56cd4fb81f105adbb8da4ef2)
BibTeX
@misc{dc8d0f29539bb2,
title = {Accelerated Convergence of a Second-Order Dynamical System and its Application to Splitting Algorithms for Comonotone Inclusions — arXiv:2609.02479},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.02479},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8d0f29539bb2; sha256 f5f69abc4993dfa727ed3449633d011e1702c79c56cd4fb81f105adbb8da4ef2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.02479. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper introduces a novel second-order dynamical system driven by a forward-backward splitting operator for solving the structured inclusion $0\in(A+B)(x)$ in a real Hilbert space, where $A$ is a maximal $\rho$-comonotone operator and $B$ is a $\nu$-cocoercive operator. The well-posedness of the system is established, and Lyapunov analysis yields accelerated convergence rates of order $o(\frac{1}{t})$ for the velocity and $o(\frac{1}{t^2})$ for the forward-backward residual, together with weak convergence of the trajectories to $\operatorname{zer}(A+B)$. Temporal discretization further leads to a class of double inertial Halpern forward-backward splitting algorithms that encompasses the classical forward-backward splitting method and its inertial variants as special cases. Numerical experiments on split feasibility, sparse signal recovery, and image deblurring illustrate the effectiveness of the proposed algorithm.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-03 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.02479 — 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-10-17T04:44:15.058Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).