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...
Main Authors: | Abdellatif Moudafi, Zhenyu Huang |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2013-10-01
|
Series: | Journal of the Egyptian Mathematical Society |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S1110256X13000448 |
Similar Items
-
Convergence theorems of solutions of a generalized variational inequality
by: Liang Ma, et al.
Published: (2011-01-01) -
System of Extended General Variational Inequalities for Relaxed Cocoercive Mappings in Hilbert Space
by: Kyung Soo Kim
Published: (2018-10-01) -
Linear Convergence Analysis for General Proximal Point Algorithms Involving (H,η)- Mo notonicity Frameworks
by: Ram U Verma
Published: (2011-10-01) -
Existence of solutions and convergence analysis for a system of quasivariational inclusions in Banach spaces
by: Chen Jia-wei, et al.
Published: (2011-01-01) -
Convergence and weaker control conditions for hybrid iterative algorithms
by: Wang Shuang
Published: (2011-01-01)