In this paper we introduce a framework which allows to circumvent the intricate question of Lipschitz continuity of gradients by using an elegant and easy to check convexity condition which captures the geometry of the constraints.Expand

Determining fixed points of nonexpansive mappings is a frequent problem in mathematics and physical sciences. An algorithm for finding common fixed points of nonexpansive mappings in Hilbert space,… Expand

We give several unifying results, interpretations, and examples regarding the convergence of the von Neumann alternating projection algorithm for two arbitrary closed convex nonempty subsets of a… Expand

A systematic investigation of this notion leads to a simplified analysis of numerous algorithms and to the development of a new class of parallel block-iterative surrogate Bregman projection schemes.Expand

We analyze Dykstra?s algorithm for two arbitrary closed convex sets in a Hilbert space. Our technique also applies to von Neumann?s algorithm. Various convergence results follow. An example allows… Expand

The strong conical hull intersection property and bounded linear regularity are properties of a collection of finitely many closed convex intersecting sets in Euclidean space.Expand