The proximal point algorithm in geodesic spaces with curvature bounded above
From MaRDI portal
Publication:4592969
zbMath1466.47052arXiv1704.05721MaRDI QIDQ4592969
Yasunori Kimura, Fumiaki Kohsaka
Publication date: 9 November 2017
Full work available at URL: https://arxiv.org/abs/1704.05721
resolvent; fixed point; convex function; minimizer; proximal point algorithm; \(\mathrm{CAT}(1)\) space; geodesic space with curvature bounded above
90C25: Convex programming
54H25: Fixed-point and coincidence theorems (topological aspects)
52A41: Convex functions and convex programs in convex geometry
47J26: Fixed-point iterations
Related Items
On the convergence rate of Mann iteration in geodesic spaces with positive curvature, Old and new challenges in Hadamard spaces, On a proximal-point algorithm for solving the minimization problem and common fixed-point problem in CAT\((k)\) spaces, Two modified proximal point algorithms in geodesic spaces with curvature bounded above, Unnamed Item