Metraipolis › archive › dc_ad419fa7394f
Weak and strong convergence of a general splitting approach for monotone multioperator inclusions — arXiv:2611.05884
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.05884
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:27:25.266Z
- SHA-256 of the archived text
f17bb25ec3877a7fedfb17495d31df416912271b990fc88afe3140cae811b852- Stable URL of this page
https://metraipolis.com/documento/dc_ad419fa7394f
How to cite
Weak and strong convergence of a general splitting approach for monotone multioperator inclusions — arXiv:2611.05884 — arXiv (en), https://arxiv.org/abs/2611.05884 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ad419fa7394f (Metraipolis archive dc_ad419fa7394f, sha256 f17bb25ec3877a7fedfb17495d31df416912271b990fc88afe3140cae811b852)
BibTeX
@misc{dcad419fa7394f,
title = {Weak and strong convergence of a general splitting approach for monotone multioperator inclusions — arXiv:2611.05884},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.05884},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ad419fa7394f; sha256 f17bb25ec3877a7fedfb17495d31df416912271b990fc88afe3140cae811b852},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05884. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this paper, we study a general forward-backward splitting approach for monotone inclusion problems that simultaneously accommodate set-valued, monotone Lipschitz continuous, and cocoercive operators. Weak convergence is established under a general setting. Strong convergence is obtained when both the maximally monotone operators are linear relations and the monotone Lipschitz continuous and cocoercive operators are linear. When the set-valued operators are normal cones to closed linear subspaces, we derive an explicit characterization of limit points of generated sequences using a new technique. Numerical experiments on a quadratic minimization problem with multiple-set split feasibility constraints are presented to illustrate the theoretical results. 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/2611.05884 — 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-05T18:17:34.243Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).