Minimization problem of proximal point algorithm in complete CAT(0) spaces
Open Access
- 1 January 2022
- journal article
- research article
- Published by National Library of Serbia in Filomat
- Vol. 36 (18) , 6289-6298
Abstract
In this paper a proximal point algorithm for a convex function is considered in complete CAT(0) spaces. We introduce a necessary and sufficient condition for the set of minimizers of the function to be nonempty, and by showing that in this case, this iterative sequence converges strongly to the metric projection of some point onto the set of minimizers of the function.Keywords
This publication has 30 references indexed in Scilit:
- Duality and subdifferential for convex functions on complete metric spacesNonlinear Analysis, 2010
- -spaces, weak convergence and fixed pointsJournal of Mathematical Analysis and Applications, 2009
- A concept of convergence in geodesic spacesNonlinear Analysis, 2008
- Fixed point theorems in "Equation missing" spaces and "Equation missing" -treesFixed Point Theory and Applications, 2004
- Convergence of generalized proximal point algorithmsCommunications on Pure and Applied Analysis, 2004
- Newton's method on Riemannian manifolds and a geometric model for the human spineIMA Journal of Numerical Analysis, 2002
- Approximating Solutions of Maximal Monotone Operators in Hilbert SpacesJournal of Approximation Theory, 2000
- Convex functionals and generalized harmonic maps into spaces of non positive curvatureCommentarii Mathematici Helvetici, 1995
- Remarks on some fixed point theoremsProceedings of the American Mathematical Society, 1976
- Fixed points of nonexpanding mapsBulletin of the American Mathematical Society, 1967