Skip to main content

Strong convergence of iterative algorithms with variable coefficients for asymptotically strict pseudocontractive mappings in the intermediate sense and monotone mappings

Abstract

In this article, we propose some iterative algorithms with variable coefficients for finding a common element of the set of fixed points of a uniformly continuous asymptotically κ-strict pseudocon-tractive mapping in the intermediate sense and the set of solutions of the variational inequality problem for a monotone, Lipschitz-continuous mapping. Some strong convergence theorems of these iterative algorithms are obtained without some boundedness assumptions and without some convergence condition. The results of the article improve and extend the recent results of Ceng and Yao, Nadezhkina and Takahashi, and several others.

Mathematics Subject Classification (2000): 47H09; 47J20.

1 Introduction

Let H be a real Hilbert space with inner product 〈·, ·〉 and norm · , respectively. Let C a nonempty closed convex subset of H and let P C be the metric project from H onto C. F(S) = {x C : Sx = x} denotes the set of fixed points of a self-mapping S on a set C.

A mapping A of C into H is called monotone if

A x - A y , x - y 0 , x , y C .

A mapping A of C into H is said to be L-Lipschitz continuous if there exists a positive constant L such that

A x - A y L x - y , x , y C .

Let the mapping A from C to H be monotone and Lipschitz continuous. The variational inequality problem (for short, VI(C, A)) is to find a u C such that

A u , v - u 0 , v C .

The set of solutions of the VI(C, A) is denoted Ω. A mapping A of C into H is said to be α-inverse strongly monotone if there exists a positive constant α such that

A x - A y , x - y α A x - A y 2 , x , y C .

It is obvious that if A is α-inverse-strongly monotone, then A is monotone and Lipschitz continuous. Recall that a mapping S : CC is called to be nonexpansive if

S x - S y x - y , x , y C .

A mapping S : CC is called to be asymptotically nonexpansive [1], if there exists a sequence {k n } [1, ∞) with k n → 1 as n → ∞ such that

S n x - S n y k n x - y , for all x , y C , and all integers n 1 .

S : CC is called to be asymptotically nonexpansive in the intermediate sense [2], if it is continuous and the following inequality holds:

lim sup n sup x , y C ( S n x - S n y - x - y ) 0 .
(1.1)

In fact, we see that (1.1) is equivalent to

S n x - S n y 2 x - y 2 + c n , n 1 , x , y C ,
(1.2)

where c n [0, ∞) with c n → 0 as n → ∞. S is called to be an asymptotically κ-strict pseudocontractive mapping with sequence {γ n } [3], if there exist a constant κ [0, 1) and a sequence {γ n } [0, ∞) with γ n → 0 as n → ∞ such that

S n x - S n y 2 ( 1 + γ n ) x - y 2 + κ ( I - S n ) x - ( I - S n ) y 2
(1.3)

for all x, y C and all integers n ≥ 1. It is very clear that, in a real Hilbert space H, (1.3) is equivalent to

S n x - S n y , x - y ( 1 + γ n 2 ) x - y 2 - 1 - κ 2 ( I - S n ) x - ( I - S n ) y 2 .

Recall that S is called to be an asymptotically κ-strict pseudocontraction in the intermediate sense with sequence {γ n } [4], if

lim sup n sup x , y C { S n x - S n y 2 - ( 1 + γ n ) x - y 2 - κ ( I - S n ) x - ( I - S n ) y 2 } 0 ,
(1.4)

where κ [0, 1) and γ n [0, ∞) such that γ n → 0 as n → ∞. In fact, (1.4) is reduced to the following:

S n x - S n y 2 ( 1 + γ n ) x - y 2 + κ ( I - S n ) x - ( I - S n ) y 2 + c n , x , y C ,
(1.5)

where c n [0, ∞) with c n → 0 as n → ∞.

Recently, by combining Korpelevich's extragradient method [5] with Takahashi-Toyoda's iterative algorithm [6], Nadezhkina and Takahashi [7] introduced the following iterative scheme for finding a common element of F(S) ∩ Ω, the intersection of the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inequality problem for a monotone, Lipschitz-continuous mapping and proved its weak convergence.

Theorem A (See [[7], Theorem 3.1]). Let C be a nonempty closed convex subset of a Hilbert space H. Let A : CH be a monotone, L-Lipschitz continuous mapping and let S : CC be a nonexpansive mapping such that F ( S ) Ω. Let {x n } and {y n } be the sequences generated by

x 0 = x C c h o s e n a r b i t r a r y , y n = P C ( x n - λ n A x n ) , x n + 1 = α n x n + ( 1 - α n ) S P C ( x n - λ n A y n ) , n 0 ,

where λ n [a, b] for some a, b (0, 1/L) and α n [c, d] for some c, d (0, 1). Then the sequences {x n }, {y n } converge weakly to the same point z F(S) ∩ Ω, where z = limn→∞PF(S)∩Ωx n .

Inspired by Nadezhkina and Takahashi [[7], Theorem 3.1], and Zeng and Yao [8] introduced the following iterative process for finding an element of F(S)∩Ω and established the following strong convergence theorem.

Theorem B (See [[8], Theorem 3.1]). Let C be a nonempty closed convex subset of a Hilbert space H. Let A : CH be a monotone, L-Lipschitz continuous mapping and let S : CC be a nonexpansive such that F ( S ) Ω. Let {x n } and {y n } be the sequences generated by any given x0 C and

y n = P C ( x n - λ n A x n ) , x n + 1 = α n x 0 + ( 1 - α n ) S P C ( x n - λ n A y n ) ,

for every n ≥ 0, where {λ n } and {α n } satisfy the conditions:

(a) {λ n L} (0, 1 - δ) for some δ (0, 1)

(b) { α n } ( 0 , 1 ) , n = 0 α n =, lim n α n =0,,

Then the sequences {x n }, {y n } converge strongly to the same point PF(S)∩Ω(x0), provided limn→∞x n - xn+1 = 0.

Further, utilizing the combination of hybrid-type method and extragradient-type method, Nadezhkina and Takahashi [9] introduced the following iterative scheme for finding a common element of F(S) ∩ Ω, and proved the following strong convergence theorem.

Theorem C (See [[9], Theorem 3.1] or [[10], Theorem NT2]). Let C be a nonempty closed convex subset of a Hilbert space H. Let A : CH be a monotone, L-Lipschitz continuous mapping and let S : CC be a nonexpansive mapping such that F ( S ) Ω. Let {x n }, {y n }, and {z n } be the sequences generated by

x 0 = x C c h o s e n a r b i t r a r y , y n = P C ( x n - λ n A x n ) , z n = α n x n + ( 1 - α n ) S P C ( x n - λ n A y n ) , C n = { z C : z n - z x n - z } , Q n = { z C : x n - z , x - x n 0 } , x n + 1 = P C n Q n x , n 0 ,

where λ n [a, b] for some a, b (0, 1/L) and α n [0, c] for some c [0, 1). Then the sequences {x n }, {y n }, and {z n } converge strongly to the same point q = PF(S)∩Ωx.

Very recently, considering a nonexpansive nonself mapping, Buong [11] introduced a new iteration method based on the hybrid-type method and extragradient-type method and proved its strong convergence. Considering a finite family of κ-strict pseudocontractive mappings, Ceng et al. [12] proposed parallel extragradient and cyclic-extragradient algorithms, and derived the weak convergence of these algorithms.

Most recently, considering a uniformly continuous asymptotically κ-strict pseudocon-tractive mapping in the intermediate sense, Ceng and Yao [10] proposed a modified hybrid Mann iterative scheme with perturbed mapping based on the hybrid-type method and extragradient-type method, and established the following interesting result with the help of some boundedness assumptions

Theorem D (See [[10], Theorem 3.1]). Let C be a nonempty closed convex subset of a real Hilbert space H. Let A : CH be a monotone, L-Lipschitz continuous mapping with (I - A)(C) C and let S : CC be a uniformly continuous asymptotically κ-strict pseudocontractive mapping in the intermediate sense with sequence {γ n } such that F(S)∩Ω is nonempty and bounded. Let {x n }, {y n }, and {z n } be the sequences generated by

x 1 = x C c h o s e n a r b i t r a r y , y n = ( 1 - μ n ) x n + μ n ( S n x n - λ n A ( S n x n ) ) , t n = P C ( y n - λ n A y n ) , z n = ( 1 - α n - β n ) x n + α n t n + β n S n t n , C n = { z C : z n - z 2 x n - z 2 + θ n } , Q n = { z C : x n - z , x - x n 0 } , x n + 1 = P C n Q n x , n 1 ,

where θ n = μ n κ x n - S n x n 2 +2 γ n Δ n +2 c n + λ n 2 ( A ( S n x n ) 2 + A y n 2 ) and

Δ n = max sup p F ( S ) Ω x n - p 2 , sup p F ( S ) Ω t n - p 2 < .

Assume that {λ n } is a sequence in (0, 1) with lim n λ n =0, and {α n }, {β n }, and {μ n } are three sequences in [0, 1] satisfying the conditions:

  1. (i)

    α n + β n ≤ 1 for all n ≥ 1;

  2. (ii)

    κα n and lim n μ n =0;

  3. (iii)

    lim inf n β n >0;

Then the sequences {x n }, {y n }, and {z n } converge strongly to the same point q = PF(S)∩Ω x if and only if lim inf n A x n , y - x n 0 for all y C.

The following problems arise naturally then: (1) Can we relax the convergence condition lim inf n A x n , y - x n 0 for all y C in Theorem D by proposing some new algorithm. (2) Can we relax the boundedness assumptions that the intersection F(S)∩Ω and the sequence {Δ n } in Theorem D are both bounded. Actually, in many cases, these assumptions and conditions are not easy to examine in advance. Hence, they are interesting and important problems.

In order to solve these problems, motivated and inspired by Ceng and Yao [10], Nadezhkina and Takahashi [9], and Ge et al. [13], we introduce some new algorithms with variable coefficients based on the hybrid-type method and extragradient-type method for finding a common element of the set of fixed points of a uniformly continuous asymptotically κ-strict pseudocontractive mapping in the intermediate sense and the set of solutions of the variational inequality problem for a monotone, Lipschitz-continuous mapping in real Hilbert spaces. Our results improve and extend the corresponding results of Ceng and Yao [10], Nadezhkina and Takahashi [9], and several others.

2 Preliminaries

Throughout this article,

  • x n x means that {x n } converges strongly to x.

  • F(S) = {x C : Sx = x} denotes the set of fixed points of a self-mapping S on a set C.

  • B r (x1):={x H : x - x1r}.

  • is the set of positive integers.

For every point x H, there exists a unique nearest point in C, denoted by P C x, such that

x - P C x x - y , y C .

P C is called the metric projection of H onto C. We know that P C is a nonexpansive mapping from H onto C. Recall that the inequality holds

x - P C x , P C x - y 0 , x H , y C .
(2.1)

Moreover, it is easy to see that it is equivalent to

P C x - P C y 2 P C x - P C y , x - y , x , y H ;

It is also equivalent to

x - y 2 x - P C x 2 + y - P C x 2 , x H , y C .
(2.2)

Lemma 2.1. [14]. Let C be a nonempty closed convex subsets of a real Hilbert space H. Given x H and y C. Then y = P C x if and only if there holds the inequality

x - y , y - z 0 , z C .

Lemma 2.2. [10]. Let A : CH be a monotone mapping. In the context of the variational inequality problem the characterization of projection (2.1) implies

u Ω u = P C ( u - λ A u ) , λ > 0 .

Lemma 2.3. [15]. Let C be a nonempty closed convex subsets of a real Hilbert space H. Given x, y, z H and given also a real number a, the set

{ v C : y - v 2 x - v 2 + z , v + a }

is convex and closed.

Lemma 2.4. [16]. Let H be a real Hilbert space. Then for all x, y, z H and all α, β, γ [0, 1] with α + β + γ = 1, we have

α x + β y + γ z 2 = α x 2 + β y 2 + γ z 2 - α β x - y 2 - α γ x - z 2 - β γ y - z 2 .

Lemma 2.5. [4]. Let C be a nonempty closed convex subsets of a real Hilbert space H. and S : CC be an asymptotically κ-strict pseudocontraction in the intermediate sense with sequence {γ n }. Then

S n x - S n y 1 1 - κ κ x - y + ( 1 + ( 1 - κ ) γ n ) x - y 2 + ( 1 - κ ) c n

for all x, y C and n ≥ 1.

By Ibaraki et al. [[17], Theorem 4.1], we have the following lemma.

Lemma 2.6. Let {K n } be a sequence of nonempty closed convex subsets of a real Hilbert space H such that Kn+1 K n for each n . If K * = n = 0 K n is nonempty, then for each x H, { P K n x } converges strongly to P K* x.

A set-valued mapping T : H → 2His called monotone if for all x, y H, f Tx and g Ty imply 〈x - y, f - g〉 ≥ 0. A monotone mapping T : H → 2His maximal if its graph G(T) is not properly contained in the graph of any other monotone mapping. It is known that a monotone mapping T is maximal if and only if for (x, f) H × H, 〈x-y, f-g〉 ≥ 0 for all (y, g) G(T) implies f Tx. Let A : CH be a monotone and Lipschitz continuous mapping and let N C v be the normal cone to C at v C, i.e., N C = {w H : (v - u, w) ≥ 0, u C}. Define

T v = A v + N C v , i f v C , , i f v C ,

It is known that in this case T is maximal monotone, and 0 Tv if and only if v Ω, see [18].

3 Results and proofs

Theorem 3.1. Let C be a nonempty closed convex subset of a real Hilbert space H. Let A : CH be a monotone, L-Lipschitz continuous mapping and let S : CC be a uniformly continuous asymptotically κ-strict pseudocontractive mapping in the intermediate sense with sequence {γ n } such that F(S) ∩ Ω is nonempty. Let {x n }, {y n }, and {z n } be the sequences generated by the following algorithm with variable coefficients

x 1 C c h o s e n a r b i t r a r y , y n = P C ( x n - λ n A x n ) , t n = P C ( x n - λ n A y n ) , z n = ( 1 - α n - β ^ n ) x n + α n t n + β ^ n S n t n , C 0 = C , C n = { z C n - 1 : z n - z 2 x n - z 2 - ( α n - κ ) β ^ n t n - S n t n 2 + θ n } , x n + 1 = P C n x 1 ,
(3.1)

for every n , where β ^ n = β n 1 + x n - x 1 2 , θ n = β n ( 2 γ n ( 1 + r 0 2 ) + c n ) , { α n } ( a , 1 ) , { β n } ( b , 1 - a ) and {λ n } (b/L, (1 - a)/L) for some a (κ, 1) and some b (0, 1 - a), and c n is as in (1.5), the positive real number r0 is chosen so that B r 0 ( x 1 ) F ( S ) Ω. Then the sequences {x n }, {y n }, and {z n } converge strongly to a point of F(S) ∩ Ω.

Proof. We divide the proof into seven steps.

Step 1. We claim C n is nonempty, convex, and closed for each n .

Indeed, by the assumption, C0, i.e., C is nonempty, convex, and closed. From the definition of C n and Lemma 2.3, it is easy to see that C n is convex and closed for each n . We, therefore, only need to prove that C n is nonempty for each n .

Indeed, let p B r 0 ( x 1 ) F ( S ) Ω be a arbitrary element. Putting x = x n - λ n Ay n and y = p in (2.2), we have

t n - p 2 x n - λ n A y n - p 2 - x n - λ n A y n - t n 2 = x n - p 2 - x n - t n 2 + 2 λ n A y n , p - t n = x n - p 2 - x n - t n 2 + 2 λ n ( A y n - A p , p - y n + A p , p - y n ) + 2 λ n A y n , y n - t n
(3.2)

Since A : CH is a monotone mapping and p Ω = VI(C, A), further, we have

t n - p 2 x n - p 2 - x n - t n 2 + 2 λ n A y n , y n - t n = x n - p 2 - x n - y n 2 - 2 x n - y n , y n - t n - y n - t n 2 + 2 λ n A y n , y n - t n = x n - p 2 - x n - y n 2 - y n - t n 2 + 2 x n - λ n A y n - y n , t n - y n
(3.3)

Since y n = P C (x n - λ n Ax n ) and A is L-Lipschitz continuous, we have

x n - λ n A y n - y n , t n - y n = x n - λ n A x n - y n , t n - y n + λ n A x n - A y n , t n - y n λ n A x n - A y n , t n - y n λ n L x n - y n t n - y n .
(3.4)

So, it follows from (3.2), (3.3) and {λ n } (b/L, (1 - a)/L), we obtain

t n - p 2 x n - p 2 - x n - y n 2 - y n - t n 2 + 2 λ n L x n - y n t n - y n x n - p 2 - x n - y n 2 - y n - t n 2 + λ n 2 L 2 x n - y n 2 + t n - y n 2 = x n - p 2 + ( λ n 2 L 2 - 1 ) x n - y n 2 x n - p 2 .
(3.5)

Since S : CC be an asymptotically κ-strict pseudocontractive mapping in the intermediate sense with sequences {γ n }, by the definition, we have

S n t n - p 2 ( 1 + γ n ) t n - p 2 + κ t n - S n t n 2 + c n , x , y C ,
(3.6)

where c n [0, ∞) with c n → 0 as n → ∞. So, from z n = ( 1 - α n - β ^ n ) x n + α n t n + β ^ n S n t n , (3.5), (3.6) and Lemma 2.4, we deduce that

z n - p 2 = ( 1 - α n - β ^ n ) ( x n - p ) + α n ( t n - p ) + β ^ n ( S n t n - p ) 2 ( 1 - α n - β ^ n ) x n - p 2 + α n t n - p 2 + β ^ n S n t n - p 2 - α n β ^ n t n - S n t n 2 ( 1 - α n - β ^ n ) x n - p 2 + α n t n - p 2 + β ^ n ( ( 1 + γ n ) t n - p 2 + κ t n - S n t n 2 + c n ) - α n β ^ n t n - S n t n 2 = ( 1 - α n - β ^ n ) x n - p 2 + ( α n + β ^ n ) t n - p 2 + β ^ n ( γ n t n - p 2 + c n ) - ( α n - κ ) β ^ n t n - S n t n 2 ( 1 - α n - β ^ n ) x n - p 2 + ( α n + β ^ n ) x n - p 2 - ( α n - κ ) β ^ n t n - S n t n 2 + β n ( γ n x n - p 2 + c n ) = x n - p 2 - ( α n - κ ) β ^ n t n - S n t n 2 + β n ( γ n x n - p 2 + c n ) .
(3.7)

Further, it follows fron the definition of β ^ n that

z n - p 2 x n - p 2 - ( α n - κ ) β ^ n t n - S n t n 2 + β n 2 γ n x n - x 1 2 + p - x 1 2 + c n 1 + x n - x 1 2 x n - p 2 - ( α n - κ ) β ^ n t n - S n t n 2 + β n ( 2 γ n ( 1 + r 0 2 ) + c n ) x n - p 2 - ( α n - κ ) β ^ n t n - S n t n 2 + θ n ,
(3.8)

where θ n = β n ( 2 γ n ( 1 + r 0 2 ) + c n ) . Therefore, we have

B r 0 ( x 1 ) F ( S ) Ω C n , n .
(3.9)

Step 2. We claim that the sequence {x n } converges strongly to an element in C, say x*.

Since {C n } is a decreasing sequence of closed convex subset of H such that C * = n = 0 C n is a nonempty and closed convex subset of H, it follows from Lemma 2.6 that { x n + 1 } = { P C n x 1 } converges strongly to P C* x1, say x*.

Step 3. We claim that limn→∞z n = x* and limn→∞t n - Snt n = 0.

Indeed, the definition of xn+1shows that xn+1 C n , i.e.,

z n - x n + 1 2 x n - x n + 1 2 - ( α n - κ ) β ^ n t n - S n t n 2 + θ n .
(3.10)

Note that γ n → 0, c n → 0, x n x* as n → ∞ and α n > a > κ, n , we have θ n → 0, z n - xn+12 → 0, z n - x n 2 → 0 and z n x* as n → ∞.

Further, it follows from (3.10) that

( a - κ ) b 1 + x n - x 1 2 t n - S n t n 2 x n - x n + 1 2 + θ n .

Thus limn→∞t n - Snt n = 0.

Step 4. We claim that x* F(S).

Since z n = ( 1 - α n - β ^ n ) x n + α n t n + β ^ n S n t n , we have

z n - x n = ( α n + β ^ n ) ( t n - x n ) + β ^ n ( S n t n - t n )

Considering 0<a< α n + β ^ n , by Step 3 we have

t n - x n 0 , t n x * , a s n .
(3.11)

From (3.11), Lemma 2.5 and Step 3, we have

S n x * - x * S n x * - S n t n + S n t n - t n + t n - x * 0 , a s n .
(3.12)

Since S : CC is uniformly continuous, by (3.12) we have

S n + 1 x * = S ( S n x * ) S x * , a s n .

Hence, Sx* = x*, i.e., x* F(S).

Step 5. We claim that t n - y n → 0, y n x*, as n → ∞.

By (3.5), for p B r 0 ( x 1 ) F ( S ) Ω, we have

t n - p 2 x n - p 2 + ( λ n 2 L 2 - 1 ) x n - y n 2

Therefore, we have

( 1 - λ n 2 L 2 ) x n - y n 2 x n - p 2 - t n - p 2 ( x n - p + t n - p ) ( x n - p - t n - p ) ( x n - p + t n - p ) ( x n - t n ) .

This together with (3.11) and 0<1- ( 1 - a ) 2 <1- λ n 2 L 2 implies that x n - y n → 0, t n - y n → 0 and y n x*, as n → ∞.

Step 6. We claim that x* Ω.

Indeed, let

T v = A v + N C v , i f v C , , i f v C ,

where N C v be the normal cone to C at v C. We have already mentioned in Section 2 that in this case T is maximal monotone, and 0 Tv if and only if v Ω, see [18].

Let (v, w) G(T), the graph of T. Then, we have w Tv = Av + N c v and hence w - Av N C v. So, we have

v - t , w - A v 0 , t C .
(3.13)

Noticing t n = P C (x n - λ n Ay n ) and v C, by (2.1) we have

x n - λ n A y n - t n , t n - v 0 ,

and hence

v - t n , t n - x n λ n + A y n 0 .
(3.14)

From (3.13), (3.14) and t n C, we have

v - t n , w v - t n , A v v - t n , A v - v - t n , t n - x n λ n + A y n v - t n , A v - A t n + v - t n , A t n - A y n - v - t n , t n - x n λ n
(3.15)

Letting n → ∞ in (3.15), considering A : CH be a monotone, L-Lipschitz continuous mapping and {λ n } (b/L, (1-a)/L), we have 〈v-x*, w〉 ≥ 0. Since T is maxmal monotone, we have 0 Tx* and hence x* Ω = VI(C, A).

Step 7. We claim that the sequences {x n }, {y n }, and {z n } converge strongly to x* F(S)∩Ω

From Step 4 and Step 6, we have x* F(S) ∩ Ω. Therefore, it follows from Step 2, Step 3, and Step 5 that the sequences {x n }, {y n }, and {z n } converge strongly to x* F(S) ∩ Ω. This completes the proof.

Remark 3.2. Theorem 3.1 improves and extends Theorems C and D since

  1. (1)

    the nonexpansive mapping S in Theorem C is extended to be an asymptotically κ-strict pseudocontractive mapping in the intermediate sense.

  2. (2)

    the convergence condition that lim inf n A x n , y - x n 0 for all y C in Theorem D is removed.

  3. (3)

    the boundedness assumptions that the intersection F(S) ∩ Ω and the sequence {Δ n } are both bounded in Theorem D are dispensed with.

  4. (4)

    the requirement (I - A)(C) C in Theorem D is dropped off.

Corollary 3.3. Let C be a nonempty closed convex subset of a real Hilbert space H. Let S : CC be a uniformly continuous asymptotically κ-strict pseudocontractive mapping in the intermediate sense with sequence {γ n } such that F(S) is nonempty. Let {x n } and {z n } be the sequences generated by the following algorithm with variable coefficients

x 1 C c h o s e n a r b i t r a r y , z n = ( 1 - α n - β ^ n ) x n + α n x n + β ^ n S n x n , C 0 = C , C n = { z C n - 1 : z n - z 2 x n - z 2 - ( α n - κ ) β ^ n x n - S n x n 2 + θ n } , x n + 1 = P C n x 1 ,

for every n , where β ^ n = β n 1 + x n - x 1 2 , θ n = β n ( 2 γ n ( 1 + r 0 2 ) + c n ) , { α n } ( a , 1 ) , { β n } ( b , 1 - a ) , and {λ n } (b, 1 - a) for some a (κ, 1) and some b (0, 1 - a), and c n is as in (1.5), the positive real number r0 is chosen so that B r 0 ( x 1 ) F ( S ) . Then the sequences {x n } and {z n } converge strongly to a point of F(S).

Remark 3.4. Corollary 3.3 improves and extends [[4], Theorem 4.1] and Theorem D since the boundedness assumptions that the F(S) and the sequence {Δ n } are both bounded in [[4], Theorem 4.1] and Theorem D are dispensed with.

Recall that a mapping T : CC is called pseudocontractive [19, 20] if

T x - T y , x - y x - y 2 , x , y C .
(3.16)

In fact, we see that (3.16) is equivalent to

T x - T y 2 x - y 2 + ( I - T ) x - ( I - T ) y 2 , x , y C .

Corollary 3.5. Let C be a nonempty closed convex subset of a real Hilbert space H. Let T : CC be a pseudocontractive, m-Lipschitz continuous mapping and let S : CC be a uniformly continuous asymptotically κ-strict pseudocontractive mapping in the intermediate sense with sequence {γ n } such that F(S) ∩ F(T) is nonempty. Let {x n }, {y n }, and {z n } be the sequences generated by the following algorithm with variable coefficients

x 1 C c h o s e n a r b i t r a r y , y n = ( 1 - λ n ) x n + λ n T x n , t n = P C ( x n - λ n y n + λ n T y n ) , z n = ( 1 - α n - β ^ n ) x n + α n t n + β ^ n S n t n , C 0 = C , C n = { z C n - 1 : z n - z 2 x n - z 2 - ( α n - κ ) β ^ n t n - S n t n 2 + θ n } , x n + 1 = P C n x 1 ,
(3.17)

for every n , where β ^ n = β n 1 + x n - x 1 2 , θ n = β n ( 2 γ n ( 1 + r 0 2 ) + c n ) , { α n } ( a , 1 ) , { β n } ( b , 1 - a ) , and {λ n } (b/L, (1 - a)/L) for some a (κ, 1) and some b (0, 1 - a), and c n is as in (1.5), the positive real number r0 is chosen so that B r 0 ( x 1 ) F ( S ) F ( T ) . Then the sequences {x n }, {y n }, and {z n } converge strongly to a point of F(S) ∩ F(T).

Proof. The following proof of this corollary is similar to that of [[10], Theorem 4.5].

Let A = I - T. It is easy to see that y n = P C (x n - λ n Ax n ) = (1 - λ n )x n +λ n Tx n . Now let us show that the mapping A is monotone and (m + 1)-Lipschitz continuous. Indeed, observe that

A x - A y , x - y = x - y 2 - T x - T y , x - y 0 .

and

A x - A y = x - y - ( T x - T y ) ( m + 1 ) x - y .

Next, let us show that F(T) = Ω = VI(C, A). Indeed, we have, for fixed λ0 (0, 1),

T u = u A u = 0 u = u - λ 0 A u = P C ( u - λ 0 A u ) A u , y - u 0 , y C .

By Theorem 3.1, we obtain the desired conclusion. This completes the proof. □

Remark 3.6. Theorem 3.5 improves and extends [[10], Theorem 4.5] since

  1. (1)

    the convergence condition that lim inf n A x n , y - x n 0 for all y C in [[10], Theorem 4.5] is removed.

  2. (2)

    the boundedness assumptions that the intersection F(S) ∩ F(T) and the sequence {Δ n } are both bounded in [[10], Theorem 4.5] are dispensed with.

By the careful analysis of the proof of Theorem 3.1, we can obtain the following result.

Theorem 3.7. Let C be a nonempty closed convex subset of a real Hilbert space H. Let A : CH be a monotone, L-Lipschitz continuous mapping and let S : CC be a uniformly continuous asymptotically κ-strict pseudocontractive mapping in the intermediate sense with sequence {γ n } such that F(S) ∩ Ω is nonempty and bounded. Let {x n }, {y n }, and {z n } be the sequences generated by the following algorithm

x 1 C c h o s e n a r b i t r a r y , y n = P C ( x n - λ n A x n ) , t n = P C ( x n - λ n A y n ) , z n = ( 1 - α n - β n ) x n + α n t n + β n S n t n , C 0 = C C n = z C n - 1 : z n - z 2 x n - z 2 - ( α n - κ ) β n t n - S n t n 2 + θ n , x n + 1 = P C n x 1 ,

for every n , where θ n = β n ( γ n Δ n + c n ) , Δ n = sup p F ( S ) Ω x n - p 2 , { α n } ( a , 1 ) , { β n } ( b , 1 - a ) and {λ n } (b/L, (1 - a)/L) for some a (κ, 1) and some b (0, 1 - a), and c n is as in (1.5). Then the sequences {x n }, {y n } and {z n } converge strongly to a point of F(S) ∩ Ω.

Proof. Following the reasoning in the proof of Theorem 3.1, from (3.7), we take θ n = β n (γ n Δ n + c n ) and use F(S) ∩ Ω instead of B r 0 ( x 1 ) F ( S ) Ω in Step 1. From Step 2, we have the sequence {Δ n } is bounded, and hence θ n = β n (γ n Δ n + c n ) → 0 as n → ∞. The remainder of the proof of Theorem 3.7 is similar to Theorem 3.1. The conclusion therefore follows. This completes the proof.

Theorem 3.8. Let C be a nonempty closed convex subset of a real Hilbert space H. Let A : CH be a monotone, L-Lipschitz continuous mapping and let S : CC be a uniformly continuous asymptotically nonexpansive mapping in the intermediate sense such that F(S) ∩ Ω is nonempty. Let {x n }, {y n }, and {z n } be the sequences generated by the following algorithm

x 1 C c h o s e n a r b i t r a r y , y n = P C ( x n - λ n A x n ) , t n = P C ( x n - λ n A y n ) , z n = ( 1 - α n - β n ) x n + α n t n + β n S n t n , C 0 = C , C n = z C n - 1 : z n - z 2 x n - z 2 - α n β n t n - S n t n 2 + θ n , x n + 1 = P C n x 1 ,

for every n , where θ n = β n c n , {α n } (a, 1), {β n } (b, 1 - a), and {λ n } (b/L, (1 - a)/L) for some a (0, 1) and some b (0, 1 - a), and c n is as in (1.2). Then the sequences {x n }, {y n }, and {z n } converge strongly to a point of F(S) ∩ Ω.

Proof. In Theorem 3.1, whenever S : CC is an asymptotically nonexpansive mapping in the intermediate sense, we have γ n = 0, κ = 0 for all n . From (3.7), we have

z n - p 2 x n - p 2 - ( α n - κ ) β n t n - S n t n 2 + θ n ,

where θ n = β n c n . Thus, we have

F ( S ) Ω C n , n ,

and hence, the result of Step 1 holds.

Next, following the reasoning in the proof of Theorem 3.1 and using F(S) ∩ Ω instead of B r 0 ( x 1 ) F ( S ) Ω, we deduce the conclusion of Theorem 3.8. □

Remark 3.9. Theorem 3.8 improves and extends Theorem C since the nonexpansive mapping S in Theorem C is extended to be an asymptotically nonexpansive mapping in the intermediate sense.

References

  1. Goebel K, Kirk WA: A fixed point theorem for asymptotically nonexpansive mappings. Proc Am Math Soc 1972, 35(1):171–174. 10.1090/S0002-9939-1972-0298500-3

    Article  MATH  MathSciNet  Google Scholar 

  2. Bruck RE, Kuczumow T, Reich S: Convergence of iterates of asymptotically nonexpansive mappings in Banach spaces with the uniform Opial property. Colloq Math 1993, 65(2):169–179.

    MATH  MathSciNet  Google Scholar 

  3. Liu QH: Convergence theorems of the sequence of iterates for asymptotically demicontractive and hemicontractive mappings. Nolinear Anal TMA 1996, 26(11):1835–1842. 10.1016/0362-546X(94)00351-H

    Article  MATH  Google Scholar 

  4. Sahu DR, Xu HK, Yao JC: Asymptotically strict pseudocontractive mappings in the intermediate sense. Nonlinear Anal TMA 2009, 70(10):3502–3511. 10.1016/j.na.2008.07.007

    Article  MATH  MathSciNet  Google Scholar 

  5. Korpelevich GM: An extragradient method for finding saddle points and for other problems. Ekonomika i Matematicheskie Metody 1976, 12: 747–756.

    MATH  MathSciNet  Google Scholar 

  6. Takahashi W, Toyoda M: Weak convergence theorems for nonexpansive mappings and monotone mappings. J Optim Theory Appl 2003, 118(2):417–428. 10.1023/A:1025407607560

    Article  MATH  MathSciNet  Google Scholar 

  7. Nadezhkina N, Takahashi W: Weak convergence theorem by an extragradient method for nonexpansive mappings and monotone mappings. J Optim Theory Appl 2006, 128(1):191–201. 10.1007/s10957-005-7564-z

    Article  MATH  MathSciNet  Google Scholar 

  8. Zeng LC, Yao JC: Strong convergence theorem by an extragradient method for fixed point problems and variational inequality problems. Taiwan J Math 2006, 10(5):1293–1303.

    MATH  MathSciNet  Google Scholar 

  9. Nadezhkina N, Takahashi W: Strong convergence theorem by a hybrid method for nonexpansive mapping and Lipschitz-continuous monotone mappings. SIAM J Optim 2006, 16(4):1230–1241. 10.1137/050624315

    Article  MATH  MathSciNet  Google Scholar 

  10. Ceng LC, Yao JC: Strong convergence theorems for variational inequalities and fixed point problems of asymptotically strict pseudocontractive mappings in the intermediate sense. Acta Appl Math 2011, 115(2):167–191. 10.1007/s10440-011-9614-x

    Article  MATH  MathSciNet  Google Scholar 

  11. Buong N: Strong convergence theorem of an iterative method for variational inequalities and fixed point problems in Hilbert spaces. Appl Math Comput 2010, 217(1):322–329. 10.1016/j.amc.2010.05.064

    Article  MATH  MathSciNet  Google Scholar 

  12. Ceng LC, Petrusel A, Lee C, Wong MM: Two extragradient approximation methods for variational inequalities and fixed point problems of strict pseudo-contractions. Taiwan J Math 2009, 13(2A):607–632.

    MATH  MathSciNet  Google Scholar 

  13. Ge CS, Liang J, Xiao TJ: Iterative algorithms with variable coefficients for asymptotically strict pseudocontractions. Fixed Point Theory Appl 2010, 2010: 8. Article ID 948529

    MathSciNet  Google Scholar 

  14. Marino G, Xu HK: Weak and strong convergence theorems for strict pseudocontractions in Hilbert spaces. J Math Anal Appl 2007, 329(1):336–346. 10.1016/j.jmaa.2006.06.055

    Article  MATH  MathSciNet  Google Scholar 

  15. Matinez-Yanes C, Xu HK: Strong convergence of the CQ method for fixed point processes. Nolinear Anal TMA 2006, 64(11):2400–2411. 10.1016/j.na.2005.08.018

    Article  Google Scholar 

  16. Osilike MO, Igbokwe DI: Weak and strong convergence theorems for fixed points of pseudocontractions and solutions of monotone type operator equations. Comput Math Appl 2000, 40: 559–567. 10.1016/S0898-1221(00)00179-6

    Article  MATH  MathSciNet  Google Scholar 

  17. Ibaraki T, Kimura Y, Takahashi W: Convergence theorems for generalized projections and maximal monotone operators in Banach spaces. Abstr Appl Anal 2003, 2003(10):621–629. 10.1155/S1085337503207065

    Article  MATH  MathSciNet  Google Scholar 

  18. Rockafellar RT: On the maximality of sums of nonlinear monotone operators. Trans Am Math Soc 1970, 149(1):75–88. 10.1090/S0002-9947-1970-0282272-5

    Article  MATH  MathSciNet  Google Scholar 

  19. Takahashi W: Nonlinear Function Analysis. Yokohama Publishers, Yokohama; 2000.

    Google Scholar 

  20. Zhou HY: Convergence theorems of fixed points for Lipschitz Pseudo-contractions in Hilbert spaces. J Math Anal Appl 2008, 343(1):546–556. 10.1016/j.jmaa.2008.01.045

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgements

The study was supported partly by the Natural Science Foundation of Anhui Province (11040606M01), the Natural Science Foundation of Anhui Educational Committee (KJ2011Z057), and the Specialized Research Fund 2010 for the Doctoral Program of Anhui University of Architecture.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ci-Shui Ge.

Additional information

Competing interests

The authors declare that they have no competing interests.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Ge, CS. Strong convergence of iterative algorithms with variable coefficients for asymptotically strict pseudocontractive mappings in the intermediate sense and monotone mappings. Fixed Point Theory Appl 2012, 68 (2012). https://doi.org/10.1186/1687-1812-2012-68

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1687-1812-2012-68

Keywords