Skip to main content

Hybrid iterative scheme for a generalized equilibrium problems, variational inequality problems and fixed point problem of a finite family of κ i -strictly pseudocontractive mappings

Abstract

In this article, by using the S-mapping and hybrid method we prove a strong convergence theorem for finding a common element of the set of fixed point problems of a finite family of κ i -strictly pseudocontractive mappings and the set of generalized equilibrium defined by Ceng et al., which is a solution of two sets of variational inequality problems. Moreover, by using our main result we have a strong convergence theorem for finding a common element of the set of fixed point problems of a finite family of κ i -strictly pseudocontractive mappings and the set of solution of a finite family of generalized equilibrium defined by Ceng et al., which is a solution of a finite family of variational inequality problems.

1 Introduction

Let H be a real Hilbert space and let C be a nonempty closed convex subset of H. A mapping T of H into itself is called nonexpansive if Tx - Tyx - y for all x, y H. We denote by F(T) the set of fixed points of T (i.e., F(T) = {x H : Tx = x}) Goebel and Kirk [1] showed that F(T) is always closed convex, and also nonempty provided T has a bounded trajectory.

Recall the mapping T is said to be κ-strict pseudo-contration if there exist κ [0, 1) such that

T x - T y 2 x - y 2 + κ ( I - T ) x - ( I - T ) y 2 x , y D ( T ) .
(1.1)

Note that the class of κ-strict pseudo-contractions strictly includes the class of nonexpansive mappings, that is T is nonexpansive if and only if T is 0-strict pseudo-contractive. If κ = 1, T is said to be pseudo-contraction mapping. T is strong pseudo-contraction if there exists a positive constant λ (0, 1) such that T + λI is pseudo-contraction. In a real Hilbert space H (1.1) is equivalent to

T x - T y , x - y x - y 2 - 1 - κ 2 ( I - T ) x - ( I - T ) y 2 x , y D ( T ) .
(1.2)

T is pseudo-contraction if and only if

T x - T y , x - y x - y 2 x , y D ( T ) .

T is strong pseudo-contraction if there exists a positive constant λ (0, 1)

T x - T y , x - y ( 1 - λ ) x - y 2 x , y D ( T )

The class of κ-strict pseudo-contractions falls into the one between classes of nonexpansive mappings and pseudo-contraction mappings and class of strong pseudo-contraction mappings is independent of the class of κ-strict pseudo-contraction.

A mapping A of C into H is called inverse-strongly monotone, see [2] if there exists a positive real number α such that

x - y , A x - A y α A x - A y 2

for all x, y C.

The equilibrium problem for G is to determine its equilibrium points, i.e., the set

E P ( G ) = { x G : G ( x , y ) 0 , y C } .
(1.3)

Given a mapping T : CH, let G(x, y) = 〈Tx, y - x〉 for all x, y C. Then, z EP(F) if and only if 〈Tz, y - z〉 ≥ 0 for all y C, i.e., z is a solution of the variational inequality. Let A : CH be a nonlinear mapping. The variational inequality problem is to find a u C such that

v - u , A u 0
(1.4)

for all v C. The set of solutions of the variational inequality is denoted by VI(C, A).

In 2005, Combettes and Hirstoaga [3] introduced some iterative schemes of finding the best approximation to the initial data when EP(G) is nonempty and proved strong convergence theorem.

Also in [3] Combettes and Hiratoaga, following [4] define S r : HC by

S r ( x ) = { z C : G ( z , y ) + 1 r y - z , z - x 0 y C } .
(1.5)

hey proved that under suitable hypotheses G, S r is single-valued and firmly nonexpansive with F(S r ) = EP(G).

Numerous problems in physics, optimization, and economics reduce to find a element of EP(G) (see, e.g., [516])

Let CB(H) be the family of all nonempty closed bounded subsets of H and ( . , . ) be the Hausdorff metric on CB(H) defined as

( U , V ) = max sup u U d ( u , V ) , sup v V d ( U , v ) , U , V C B ( H ) ,

where d(u, V) = infvVd(u, v), d(U, v) = infuUd(u, v), and d(u, v) = u - v.

Let C be a nonempty closed convex subset of H. Let φ : C be a real-valued function, T : CCB(H) a multivalued mapping and Φ : H × C × C an equilibrium-like function, that is, Φ(w, u, v) + Φ(w, v, u) = 0 for all (w, u, v) H × C × C which satisfies the following conditions with respect to the multivalued map T : CCB(H).

(H 1) For each fixed v C, (ω, u) Φ(ω, u, v) is an upper semicontinuous function from H × C to , that is, for (ω, u) H × C, whenever ω n ω and u n u as n → ∞,

lim sup n Φ ( ω n , u n , v ) Φ ( ω , u , v ) ;

(H 2) For each fixed (w, v) H × C, u Φ(w, u, v) is a concave function;

(H 3) For each fixed (w, u) H × C, v Φ(w, u, v) is a convex function.

In 2009, Ceng et al. [17] introduced the following generalized equilibrium problem (GEP) as follows:

( GEP ) Find u C and w T ( u ) such that Φ ( w , u , v ) + φ ( v ) - φ ( u ) 0 , v C .
(1.6)

The set of such solutions u C of (GEP) is denote by (GEP) s (Φ, φ).

In the case of φ ≡ 0 and Φ(w, u, v) ≡ G(u, v), then (GEP) s (Φ, φ) is denoted by EP(G). By using Nadler's theorem they introduced the following algorithm:

Let x1 C and w1 T(x1), there exists sequences {w n } H and {x n }, {u n } C such that

w n T ( x n ) , w n - w n + 1 1 + 1 n ( T ( x n ) , T ( x n + 1 ) ) , Φ w n , u n , v + φ ( v ) - φ ( u n ) + 1 r n u n - x n , v - u n 0 , u C , x n + 1 = α n f ( x n ) + ( 1 - α n ) S u n , n = 1 , 2 , . . . .
(1.7)

They proved a strong convergence theorem of the sequence {x n } generated by (1.7) as follows:

Theorem 1.1. (See [17] ) Let C be a nonempty, bounded, closed, and convex subset of a real Hilbert space H and let φ : C be a lower semicontinuous and convex functional. Let T : CCB(H) be -Lipschitz continuous with constant μ, Φ : H × C × C be an equilibrium-like function satisfying (H1)-(H3) and S be a nonexpansive mapping of C into itself such that F ( S ) ( G E P ) s ( Φ , φ ) . Let f be a contraction of C into itself and let {x n }, {w n }, and {u n } be sequences generated by (1.7), where {α n } [0,1] and {r n } (0, ∞) satisfy

lim n α n = 0 , n = 1 α n = , n = 1 α n + 1 - α n < , lim  inf n r n > 0 a n d n = 1 r n + 1 - r n < .

If there exists a constant λ > 0 such that

Φ ( w 1 , T r 1 ( x 1 ) , T r 2 ( x 2 ) ) + Φ ( w 2 , T r 2 ( x 2 ) , T r 1 ( x 1 ) ) - λ T r 1 ( x 1 ) - T r 2 ( x 2 ) 2
(1.8)

for all (r1, r2) Ξ × Ξ,(x1, x2) C × C and w i T(x i ), i = 1, 2, where Ξ = {r n : n ≥ 1}, then for x ^ = P F ( S ) ( G E P ) s ( Φ , φ ) f ( x ^ ) , there exists w ^ T ( x ^ ) such that ( x ^ , w ^ ) is a solution of (GEP) and

x n x ^ , w n w ^ a n d u n x ^ a s n .

In 2011, Kangtunyakarn [18] proved the following theorem for strict pseudocontractive mapping in Hilbert space by using hybrid method as follows:

Theorem 1.2. Let C be a nonempty closed convex subset of a Hilbert space H. Let F and G be bifunctions from C × C into satisfying (A1)-(A4), respectively. Let A : CH be a α-inverse strongly monotone mapping and let B : CH be a β-inverse strongly monotone mapping. Let T : CC be a κ-strict pseudo-contraction mapping with F=F ( T ) EP ( F , A ) EP ( G , B ) . Let {x n } be a sequence generated by x1 C = C1 and

F ( u n , u ) + ( A x n , u - u n ) + 1 r n u - u n , u n - x n 0 , u C , G ( v n , v ) + ( B x n , v - v n ) + 1 s n v - v n , v n - x n 0 , v C , z n = δ n u n + ( 1 - δ n ) v n y n = α n z n + ( 1 - α n ) T z n C n + 1 = z C n : y n - z x n - z , x n + 1 = P C n + 1 x 1 , n 1 ,
(1.9)

where { α n } n = 0 is sequence in [0,1], r n [a, b] (0, 2α) and s n [c, d] (0, 2β) satisfy the following condition:

( i ) lim n δ n = δ ( 0 , 1 ) ( i i ) 0 κ α n < 1 , n 1

Then x n converges strongly to P F x 1 .

From motivation of (1.7) and (1.9), we define the following algorithm as follows:

Algorithm 1.3. Let T i , i = 1,2,...,N, be κ i -pseudo contraction mappings of C into itself and κ = max{κ i : i = 1,2,..., N} and let S n be the S-mappings generated by T1, T2, ..., T N and α 1 ( n ) , α 2 ( n ) ,..., α N ( n ) where α j ( n ) = α 1 n , j , α 2 n , j , α 3 n , j I×I×I,I= [ 0 , 1 ] , α 1 n , j + α 2 n , j + α 3 n , j =1 and κ<a α 1 n , j , α 3 n , j b<1 for all j=1,2,...,N-1,κ<c α 1 n , N 1,κ α 3 n , N d<1,κ α 2 n , j e<1 for all j = 1,2,...,N. Let x1 C = C1 and w 1 1 T ( x 1 ) , w 1 2 D ( x 1 ) , there exists sequence { w n 1 } , { w n 2 } H and {x n }, {u n }, {v n } C such that

w n 1 T ( x n ) , w n 1 - w n + 1 1 1 + 1 n ( T ( x n ) , T ( x n + 1 ) ) , w n 2 D ( x n ) , w n 2 - w n + 1 2 1 + 1 n ( D ( x n ) , D ( x n + 1 ) ) , Φ 1 w n 1 , u n , u + φ 1 ( u ) - φ 1 ( u n ) + 1 r n u n - x n , u - u n 0 , u C , Φ 2 w n 2 , v n , v + φ 2 ( v ) - φ 2 ( v n ) + 1 s n v n - x n , v - v n 0 , v C , z n = δ n P C ( I - λ A ) u n + ( 1 - δ n ) P C ( I - η B ) v n , y n = α n z n + ( 1 - α n ) S n z n , C n + 1 = z C n : y n - z x n - z , x n + 1 = P C n + 1 x 1 , n 1 .
(1.10)

where D, T : CCB(H) are -Lipschitz continuous with constant μ1, μ2, respectively, Φ1, Φ2 : H × C × C are equilibrium-like functions satisfying (H 1)-(H 3), A : CH is a α-inverse strongly monotone mapping and B : CH is a β-inverse strongly monotone mapping.

In this article, we prove under some control conditions on {δ n }, {α n }, {s n }, and {r n } that the sequence {x n } generated by (1.7) converges strongly to P F x 1 where F= i = 1 N F ( T i ) ( G E P ) s ( Φ 1 , φ 1 ) ( G E P ) s ( Φ 2 , φ 2 ) F ( G 1 ) F ( G 2 ) , G1, G2 : CC are defined by G1(x) = P C (x - λAx), G2(x) = P C (x - ηBx), x C and P F x 1 is solution of the following system of variational inequality:

A x * , x - x * 0 , B x * , x - x * 0 .

2 Preliminaries

In this section, we need the following lemmas and definition to prove our main result.

Let C be a nonempty closed convex subset of H. Then for any x H, there exists a unique nearest point in C, denoted by P C x, such that

x - P C x x - y , for all y C .

The following lemma is a property of P C .

Lemma 2.1. (See [19].) Given x H and y C. Then P C x = y if and only if there holds the inequality

x - y , y - z 0 z C .

Lemma 2.2. (See [20] ) Let C be a closed convex subset of a strictly convex Banach space E. Let {T n : n } be a sequence of nonexpansive mappings on C. Suppose n = 1 F ( T n ) is nonempty. Let {λ n } be a sequence of positive numbers with n = 1 λ n =1. Then a mapping S on C defined by

S ( x ) = n = 1 λ n T n x

for x C is well defined, nonexpansive and F ( S ) = n = 1 F ( T n ) hold.

The following lemma is well known.

Lemma 2.3. Let H be Hilbert space, C be a nonempty closed convex subset of H. Let T : CC be a κ-strictly pseudo-contractive, then the fixed point set F(T) of T is closed and convex so that the projection PF(T)is well defined.

In 2009, Kangtunyakarn and Suantai [21] introduced the S-mapping generated by a finite family of κ-strictly pseudo contractive mappings and real numbers as follows:

Definition 2.1. Let C be a nonempty convex subset of real Hilbert space. Let { T i } i = 1 N be a finite family of κ i -strict pseudo-contractions of C into itself. For each j = 1,2,..., N, let α j = ( a 1 j , α 2 j , α 3 j ) I×I×I where I [0,1] and α 1 j + α 2 j + α 3 j =1. We define the mapping S : CC as follows:

U 0 = I U 1 = α 1 1 T 1 U 0 + α 2 1 U 0 + α 3 1 I U 2 = α 1 2 T 2 U 1 + α 2 2 U 1 + α 3 2 I U 3 = α 1 3 T 3 U 2 + α 2 3 U 2 + α 3 3 I U N - 1 = α 1 N - 1 T N - 1 U N - 2 + α 2 N - 1 U N - 2 + α 3 N - 1 I S = U N = α 1 N T N U N - 1 + α 2 N U N - 1 + α 3 N I .
(2.1)

This mapping is called S-mapping generated by T1, ..., T N and α1, α2, ..., α N .

Lemma 2.4. (See [21] ) Let C be a nonempty closed convex subset of real Hilbert space. Let { T i } i = 1 N be a finite family of κ-strict pseudo contraction mapping of C into C with i = 1 N F ( T i ) and κ = max{κ i : i = 1, 2,..., N} and let α j = ( a 1 j , α 2 j , α 3 j ) I×I×I, j = 1,2,3,...,N, where I= [ 0 , 1 ] , α 1 j + α 2 j + α 3 j =1, α 1 j , α 3 j ( κ , 1 ) for all j = 1,2,...,N - 1 and α 1 N ( κ , 1 ] , α 3 N [ κ , 1 ) α 2 j [ κ , 1 ) for all j = 1,2,..., N. Let S be the mapping generated by T1,....,T N and α1, α2,...,α N . Then F ( S ) = i = 1 N F ( T i ) and S is a nonexpansive mapping.

Lemma 2.5. (See [22] ) Let C be a nonempty closed convex subset of a real Hilbert space H and S : CC be a self-mapping of C. If S is a κ-strict pseudo-contraction mapping, then S satisfies the Lipschitz condition

S x - S y 1 + κ 1 - κ x - y , x , y C .

We prove the following lemma by using the concept of the S-mapping as follows:

Lemma 2.6. Let C be a nonempty closed convex subset of a real Hilbert space H. Let T i , i = 1,2,...,N be κ i strictly pseudo-contraction mappings of C into itself and κ = max{κ i : i = 1,2,...,N} and let α j ( n ) = ( α 1 n , j , α 2 n , j , α 3 n , j ) , α j = ( α 1 j , α 2 j , α 3 j ) I×I×I, where I= [ 0 , 1 ] , α 1 n , j + α 2 n , j + α 3 n , j =1 and α 1 j + α 2 j + α 3 j =1 such that α i n , j α i j [ 0 , 1 ] as n → ∞ for i = 1, 3 and j = 1,2,3,..., N. For every n , let S and S n be the S-mapping generated by T1, T2,..., T N and α1, α2,...,α N and T1, T2,..., T N and α 1 ( n ) , α 2 ( n ) ,, α N ( n ) , respectively. Then limn→∞S n x n - Sx n = 0 for every bounded sequence {x n } in C.

Proof. Let {x n } be bounded sequence in C, U k and Un,kbe generated by T1,T2,...,T N and α1,α2,...,α N and T1,T2,...,T N and α 1 ( n ) , α 2 ( n ) ,, α N ( n ) , respectively. For each n , we have

U n , 1 x n - U 1 x n = α 1 n , 1 T 1 x n + ( 1 - α 1 n , 1 ) x n - α 1 1 T 1 x n - ( 1 - α 1 1 ) x n = α 1 n , 1 T 1 x n - α 1 n , 1 x n - α 1 1 T 1 x n + α 1 1 x n = ( α 1 n , 1 - α 1 1 ) T 1 x n - ( α 1 n , 1 - α 1 1 ) x n = a 1 n , 1 - α 1 1 T 1 x n - x n
(2.2)

and for k {2, 3,..., N}, by using Lemma 2.5, we obtain

U n , k x n - U k x n = α 1 n , k T k U n , k - 1 x n + α 2 n , k U n , k - 1 x n + α 3 n , k x n - α 1 k T k U k - 1 x n - α 2 k U k - 1 x n - α 3 k x n = α 1 n , k T k U n , k - 1 x n + α 3 n , k x n - α 1 k T k U k - 1 x n - α 3 k x n + α 2 n , k U n , k - 1 x n - α 2 k U k - 1 x n = α 1 n , k T k U n , k - 1 x n - α 1 n , k T k U k - 1 x n + α 1 n , k T k U k - 1 x n - α 1 k T k U k - 1 x n + ( α 3 n , k - α 3 k ) x n + α 2 n , k U n , k - 1 x n - α 2 k U k - 1 x n = α 1 n , k ( T k U n , k - 1 x n - T k U k - 1 x n ) + ( α 1 n , k - α 1 k ) T k U k - 1 x n + ( α 3 n , k - α 3 k ) x n + α 2 n , k U n , k - 1 x n - α 2 k U k - 1 x n = α 1 n , k ( T k U n , k - 1 x n - T k U k - 1 x n ) + ( α 1 n , k - α 1 k ) T k U k - 1 x n + ( α 3 n , k - α 3 k ) x n + α 2 n , k U n , k - 1 x n - α 2 n , k U k - 1 x n + α 2 n , k U k - 1 x n - α 2 k U k - 1 x n = α 1 n , k ( T k U n , k - 1 x n - T k U k - 1 x n ) + ( α 1 n , k - α 1 k ) T k U k - 1 x n + ( α 3 n , k - α 3 k ) x n + α 2 n , k ( U n , k - 1 x n - U k - 1 x n ) + ( α 2 n , k - α 2 k ) U k - 1 x n α 1 n , k T k U n , k - 1 x n - T k U k - 1 x n + α 1 n , k - α 1 k T k U k - 1 x n + α 3 n , k - α 3 k x n + α 2 n , k U n , k - 1 x n - U k - 1 x n + α 2 n , k - α 2 k U k - 1 x n = α 1 n , k T k U n , k - 1 x n - T k U k - 1 x n + α 1 n , k - α 1 k T k U k - 1 x n + α 2 n , k U n , k - 1 x n - U k - 1 x n + 1 - α 1 n , k - α 3 n , k - 1 + α 1 k + α 3 k U k - 1 x n + α 3 n , k - α 3 k x n α 1 n , k 1 + κ 1 - κ U n , k - 1 x n - U k - 1 x n + α 1 n , k - α 1 k T k U k - 1 x n + α 2 n , k U n , k - 1 x n - U k - 1 x n + α 1 k - α 1 n , k + α 3 n , k - α 3 k U k - 1 x n + α 3 n , k - α 3 k x n 1 + κ 1 - κ U n , k - 1 x n - U k - 1 x n + α 1 n , k - α 1 k T k U k - 1 x n + 1 - κ 1 - κ U n , k - 1 x n - U k - 1 x n + α 1 k - α 1 n , k + α 3 n , k - α 3 k U k - 1 x n + α 3 n , k - α 3 k x n 2 1 - κ U n , k - 1 x n - U k - 1 x n + α 1 n , k - α 1 k T k U k - 1 x n + U k - 1 x n + α 3 n , k - α 3 k U k - 1 x n + x n .
(2.3)

By (2.2) and (2.3), we have

S n x n - S x n = U n , N x n - U N x n 2 1 - κ U n , N - 1 x n - U N - 1 x n + α 1 n , N - α 1 N T N U N - 1 x n + U N - 1 x n + α 3 n , N - α 3 N U N - 1 x n + x n 2 1 - κ 2 1 - κ U n , N - 2 x n - U N - 2 x n + α 1 n , N - 1 - α 1 N - 1 T N - 1 U N - 2 x n + U N - 2 x n + α 3 n , N - 1 - α 3 N - 1 U N - 2 x n + x n + α 1 n , N - α 1 N T N U N - 1 x n + U N - 1 x n + α 3 n , N - α 3 N U N - 1 x n + x n = 2 1 - κ 2 U n , N - 2 x n - U N - 2 x n + j = N - 1 N 2 1 - κ N - j α 1 n , j - α 1 j T j U j - 1 x n + U j - 1 x n + j = N - 1 N 2 1 - κ N - j α 3 n , j - α 3 j U j - 1 x n + x n 2 1 - κ N - 1 U n , 1 x n - U 1 x n + j = 2 N 2 1 - κ N - j α 1 n , j - α 1 j T j U j - 1 x n + U j - 1 x n + j = 2 N ( 2 1 - κ ) N - j α 3 n , j - α 3 j U j - 1 x n + x n = 2 1 - κ N - 1 α 1 n , 1 - α 1 1 T 1 x n - x n + j = 2 N 2 1 - κ N - j α 1 n , j - α 1 j T j U j - 1 x n + U j - 1 x n + j = 2 N 2 1 - κ N - j α 3 n , j - α 3 j U j - 1 x n + x n .

This together with the assumption α i n , j α i j as n → ∞ (i = 1, 3, j = 1,2,..., N), we can conclude that

lim n S n x n - S x n = 0 .

Lemma 2.7. (See [23]) Let E be a uniformly convex Banach space, C be a nonempty closed convex subset of E and S : CC be a nonexpansive mapping. Then I - S is demi-closed at zero.

Lemma 2.8. (See [24]) Let C be a closed convex subset of H. Let {x n } be a sequence in H and u H. Let q = P C u, if {x n } is such the ω(x n ) C and satisfy the condition

x n - u u - q , n .

Then x n q, as n → ∞.

Definition 2.2. A multivalued map T : CCB(H) is say to be -Lipschitz continuous if there exists a constant μ > 0 such that

( T ( u ) - T ( v ) ) μ u - v , u , v C ,

where ( . , . ) is the Hausdorff metric on CB(H).

Lemma 2.9. (Nadler's theorem, see [25]) Let (X, ) be a normed vector space and ( . , . ) is the Hausdorff metric on CB(H). If U, V CB(X), then for any given ϵ > 0 and u U, there exists v V such that

u - v ( 1 + ε ) ( U , V ) .

Let C be a nonempty closed convex subset of a real Hilbert space H. Let φ: CH be a real-valued function, T : CCB(H) be a multivalued map and Φ : H × C × C be an equilibrium-like function.

To solve the GEP, let us assume that the equilibrium-like function Φ : H × C × C satisfies the following conditions with respect to the multivalued map T: CCB(H).

(H 1) For each fixed v C, (ω, u) Φ(ω, u, v) is an upper semicontinuous function from H × C to , that is, for (ω, u) H × C, whenever ω n ω and u n u as n → ∞,

lim sup n Φ ( ω n , u n , v ) Φ ( ω , u , v ) ;

(H 2) For each fixed (w, v) H × C, u Φ(w, u, v) is a concave function;

(H 3) For each fixed (w, u) H × C, v Φ(w, u, v) is a convex function.

Theorem 2.10. (See [17]) Let C be a nonempty, bounded, closed, and convex subset of a real Hilbert space H, and let φ : C be a lower semicontinuous and convex functional. Let T : CCB(H) be -Lipschitz continuous with constant μ, and Φ : H × C × C be an equilibrium-like function satisfying (H 1)-(H 3). Let r > 0 be a constant. For each x C, take w x T(x) arbitrarily and define a mapping T r : CC as follows:

T r ( x ) = u C : Φ ( w x , u , v ) + φ ( v ) - φ ( u ) + 1 r u - x , v - u 0 , v C .

Then, there hold the following:

(a) T r is single-valued;

(b) T r is firmly nonexpansive (that is, for any u, v C, T r u - T r v2 ≤ 〈T r u-T r v, u-v〉) if

Φ ( w 1 , T r ( x 1 ) , T r ( x 2 ) ) + Φ ( w 2 , T r ( x 2 ) , T r ( x 1 ) ) 0 ,

for all (x1, x2) C × C and all w i T(xi), i = 1,2;

(c) F(T r ) = (GEP) s (Φ, φ)

(d) (GEP) s (Φ, φ) is closed and convex.

Lemma 2.11. (See [26]) Let C be a nonempty closed convex subset of a Hilbert space H and let G : CC be defined by

G ( x ) = P C ( x - λ A x ) , x C ,

with λ > 0. Then x* VI (C, A) if and only if x* F(G).

3 Main results

In this section, we prove a strong convergence theorem of the sequence {x n } generated by (1.10) to P F x 1 .

Theorem 3.1. Let C be a nonempty bounded, closed, and convex subset of Hilbert space H and let φ1, φ2 : be a lower semicontinuous and convex function. Let D, T : CCB(H) be -Lipschitz continuous with constant μ1, μ2, respectively, Φ12: H × C × C be equilibrium-like functions satisfying (H 1) - (H3). Let A: CH be a α-inverse strongly monotone mapping and B : CH be a β-inverse strongly monotone mapping, let T i , i = 1,2,...,N, be κ i -pseudo contraction mappings of C into itself and κ = max{κ i :i = 1,2,..., N} with F= i = 1 N F ( T i ) ( G E P ) s ( Φ 1 , φ 1 ) ( G E P ) s ( Φ 2 , φ 2 ) F ( G 1 ) F ( G 2 ) , where G1, G2 : CC are defined by G1(x) P C (x-λAx), G2(x) = P C (x-ηBx), x C. Let S n be the S-mappings generated by T1,T2,...,T N and α 1 ( n ) , α 2 ( n ) ,..., α N ( n ) where α j ( n ) = α 1 n , j , α 2 n , j , α 3 n , j I×I×I,I= [ 0 , 1 ] , α 1 n , j + α 2 n , j + α 3 n , j =1 and κ<a α 1 n , j , α 3 n , j b<1 for all j=1,2,...,N-1,κ<c α 1 n , N 1,κ α 3 n , N d<1,κ α 2 n , j e<1 for all j = 1,2,...,N and let {x n }, {u n }, {v n }, { w n 1 } , and { w n 2 } be sequences generated by (1.10), where {α n } is a sequence in [0,1], r n , λ [a, b] (0, ) and s n , η [c, d] (0, 2β), for every n and suppose the following conditions hold:

(i) lim n δ n =δ ( 0 , 1 ) ,

(ii) 0 ≤ κα n < 1, n ≥ 1,

(iii) n = 1 α 1 n + 1 , j - α 1 n , j <, n = 1 α 3 n + 1 , j - α 3 n , j <, for all j {1,2,3,...,N}.

(iv) There exists λ1, λ2 such that

Φ 1 ( w 1 1 , T r 1 ( x 1 ) , T r 2 ( x 2 ) ) + Φ 1 ( w 2 1 , T r 2 ( x 2 ) , T r 1 ( x 1 ) ) - λ 1 T r 1 ( x 1 ) - T r 2 ( x 2 ) 2 a n d Φ 2 ( w 1 2 , T s 1 ( x 1 ) , T s 2 ( x 2 ) ) + Φ 2 ( w 2 2 , T s 2 ( x 2 ) , T s 1 ( x 1 ) ) - λ 2 T s 1 ( x 1 ) - T s 2 ( x 2 ) 2
(3.1)

for all ( r 1 , r 2 ) Θ×Θ, ( s 1 , s 2 ) Ξ×Ξ, w i 1 T ( x i ) and w i 2 D ( x i ) , for i = 1,2 where Θ = {r n : n ≥ 1} and Ξ = {s n : n ≥ 1}. Then {x n } converges strongly to P F x 1 which is a solution of (3.2):

A x * , x - x * 0 , B x * , x - x * 0 .
(3.2)

Proof. From (3.1) for every r Θ, we have

Φ 1 ( w 1 1 , T r ( x 1 ) , T r ( x 2 ) ) + Φ 1 ( w 2 1 , T r ( x 2 ) , T r ( x 1 ) ) - λ 1 T r ( x 1 ) - T r ( x 2 ) 2 0 ,
(3.3)

for all (x1, x2) C × C and w i 1 T ( x i ) ,i=1,2.

Similarly, for every s Ξ, we have

Φ 2 ( w 1 2 , T s ( x 1 ) , T s ( x 2 ) ) + Φ 2 ( w 2 2 , T s ( x 2 ) , T s ( x 1 ) ) - λ 2 T s ( x 1 ) - T s ( x 2 ) 2 0 .
(3.4)

for all (x1, x2) C × C and w i 2 D ( x i ) ,i=1,2. From (3.3) and (3.4), we have Theorem 2.10 hold.

It is easy to see that I - λ A and I - η B are nonexpansive mapping. Indeed, since A is a α-inverse strongly monotone mapping with λ (0, 2α), we have

( I - λ A ) x - ( I - λ A ) y 2 = x - y - λ ( A x - A y ) 2 = x - y 2 - 2 λ x - y , A x - A y + λ 2 A x - A y 2 x - y 2 - 2 α λ A x - A y 2 + λ 2 A x - A y 2 = x - y 2 + λ ( λ - 2 α ) A x - A y 2 x - y 2 .

Thus (I - λA) is nonexpansive, so is I - ηB. Since

Φ 1 ( w n 1 , u n , u ) + φ 1 ( u ) - φ 1 ( u n ) + 1 r n u n - x n , u - u n 0 , u C ,

and Theorem 2.10, we have u n = T r n x n . Since

Φ 2 ( w n 2 , v n , v ) + φ 2 ( v ) - φ 2 ( v n ) + 1 s n v n - x n , v - v n 0 , v C ,

and Theorem 2.10, we have v n = T s n x n . Let zF, again by Theorem 2.10, we have z= T r n z= T s n z= P C ( I - λ A ) z= P C ( I - η B ) z. From nonexpansiveness of { T r n } , { T s n } , { I - λ A } , and {I - ηB}, we have

z n - z = δ n ( P C ( I - λ A ) u n - z ) + ( 1 - δ n ) ( P C ( I - η B ) v n - z ) δ n P C ( I - λ A ) u n - z + ( 1 - δ n ) P C ( I - η B ) v n - z δ n T r n x n - z + ( 1 - δ n ) T s n x n - z x n - z .
(3.5)

By (3.5), we have

y n - z = α n ( z n - z ) + ( 1 - α n ) ( S n z n - z ) α n z n - z + ( 1 - α n ) S n z n - z z n - z x n - z .
(3.6)

Next, we show that C n is closed and convex for every n . It is obvious that C n is closed. In fact, we know that, for z C n ,

y n - z x n - z is equivalent to y n - x n 2 + 2 y n - x n , x n - z 0 .

So, we have that z1, z2 C n and t (0,1), it follows that

y n - x n 2 + 2 y n - x n , x n - ( t z 1 + ( 1 - t ) z 2 ) = t ( 2 y n - x n , x n - z 1 + y n - x n 2 ) + ( 1 - t ) ( 2 y n - x n , x n - z 2 + y n - x n 2 ) 0 ,

then, we have C n is convex. By Theorem 2.10 and Lemma 2.3, we conclude that F is closed and convex. This implies that P F is well defined. Next, we show that F C n for every n . Putting qF, by (3.6), it is easy to see that q C n , then we have F C n for all n . Since x n = P C n x 1 , for every w C n , we have

x n - x 1 w - x 1 , n .
(3.7)

In particular, we have

x n - x 1 P F x 1 - x 1 .
(3.8)

Since C is bounded, we have {x n } is bounded, so are {u n }, {v n }, {z n }, and {y n }. Since x n + 1 = P C n + 1 x 1 C n + 1 C n and x n = P C n x 1 , we have

0 x 1 - x n , x n - x n + 1 = x 1 - x n , x n - x 1 + x 1 - x n + 1 - x n - x 1 2 + x n - x 1 x 1 - x n + 1 ,

it implies that

x n - x 1 x n + 1 - x 1 .

Hence, we have limn→∞x n - x1 exists. Since

x n - x n + 1 2 = x n - x 1 + x 1 - x n + 1 2 = x n - x 1 2 + 2 x n - x 1 , x 1 - x n + 1 + x 1 - x n + 1 2 = x n - x 1 2 + 2 x n - x 1 , x 1 - x n + x n - x n + 1 + x 1 - x n + 1 2 = x n - x 1 2 - 2 x n - x 1 2 + 2 x n - x 1 , x n - x n + 1 + x 1 - x n + 1 2 x 1 - x n + 1 2 - x n - x 1 2 ,
(3.9)

it implies that

lim n x n - x n + 1 = 0 .
(3.10)

Since x n + 1 = P C n + 1 x 1 C n + 1 , we have

y n - x n + 1 x n - x n + 1 ,

by (3.10), we have

lim n y n - x n + 1 = 0 .
(3.11)

Since

y n - x n y n - x n + 1 + x n + 1 - x n ,

by (3.10) and (3.11), we have

lim n y n - x n = 0 .
(3.12)

Next, we show that

lim n z n - S n z n = 0 .
(3.13)

By definition of y n , we have

y n - z n = ( 1 - α n ) ( S n z n - z n ) .
(3.14)

Claim that

lim n z n - x n = 0 .
(3.15)

Putting M n = P C (I - λA)u n and N n = P C (I - ηB)v n , we have

z n - x n δ n M n - x n + ( 1 - δ n ) N n - x n .
(3.16)

Let zF. Since T r n is firmly nonexpansive mapping and T r n x n = u n , we have

z - u n 2 = T r n z - T r n x n 2 T r n z - T r n x n , z - x n = 1 2 ( u n - z 2 + x n - z 2 - u n - x n 2 ) .

Hence

u n - z 2 x n - z 2 - u n - x n 2 .
(3.17)

Since T r n is firmly nonexpansive mapping and T s n x n = v n , by using the same method as (3.17), we have

v n - z 2 x n - z 2 - v n - x n 2 .
(3.18)

By nonexpansiveness of S n and (3.17), (3.18), we have

y n - z 2 z n - z 2 δ n u n - z 2 + ( 1 - δ n ) v n - z 2 δ n ( x n - z 2 - u n - x n 2 ) + ( 1 - δ n ) ( x n - z 2 - v n - x n 2 ) = x n - z 2 - δ n u n - x n 2 - ( 1 - δ n ) v n - x n 2 ,

it implies that

δ n u n - x n 2 x n - z 2 - y n - z 2 - ( 1 - δ n ) v n - x n 2 x n - z 2 - y n - z 2 ( x n - z + y n - z ) x n - y n ,

by (3.12) and condition (i), we have

lim n u n - x n = 0 .
(3.19)

By using the same method as (3.19), we have

lim n v n - x n = 0 .
(3.20)

Since

y n - z 2 α n z n - z 2 + ( 1 - α n ) z n - z 2 α n x n - z 2 + ( 1 - α n ) z n - z 2 α n x n - z 2 + ( 1 - α n ) δ n M n - z 2 + ( 1 - δ ) N n - z 2
(3.21)

Claim that

lim n A u n - A z = lim n B v n - B z = 0 .

By nonexpansiveness of P C , we have

y n z 2 z n z 2 δ n P C ( I λ A ) u n P C ( I λ A ) z 2 + ( 1 δ n ) P C ( I η B ) v n P C ( I η B ) z 2 δ n ( I λ A ) u n ( I λ A ) z 2 + ( 1 δ n ) ( I η B ) v n ( I η B ) z 2 δ n ( u n λ A u n ( z λ A z ) 2 + ( 1 δ n ) ( v n η B v n ( z η B z ) 2 = δ n ( u n z ) λ ( A u n A z ) 2 + ( 1 δ n ) ( v n z ) η ( B v n B z ) 2 = δ n ( u n z 2 + λ 2 A u n A z 2 2 λ u n z , A u n A z ) + ( 1 δ n ) ( v n z 2 + η 2 B v n B z 2 2 η v n z , B v n B z ) δ n ( u n z 2 + λ 2 A u n A z 2 2 λ α A u n A z 2 ) + ( 1 δ n ) ( v n z 2 + η 2 B v n B z 2 2 η β B v n B z 2 ) δ n ( x n z 2 + λ ( λ 2 α ) A u n A z 2 ) + ( 1 δ n ) ( x n z 2 + η ( η 2 β ) B v n B z 2 ) = x n z 2 δ n λ ( 2 α λ ) A u n A z 2 ( 1 δ n ) η ( 2 β η ) B v n B z 2 ,

it follows that

δ n λ ( 2 α - λ ) A u n - A z 2 x n - z 2 - y n - z 2 - ( 1 - δ n ) η ( 2 β - η ) B v n - B z 2 ( x n - z + y n - z ) y n - x n ,
(3.22)

by conditions (i), (ii), λ (0, 2α) and (3.12), it implies that

lim n A u n - A z = 0 .
(3.23)

By using the same method as (3.23), we have

lim n B v n - B z = 0 .
(3.24)

By nonexpansiveness of T r n , we have

M n z 2 = P C ( u n λ A u n ) P C ( z λ A z ) 2 ( u n λ A u n ) ( z λ A z ) , M n z = 1 2 ( ( u n λ A u n ) ( z λ A z ) 2 + M n z 2 ( u n λ A u n ) ( z λ A z ) ( M n z ) 2 ) 1 2 ( u n z 2 + M n z 2 ( u n M n ) λ ( A u n A z ) 2 ) = 1 2 ( T r n x n T r n z 2 + M n z 2 u n M n 2 + 2 λ u n M n , A u n A z λ 2 A u n A z 2 ) 1 2 ( x n z 2 + M n z 2 u n M n 2 + 2 λ u n M n , A u n A z λ 2 A u n A z 2 ) .

Hence, we have

M n - z 2 x n - z 2 - u n - M n 2 + 2 λ u n - M n , A u n - A z - λ 2 A u n - A z 2 .
(3.25)

By using the same method as (3.25), we have

N n - z 2 x n - z 2 - v n - N n 2 + 2 η v n - N n , B v n - B z - η 2 B v n - B z 2 .
(3.26)

Substitute (3.25) and (3.26) in (3.21), we have

y n z 2 α n x n z 2 + ( 1 α n ) ( δ n M n z 2 + ( 1 δ n ) N n z 2 ) α n x n z 2 + ( 1 α n ) ( δ n ( x n z 2 u n M n 2 + 2 λ u n M n , A u n A z λ 2 A u n A z 2 ) + ( 1 + δ n ) ( x n z 2 v n N n 2 + 2 η v n N n , B v n B z η 2 B v n B z 2 ) ) α n x n z 2 + ( 1 α n ) ( δ n x n z 2 δ n u n M n 2 + 2 λ δ n u n M n , A u n A z + ( 1 δ n ) x n z 2 ( 1 δ n ) v n N n 2 + 2 η ( 1 δ n ) v n N n , B v n B z ) = α n x n z 2 + ( 1 α n ) ( x n z 2 δ n u n M n 2 + 2 λ δ n u n M n , A u n A z ( 1 δ n ) v n N n 2 + 2 η ( 1 δ n ) v n N n , B v n B z ) = α n x n z 2 + ( 1 α n ) x n z 2 ( 1 α n ) δ n u n M n 2 + 2 ( 1 α n ) λ δ n u n M n , A u n A z ( 1 δ n ) ( 1 α n ) v n N n 2 + 2 η ( 1 δ n ) ( 1 α n ) v n N n , B v n B z = x n z 2 ( 1 α n ) δ n u n M n 2 + 2 ( 1 α n ) λ δ n u n M n , A u n A z ( 1 δ n ) ( 1 α n ) v n N n 2 + 2 η ( 1 δ n ) ( 1 α n ) v n N n , B v n B z ,

it implies that

( 1 - α n ) δ n u n - M n 2 x n - z 2 - y n - z 2 + 2 ( 1 - α n ) λ δ n u n - M n , A u n - A z - ( 1 - δ n ) ( 1 - α n ) v n - N n 2 + 2 η ( 1 - δ n ) ( 1 - α n ) v n - N n , B v n - B z ( x n - z + y n - z ) y n - x n + 2 ( 1 - α n ) λ δ n u n - M n , A u n - A z + 2 η ( 1 - δ n ) ( 1 - α n ) v n - N n , B v n - B z ,
(3.27)

from (3.12), (3.23), (3.24) and conditions (i) and (ii), we have

lim n u n - M n = 0 .
(3.28)

By using the same method as (3.28), we have

lim n v n - N n = 0 .
(3.29)

By (3.19) and (3.28), we have

lim n M n - x n = 0 .
(3.30)

By (3.20) and (3.29), we have

lim n N n - x n = 0 .
(3.31)

From (3.16), (3.30) and (3.31), we have

lim n z n - x n = 0 .
(3.32)

From (3.12) and (3.32), we have

lim n y n - z n = 0 .
(3.33)

From (3.14), (3.33) and condition (i), we have (3.13).

Let a (0,1), by (3.10) there exists N0 such

x n + 1 - x n < a n , n N 0 .
(3.34)

Thus, for any number n, p , p > 0, we have

x n + p - x n k = n n + p - 1 x k + 1 - x k k = n n + p - 1 a k a n 1 - a .
(3.35)

Since a (0,1), we have limn→∞an= 0. By (3.35), we have {x n } is Cauchy sequence in Hilbert space. Let limn→∞x n = x*. Since T : CCB(H) be -Lipschitz continuous with constant μ1 and (1.10), we have

w n 1 - w n + 1 1 ( 1 + 1 n ) ( T ( x n ) , T ( x n + 1 ) ) ( 1 + 1 n ) μ 1 x n + 1 - x n .
(3.36)

By (3.34) and for any number n, p , p > 0, we have

w n + p 1 - w n 1 k = n n + p - 1 w k + 1 1 - w k 1 k = n n + p - 1 1 + 1 k μ 1 x k + 1 - x k k = n n + p - 1 2 μ 1 a k 2 μ 1 a n 1 - a .
(3.37)

Since a (0,1), we have limn→∞an= 0. By (3.37), we have { w n 1 } is cauchy sequence in Hilbert space. Let lim n w n 1 = w 1 * . Next, we will prove that w 1 * T ( x * ) . Since w n 1 T ( x n ) , we have

d ( w n 1 , T ( x * ) ) max d ( w n 1 , T ( x * ) ) , sup w 1 T ( x * ) d ( T ( x n ) , w 1 ) max sup z T ( x n ) d ( z , T ( x * ) ) , sup w 1 T ( x * ) d ( T ( x n ) , w 1 ) = ( T ( x n ) , T ( x * ) ) .
(3.38)

Since

d ( w 1 * , T ( x * ) ) w 1 * - w n 1 + d ( w n 1 , T ( x * ) ) w 1 * - w n 1 + ( T ( x n ) , T ( x * ) ) w 1 * - w n 1 + μ 1 x n - x * ,

by limn→∞x n = x* and lim n w n 1 = w 1 * , we have d ( w 1 * , T ( x * ) ) =0, this implies that w 1 * T ( x * ) . By using the same method as above, we have lim n w n 2 = w 2 * and w 2 * D ( x * ) .

Let ω(x n ) be the set of all weakly ω-limit of {x n }. We shall show that ω ( x n ) F. Since {x n } is bounded, then ω ( x n ) . Let q ω(x n ), there exists a subsequence { x n i } of {x n } converse weakly to q. Since {x n } is a Cauchy sequence in Hilbert space, we have x n i q as {i → ∞}, it implies that x n q as n → ∞. Since limn→ ∞x n = x* and limn→∞x n = q, we have x* = q, then we have w 1 * T ( q ) and w 2 * D ( q ) . From (3.19) and x n q as n → ∞, we have u n q as n → ∞.

By u n = T r n x n , we have

Φ 1 ( w n 1 , u n , u ) + φ 1 ( u ) - φ 1 ( u n ) + 1 r n u n - x n , u - u n 0 , u C ,

by (3.19), (H 1) and lower semicontinuity of φ1, we have

Φ 1 ( w 1 * , q , u ) + φ 1 ( u ) - φ 1 ( q ) 0 , u C ,

then, we have

q ( G E P ) s ( Φ 1 , φ 1 ) .
(3.39)

By using the same method as (3.39), we have

q ( G E P ) s ( Φ 2 , φ 2 ) .
(3.40)

Since κ<a α 1 n , j , α 3 n , j b<1 for all j=1,2,,N-1,κ<c α 1 n , N 1,κ α 3 n , N d<1 and κ α 2 n , j e<1 for all j = 1,2,..., N. Without loss of generality, we may assume α 1 n i , j α 1 j ( κ , 1 ) as i → ∞, α 3 n i , j α 3 j ( κ , 1 ) and α 2 n i , j α 2 j ( κ , 1 ) as i → ∞, j = 1,2,...,N.

Let S be S-mapping generated by T1, T2 ..., T N . and β1, β2,...,β N , where β j = ( α 1 j , α 2 j , α 3 j ) . By Lemma 2.4, we have S is nonexpansive and F ( S ) = i = 1 N F ( T i ) .

By Lemma 2.6, we have

lim k S n i z n i - S z n i = 0 .
(3.41)

By (3.13) and (3.41), we have

lim n z n i - S z n i = 0 .
(3.42)

Since x n i q as i → ∞ and (3.32), we have z n i q as i → ∞. By z n i q as i → ∞, (3.42) and Lemma 2.7, we have

q i = 1 N F ( T i ) .
(3.43)

Next, we define Q : CC by

Q x = δ P C ( I - λ A ) x + ( 1 - δ ) P C ( I - η B ) x .
(3.44)

By Lemma 2.2, we have

F ( Q ) = F ( P C ( I - λ A ) ) ( P C ( I - η B ) ) = F ( G 1 ) F ( G 2 ) .
(3.45)

From (3.44), we have

Q x n - x n Q x n - z n + z n - x n δ P C ( I - λ A ) x n + ( 1 - δ ) P C ( I - η B ) x n - δ n P C ( I - λ A ) u n - ( 1 - δ n ) P C ( I - η B ) v n + z n - x n = δ P C ( I - λ A ) x n - δ P C ( I - λ A ) u n + δ P C ( I - λ A ) u n + ( 1 - δ ) P C ( I - η B ) x n - ( 1 - δ ) P C ( I - η B ) v n + ( 1 - δ ) P C ( I - η B ) v n - δ n P C ( I - λ A ) u n - ( 1 - δ n ) P C ( I - η B ) v n + z n - x n δ P C ( I - λ A ) x n - P C ( I - λ A ) u n + δ - δ n P C ( I - λ A ) u n + ( 1 - δ ) P C ( I - η B ) x n - P C ( I - η B ) v n + ( 1 - δ ) - ( 1 - δ n ) P C ( I - η B ) v n + z n - x n δ x n - u n + δ - δ n P C ( I - λ A ) u n + ( 1 - δ ) x n - v n + δ n - δ P C ( I - η B ) v n + z n - x n

by condition (i), (3.19), (3.20), and (3.32), we have

lim n Q x n - x n = 0 .
(3.46)

Since x n i q as i → ∞ and Lemma 2.7, we have

q F ( Q ) = F ( G 1 ) F ( G 2 ) .
(3.47)

From (3.39), (3.40), (3.43), and (3.47), we have qF. Hence ω ( x n ) F. Hence, by Lemma 2.8 and (3.8), it implies that {x n } converges strongly to P F x 1 . This completes the proof.

Remark 3.2. If we take TD, w n 1 = w n 2 u n = v n n, Φ 1 Φ 2 and φ1 = φ2, then the Algorithm 1.3 reduces to the following algorithm:

w n 1 T ( x n ) , w n 1 - w n + 1 1 1 + 1 n T ( x n ) , T ( x n + 1 ) , Φ 1 w n 1 , u n , u + φ 1 ( u ) - φ 1 ( u n ) + 1 r n u n - x n , u - u n 0 , u C , z n = P C ( I - λ A ) u n , y n = α n z n + ( 1 - α n ) S n z n , C n + 1 = z C n + 1 : y n - z x n - z , x n + 1 = P C n + 1 x 1 , n 1 ,
(3.48)

under the same conditions of Theorem 3.1, we have the sequence {x n } generated by algorithm (3.48) converges strongly to P F x 1 where F = i = 1 N F ( T i ) ( G E P ) s ( Φ 1 , φ 1 ) F ( G 1 ) , where G1 : CC is defined by G 1(x) = P C (x - λA x) x C and P F x 1 is a solution of 〈Ax*, x -x*〉 ≥ 0

4 Application

In this section, by using our main result we prove a strong convergence theorem of the sequence {x n } generated by Algorithm 4.1 as follows:

Algorithm 4.1. Let T i , i = 1,2,...,N, be κ i -pseudo contraction mappings of C into itself and κ = max{κ i : i = 1,2,..., N} and let S n be the S-mappings generated by T1, T2,..., T N and α 1 ( n ) , α 2 ( n ) ,..., α N ( n ) where α j ( n ) = ( α 1 n , j , α 2 n , j , α 3 n , j ) I×I×I,I= [ 0 , 1 ] , α 1 n , j + α 2 n , j + α 3 n , j =1 and κ<a α 1 n , j , α 3 n , j b<1 for all j = 1 , 2 , . . . , N - 1 , κ < c α 1 n , N 1 , κ α 3 n , N d < 1 , κ α 2 n , j e < 1 for all j = 1,2,...,N. Let x1 C = C1 and w 1 i T i ( x 1 ) , there exists sequence { w n i } H and { x n } , { u n i } C,i=1,2,...,N such that

w n i T i ( x n ) , w n i - w n + 1 i 1 + 1 n T ( x n ) , T ( x n + 1 ) i = 1 , 2 , . . . , N . Φ i w n i , u n i , u + φ i ( u ) - φ i ( u n i ) + 1 r n i u n i - x n , u - u n i 0 , u C , i = 1 , 2 , . . . , N . z n = i = 1 N δ n i P C ( I - λ i A i ) u n i , w h e r e i = 1 N δ n i = 1 , y n = α n z n + ( 1 - α n ) S n z n , C n + 1 = z C n + 1 : y n - z x n - z , x n + 1 = P C n + 1 x 1 , n 1 .
(4.1)

The following result can be obtained from Theorem 3.1. We, therefore, omit the proof.

Theorem 4.2. Let C be a nonempty bounded, closed, and convex subset of Hilbert space H and let φ i : be a lower semicontinuous and convex function, for all i = 1,2,..., N. Let Ti: CCB(H) be -Lipschitz continuous with constant μ i , Φ i : H × C × C be equilibrium-like functions satisfying (H 1)-(H3) and A i : CH be a α i -inverse strongly monotone mappings i = 1,2,..., N and let T i , i = 1,2,...,N, be κ i -pseudo contraction mappings of C into itself and κ = max{κ i : i = 1,2,..., N} with F = i = 1 N F ( T i ) i = 1 N ( G E P ) s ( Φ i , φ i ) i = 1 N F ( G i ) , where G i : CC is defined by G i (x) = P C (x - λ i A i x) x C, i = 1,2,...,N. Let S n be the S-mappings generated by T1, T2,..., T N and α 1 ( n ) , α 2 ( n ) ,..., α N ( n ) where α j ( n ) = α 1 n , j , α 2 n , j , α 3 n , j I × I × I , I = [ 0 , 1 ] , α 1 n , j + α 2 n , j + α 3 n , j = 1 and κ < a α 1 n , j , α 3 n , j b < 1 for all j=1,2,...,N-1,κ<c α 1 n , N 1,κ α 3 n , N d<1,κ α 2 n , j e<1 for all j = 1,2,...,N and let { x n } , { u n i } , { w n i } ,i=1,2,...,N, be sequences generated by (4.1), where {α n } is a sequence in [0,1], r n i , λ i [ a , b ] ( 0 , 2 α ) i=1,2,...,N and n and suppose the following conditions hold:

(i) lim n δ n i = δ i ( 0 , 1 ) ,i=1,2,...,N.

(ii) 0 ≤ κα n < 1, n ≥ 1,

(iii) n = 1 α 1 n + 1 , j - α 1 n , j <, n = 1 α 3 n + 1 , j - α 3 n , j <, for all j {1,2,...,N}.

(iv) There exists λi, i = 1,2,..., N such that

Φ 1 w 1 i , T r 1 i ( x 1 ) , T r 2 i ( x 2 ) + Φ 1 w 2 i , T r 2 i ( x 2 ) , T r 1 i ( x 1 ) - λ i T r 1 i ( x 1 ) - T r 2 i ( x 2 ) 2 ,
(4.2)

for all i=1,2,...,N, r 1 i , r 2 i Θ i × Θ i , w k i T i ( x k ) for k = 1,2 where Θ i = r n i : n 1 . Then {x n } converges strongly to P F x 1 and P F x 1 is a solutions of (4.3):

A i x * , x - x * 0 , i = 1 , 2 , . . . , N .
(4.3)

References

  1. Goebel K, Kirk WA: Topics in Metric Fixed Point Theory. In Cambridge Stud Adv Math. Volume 28. Cambridge University Press, Cambridge; 1990.

    Google Scholar 

  2. Iiduka H, Takahashi W: Weak convergence theorem by Ces`aro means for nonexpansive mappings and inverse-strongly monotone mappings. J Nonlinear Convex Anal 2006, 7: 105–113.

    MathSciNet  Google Scholar 

  3. Combettes PL, Hirstoaga SA: Equilibrium programming in Hilbert spaces. J Nonlinear Convex Anal 2005, 6(1):117–136.

    MathSciNet  Google Scholar 

  4. Blum E, Oettli W: From optimization and variational inequalities to equilibrium problems. Math Student 1994, 63(1–4):123–145.

    MathSciNet  Google Scholar 

  5. Blum E, Oettli W: From optimization and variational inequalities to equilibrium problems. Math Stud 1994, 63: 123–145.

    MathSciNet  Google Scholar 

  6. Moudafi A: Weak convergence theorems for nonexpansive mappings and equilibrium problems. J Nonlinear Convex Anal 2008, 9: 37–43.

    MathSciNet  Google Scholar 

  7. He H, Liu S, Cho YJ: An explicit method for systems of equilibrium problems and fixed points of infinite family of nonexpansive mappings. J Comput Appl Math 2011, 235: 4128–4139. 10.1016/j.cam.2011.03.003

    Article  MathSciNet  Google Scholar 

  8. Yao Y, Cho YJ, Liou YC: Iterative algorithms for variational inclusions, mixed equilibrium problems and fixed point problems approach to optimization problems. Cent Eur J Math 2011, 9: 640–656. 10.2478/s11533-011-0021-3

    Article  MathSciNet  Google Scholar 

  9. Yao Y, Cho YJ, Liou YC: Algorithms of common solutions for varia-tional inclusions, mixed equilibrium problems and fixed point problems. Eur J Oper Res 2011, 212: 242–250. 10.1016/j.ejor.2011.01.042

    Article  MathSciNet  Google Scholar 

  10. Cho YJ, Argyros IK, Petrot N: Approximation methods for common solutions of generalized equilibrium, systems of nonlinear variational inequalities and fixed point problems. Comput Math Appl 2010, 60: 2292–2301. 10.1016/j.camwa.2010.08.021

    Article  MathSciNet  Google Scholar 

  11. Cho YJ, Petrot N: An Optimization problem related to generalized equilibrium and fixed point problems with applications. Fixed Point Theory 2010, 11: 237–250.

    MathSciNet  Google Scholar 

  12. Qin X, Chang Ss, Cho YJ: Iterative methods for generalized equilibrium problems and fixed point problems with applications. Nonlinear Anal: Real World Appl 2010, 11: 2963–2972. 10.1016/j.nonrwa.2009.10.017

    Article  MathSciNet  Google Scholar 

  13. Cho YJ, Petrot N: On the system of nonlinear mixed implicit equilibrium problems in Hilbert spaces. J Inequal Appl 2010, 2010: 12. Article ID 437976

    MathSciNet  Google Scholar 

  14. Qin X, Cho YJ, Kang SM: Viscosity approximation methods for generalized equilibrium problems and fixed point problems with applications. Nonlinear Anal 2010, 72: 99–112. 10.1016/j.na.2009.06.042

    Article  MathSciNet  Google Scholar 

  15. Qin X, Cho YJ, Kang SM: Convergence analysis on hybrid projection algorithms for equilibrium problems and variational inequality problems. Math Model Anal 2009, 14: 335–351. 10.3846/1392-6292.2009.14.335-351

    Article  MathSciNet  Google Scholar 

  16. Cho YJ, Kang JI, Qin X: Convergence theorems based on hybrid methods for generalized equilibrium problems and fixed point problems. Nonlinear Anal 2009, 71: 4203–4214. 10.1016/j.na.2009.02.106

    Article  MathSciNet  Google Scholar 

  17. Ceng LC, Ansari QH, Yao JC: Viscosity approximation methods for generalized equilibrium problems and fixed point problems. J Glob Optim 2009, 43: 487–502. 10.1007/s10898-008-9342-6

    Article  MathSciNet  Google Scholar 

  18. Kangtunyakarn A: Hybrid algorithm for finding common elements of the set of generalized equilibrium problems and the set of fixed point problems of strictly pseudocontractive mapping. Fixed Point Theory and Applications 2011, 2011: 19. Article ID 274820 10.1186/1687-1812-2011-19

    Article  Google Scholar 

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

    Google Scholar 

  20. Bruck RE: Properties of fixed point sets of nonexpansive mappings in Banach spaces. Trans Am Math Soc 1973, 179: 251–262.

    Article  MathSciNet  Google Scholar 

  21. Kangtunyakarn A, Suantai S: Strong convergence of a new iterative scheme for a finite family of strict pseudo-contractions. Comput Math Appl 2010, 60: 680–694. 10.1016/j.camwa.2010.05.016

    Article  MathSciNet  Google Scholar 

  22. Marino G, Xu HK: Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces. J Math Anal Appl 2007, 329: 336–346. 10.1016/j.jmaa.2006.06.055

    Article  MathSciNet  Google Scholar 

  23. Browder FE: Nonlinear operators and nonlinear equations of evolution in Banach spaces. Proc Sympos Pure Math 1976, 18: 78–81.

    Google Scholar 

  24. Matines-Yanes C, Xu HK: Strong convergence of the CQ method for fixed point iteration processes. Nonlinear Anal 2006, 64: 2400–2411. 10.1016/j.na.2005.08.018

    Article  MathSciNet  Google Scholar 

  25. Nadler SB Jr: Multivalued contraction mappings. Pacific J Math 1969, 30: 475–488.

    Article  MathSciNet  Google Scholar 

  26. Takahashi W: Nolinear and Convex Analysis. Yokohama Publishers, Yokohama; 2009.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Atid Kangtunyakarn.

Additional information

Competing interests

The author declares 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

Kangtunyakarn, A. Hybrid iterative scheme for a generalized equilibrium problems, variational inequality problems and fixed point problem of a finite family of κ i -strictly pseudocontractive mappings. Fixed Point Theory Appl 2012, 30 (2012). https://doi.org/10.1186/1687-1812-2012-30

Download citation

  • Received:

  • Accepted:

  • Published:

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

Keywords