The proximal point algorithm in complete geodesic spaces with negative curvature

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Advances in the Theory of Nonlinear Analysis and its Application
Volume:3 Issue:4
The proximal point algorithm in complete geodesic spaces with negative curvature

The proximal point algorithm in complete geodesic spaces with negative curvature

Authors : Takuto Kajimura, Yasunori KİMURA

Pages : 192-200

Doi:10.31197/atnaa.573972

View : 12 | Download : 6

Publication Date : 2019-12-30

Article Type : Research Paper

Abstract :The proximal point algorithm is an approximation method for finding a minimizer of a convex function. In this paper, we introduce the resolvent for a convex function in complete geodesic spaces with negative curvature. Using properties of the resolvent, we show the proximal point algorithm in complete geodesic spaces with negative curvature.
Keywords : CAT 1, space, proximal point algorithm, resolvent, convex function

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.

Index of Academic Documents
İzmir Academy Association
CopyRight © 2023-2025