EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Proximal point algorithm for convex minimisation on Banach spheres

Shuta Sudo

Letters in Nonlinear Analysis and its Applications · 30.06.2026 · 127-136

DOI: 10.66147/lnaa.20264378 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Letters in Nonlinear Analysis and its Applications, online erschienen am 30.06.2026. Verfasst von Shuta Sudo. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this paper, we study a proximal point algorithm for convex minimisation on Banach spheres. In the spherical framework, we consider resolvent operators associated with proper lower semicontinuous spherically convex functions and investigate the asymptotic behaviour of iterative sequences generated by these resolvents. Under suitable geometric assumptions on the underlying Banach sphere and a sequential delta-continuity assumption on the duality mapping, we prove that the generated sequence delta-converges to a minimiser of the objective function. This result provides a delta-convergence principle for proximal point algorithms in the setting of Banach spheres.

Zitieren

APA

Sudo, S. (2026). Proximal point algorithm for convex minimisation on Banach spheres. Letters in Nonlinear Analysis and its Applications, 127-136. https://doi.org/10.66147/lnaa.20264378

Vancouver

Sudo S. Proximal point algorithm for convex minimisation on Banach spheres. Letters in Nonlinear Analysis and its Applications. 2026:127-136. doi:10.66147/lnaa.20264378

BibTeX
@article{Sudo2026,
  author = {Sudo, Shuta},
  title = {Proximal point algorithm for convex minimisation on Banach spheres},
  journal = {Letters in Nonlinear Analysis and its Applications},
  year = {2026},
  pages = {127--136},
  doi = {10.66147/lnaa.20264378}
}
Kostenlos starten →