Convergence of Proximal Splitting Algorithms in CAT(k) Spaces and Beyond

Abstract

In the setting of CAT(k) spaces, common fixed point iterations built from prox mappings (e.g. prox-prox, Krasnoselsky-Mann relaxations, nonlinear projected-gradients) converge locally linearly under the assumption of linear metric subregularity. Linear metric subregularity is in any case necessary for linearly convergent fixed point sequences, so the result is tight. To show this, we develop a theory of fixed point mappings that violate the usual assumptions of nonexpansiveness and firm nonexpansiveness in p-uniformly convex spaces.

18 pages, 13 citations. arXiv admin note: text overlap with arXiv:2104.11302

Cited by in corpus (1)

• The fixed point iteration of positive concave mappings converges geometrically if a fixed point exists: implications to wireless systems