The proximal point algorithm in geodesic spaces with curvature bounded above
zbMATH Open1466.47052arXiv1704.05721MaRDI QIDQ4592969FDOQ4592969
Yasunori Kimura, Fumiaki Kohsaka
Publication date: 9 November 2017
Full work available at URL: https://arxiv.org/abs/1704.05721
Recommendations
- Two modified proximal point algorithms in geodesic spaces with curvature bounded above
- The proximal point algorithm in metric spaces
- A proximal point algorithm converging strongly to a minimizer of a convex function
- The proximal point algorithm in uniformly convex metric spaces
- Two modified proximal point algorithms for convex functions in Hadamard spaces
convex functionfixed pointresolventminimizerproximal point algorithm\(\mathrm{CAT}(1)\) spacegeodesic space with curvature bounded above
Convex programming (90C25) Convex functions and convex programs in convex geometry (52A41) Fixed-point and coincidence theorems (topological aspects) (54H25) Fixed-point iterations (47J26)
Cited In (8)
- Title not available (Why is that?)
- ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE
- 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
- Asymptotic behavior of resolvents of equilibrium problems on complete geodesic spaces
- Two modified proximal point algorithms in geodesic spaces with curvature bounded above
- Title not available (Why is that?)
This page was built for publication: The proximal point algorithm in geodesic spaces with curvature bounded above
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592969)