About the relaxed cocoercivity and the convergence of the proximal point algorithm

The aim of this paper is to study the convergence of two proximal algorithms via the notion of (α, r)-relaxed cocoercivity without Lipschitzian continuity. We will show that this notion is enough to obtain some interesting convergence theorems without any Lipschitz-continuity assumption. The relaxed cocoercivity case is also investigated.