The proximal point algorithm in complete geodesic spaces with negative curvature
The proximal point algorithm is an approximation method for finding a minimizer of a convex function. In this paper, using the properties of the resolvent which was proposed by the authors, we show the proximal point algorithm using a suitable notion of weak convergence in complete geodesic spaces...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
ATNAA
2019-10-01
|
Series: | Advances in the Theory of Nonlinear Analysis and its Applications |
Subjects: | |
Online Access: | https://dergipark.org.tr/en/download/article-file/827808 |