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
resolventfixed pointconvex functionminimizerproximal point algorithm\(\mathrm{CAT}(1)\) spacegeodesic space with curvature bounded above
Convex programming (90C25) Fixed-point and coincidence theorems (topological aspects) (54H25) Convex functions and convex programs in convex geometry (52A41) Fixed-point iterations (47J26)
Related Items
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 ⋮ On the convergence rate of Mann iteration in geodesic spaces with positive curvature