Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
483603 | Journal of the Egyptian Mathematical Society | 2013 | 4 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Abdellatif Moudafi, Zhenyu Huang,