2008
DOI: 10.11650/twjm/1500405080
|View full text |Cite
|
Sign up to set email alerts
|

New Accuracy Criteria for Modified Approximate Proximal Point Algorithms in Hilbert Spaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
5
0

Year Published

2009
2009
2015
2015

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 17 publications
(5 citation statements)
references
References 22 publications
0
5
0
Order By: Relevance
“…Later many authors studied its convergence in a Hilbert space or a Banach space. See for instance, [7][8][9][10][11][12] and the references therein. Kamimura and Takahashi [13] have been recently introduced and studied the proximal-type algorithm for finding an element of T −1 0 in a uniformly smooth and uniformly convex Banach space E, which is an extension of Solodov and Svaiter's proximal-type algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…Later many authors studied its convergence in a Hilbert space or a Banach space. See for instance, [7][8][9][10][11][12] and the references therein. Kamimura and Takahashi [13] have been recently introduced and studied the proximal-type algorithm for finding an element of T −1 0 in a uniformly smooth and uniformly convex Banach space E, which is an extension of Solodov and Svaiter's proximal-type algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…(iii) The error sequence { } is considered in the iterative scheme (A). (iv) Recall that, in [2], Lemma 8 is a key tool to prove the convergence of { } generated by (10). In particular, to obtain the main result, they imposed an additional condition on the function in Lemma 8 that ( ) ≤ / max{1, 2 1 }, where 1 > 0 is a constant satisfying some conditions.…”
Section: Theorem 1 Let Be a Real Uniformly Smooth And Uniformly Convmentioning
confidence: 99%
“…It was proved that, under some conditions, the sequence { } produced by (5) converges weakly to a point in ( ). Later, many mathematicians try to combine the ideas of proximal method and Mann iterative method to approximate the zeros of -accretive mappings; see, for example, [7][8][9][10][11][12][13][14] and the references therein.…”
Section: Introductionmentioning
confidence: 99%
“…It was shown that, if Recently, many authors studied the problems of modifying Rockafellar's inexact proximal point method 1.3 in order to strong convergence to be guaranteed. In 2008, Ceng et al 4 gave new accuracy criteria to modified approximate proximal point algorithms in Hilbert spaces; that is, they established strong and weak convergence theorems for modified approximate proximal point algorithms for finding zeros of maximal monotone operators in Hilbert spaces. In the meantime, Cho et al 5 proved the following strong convergence result.…”
Section: Introductionmentioning
confidence: 99%