The proximal point algorithm in metric spaces

preprint2012arXivOpen access

Abstract

The proximal point algorithm, which is a well-known tool for finding minima of convex functions, is generalized from the classical Hilbert space framework into a nonlinear setting, namely, geodesic metric spaces of nonpositive curvature. We prove that the sequence generated by the proximal point algorithm weakly converges to a minimizer, and also discuss a related question: convergence of the gradient flow.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.