Metraipolis › archive › dc_ce61064cd3d7

Multi-split Multiple-sets Implicit Convex Feasibility Seeking As Split Inverse Problems — arXiv:2610.39991

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

How to cite

Multi-split Multiple-sets Implicit Convex Feasibility Seeking As Split Inverse Problems — arXiv:2610.39991 — arXiv (en), https://arxiv.org/abs/2610.39991 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ce61064cd3d7 (Metraipolis archive dc_ce61064cd3d7, sha256 ca82b0c52a21c96e1e683289cfcf442f7e76b48b4958be65fb2103434f3211af)
BibTeX
@misc{dcce61064cd3d7,
  title = {Multi-split Multiple-sets Implicit Convex Feasibility Seeking As Split Inverse Problems — arXiv:2610.39991},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.39991},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ce61064cd3d7; sha256 ca82b0c52a21c96e1e683289cfcf442f7e76b48b4958be65fb2103434f3211af},
  year = {2026}
}

Archived text

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

We introduce a new class of problems, termed multi-split multiple-sets implicit convex feasibility problems (MSMS-ICFPs), define a proximity function for it and analyze its properties under certain assumptions on the involved general point-to-set operators. Additionally, we discuss its properties for a special class of point-to-set operators. For these kinds of point-to-set operators, we deploy a new iterative algorithm to solve the associated MSMS-ICFP and show that any sequence generated by it converges in norm to a solution of the MSMS-ICFP whenever a solution exists (i.e., in the consistent case). We also define a generalized proximity function for the MSMS-ICFP using the Bregman distance. Based on this function, we present a generalized simultaneous projection gradient algorithm for the split feasibility problem with multiple output sets, by examining various related results. We conclude by discussing several further special cases of the MSMS-ICFP.

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.39991 — 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.328Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).