On relaxed and contraction-proximal point algorithms in hilbert spaces
<p>Abstract</p> <p>We consider the relaxed and contraction-proximal point algorithms in Hilbert spaces. Some conditions on the parameters for guaranteeing the convergence of the algorithm are relaxed or removed. As a result, we extend some recent results of Ceng-Wu-Yao and Noor-Yao...
Main Authors: | Wang Shuyu, Wang Fenghui |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2011-01-01
|
Series: | Journal of Inequalities and Applications |
Subjects: | |
Online Access: | http://www.journalofinequalitiesandapplications.com/content/2011/1/41 |
Similar Items
-
A Proximal Point Algorithm for Finding a Common Zero of a Finite Family of Maximal Monotone Operators
by: Mohsen Tahernia, et al.
Published: (2019-10-01) -
Convergence of Two Splitting Projection Algorithms in Hilbert Spaces
by: Marwan A. Kutbi, et al.
Published: (2019-10-01) -
Proximal Point Algorithm for a Common of Countable Families of Inverse Strongly Accretive Operators and Nonexpansive Mappings with Convergence Analysis
by: Khanittha Promluang, et al.
Published: (2016-01-01) -
Δ-convergence for proximal point algorithm and fixed point problem in CAT(0) spaces
by: Shamshad Husain, et al.
Published: (2019-05-01) -
Linear Convergence Analysis for General Proximal Point Algorithms Involving (H,η)- Mo notonicity Frameworks
by: Ram U Verma
Published: (2011-10-01)