Metraipolis › archive › dc_c3d2dc49849d
On $ϕ$-Best Proximity Points and Proximal-type Algorithms in Banach Spaces — arXiv:2608.22088
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.22088
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T08:25:46.867Z
- SHA-256 of the archived text
676089a5325ac5dabd232b803bfe38a46d63695c70d31aabe771edc20f0f8d12- Stable URL of this page
https://metraipolis.com/documento/dc_c3d2dc49849d
How to cite
On $ϕ$-Best Proximity Points and Proximal-type Algorithms in Banach Spaces — arXiv:2608.22088 — arXiv (en), https://arxiv.org/abs/2608.22088 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c3d2dc49849d (Metraipolis archive dc_c3d2dc49849d, sha256 676089a5325ac5dabd232b803bfe38a46d63695c70d31aabe771edc20f0f8d12)
BibTeX
@misc{dcc3d2dc49849d,
title = {On $ϕ$-Best Proximity Points and Proximal-type Algorithms in Banach Spaces — arXiv:2608.22088},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.22088},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c3d2dc49849d; sha256 676089a5325ac5dabd232b803bfe38a46d63695c70d31aabe771edc20f0f8d12},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.22088. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The purpose of this paper is to study the existence and convergence of $\phi$-best proximity points in Banach spaces. A strong convergence theorem is established by employing a shrinking projection algorithm designed to compute common $\phi$-best proximity points of a proximally weakly suppressive mapping. Finally, we address a projection scheme to solve split $\phi$-best proximity point and variational problem in a Banach space. These contributions provide new tools for solving nonlinear problems involving non-self mappings. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.OC). Categorie arXiv: Functional Analysis (math.FA) ; Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2608.22088 — 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-18T08:18:05.716Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).