Skip to main content

Strong convergence by a hybrid algorithm for solving generalized mixed equilibrium problems and fixed point problems of a Lipschitz pseudo-contraction in Hilbert spaces

Abstract

In this paper, we construct a sequence by using some appropriated closed convex sets based on the hybrid shrinking projection methods to find a common solution of fixed point problems of a Lipschitz pseudo-contraction and generalized mixed equilibrium problems in Hilbert spaces. The strong convergence theorems are proved under some mild conditions on scalars. The results not only cover the research work of Yao et al. (Nonlinear Anal. 71:4997-5002, 2009) but can also be applied for finding the common element of the set of zeroes of a Lipschitz monotone mapping and the set of generalized mixed equilibrium problems in Hilbert spaces.

MSC:47H05, 47H09, 47H10, 47J25.

1 Introduction

The equilibrium problem theory provides a novel and unified treatment of a wide class of problems which arise in economics, finance, image reconstruction, ecology, transportation, network, elasticity and optimization, and it has been extended and generalized in many directions; see [1, 2]. In particular, equilibrium problems are related to the problem of finding fixed points problems of some nonlinear mappings. Therefore, it is natural to construct a unified approach to these problems. In this direction, several authors have introduced some iterative schemes for finding a common element of the set of the solutions of equilibrium problems and the set of fixed points (see also [3–7] and the references therein). In this paper, we suggest and analyze a hybrid algorithm for solving generalized mixed equilibrium problems and fixed point problems of a Lipschitz pseudo-contraction in the framework of Hilbert spaces.

Let E be a real Banach space, and E ∗ the dual space of E. Let C be a nonempty closed convex subset of E. Let Θ:C×C→R be a bifunction, φ:C→R be a real-valued function, and A:C→ E ∗ be a nonlinear mapping. The generalized mixed equilibrium problem is to find x∈C such that

Θ(x,y)+〈Ax,y−x〉+φ(y)−φ(x)≥0,∀y∈C.
(1.1)

The solution set of (1.1) is denoted by GMEP(Θ,A,φ), i.e.,

GMEP(Θ,A,φ)= { x ∈ C : Θ ( x , y ) + 〈 A x , y − x 〉 + φ ( y ) − φ ( x ) ≥ 0 , ∀ y ∈ C } .

If A=0, the problem (1.1) reduces to the mixed equilibrium problem for Θ, denoted by MEP(Θ,φ), which is to find x∈C such that

Θ(x,y)+φ(y)−φ(x)≥0,∀y∈C.

If Θ=0, the problem (1.1) reduces to the mixed variational inequality of Browder type, denoted by VI(C,A,φ), which is to find x∈C such that

〈Ax,y−x〉+φ(y)−φ(x)≥0,∀y∈C.

If A=0 and φ=0, the problem (1.1) reduces to the equilibrium problem for Θ (for short, EP), denoted by EP(Θ), which is to find x∈C such that

Θ(x,y)≥0,∀y∈C.
(1.2)

Let Θ(x,y)=〈Ax,y−x〉 for all x,y∈C. Then p∈EP(Θ) if and only if 〈Ap,y−p〉≥0 for all y∈C, i.e., p is a solution of the variational inequality; there are several other problems, for example, the complementarity problem, fixed point problem and optimization problem, which can also be written in the form of an EP. In other words, the EP is a unifying model for several problems arising in physics, engineering, science, optimization, economics, etc. Many papers on the existence of solutions of EP have appeared in the literature (see, for example, [1, 8–10] and references therein). Motivated by the work [3, 11, 12], Takahashi and Takahashi [4] introduced an iterative scheme by the viscosity approximation method for finding a common element of the set of solutions of the EP (1.2) and the set of fixed points of a nonexpansive mapping in the setting of a Hilbert space. They also studied the strong convergence of the sequences generated by their algorithm for a solution of the EP which is also a fixed point of a nonexpansive mapping defined on a closed convex subset of a Hilbert space.

Recall, a mapping T with domain D(T) and range R(T) in H is called firmly nonexpansive if

∥ T x − T y ∥ 2 ≤〈Tx−Ty,x−y〉,∀x,y∈D(T),

nonexpansive if

∥Tx−Ty∥≤∥x−y∥,∀x,y∈D(T).

Throughout this paper, I stands for an identity mapping. The mapping T is said to be a strict pseudo-contraction if there exists a constant 0⩽κ<1 such that

∥ T x − T y ∥ 2 ⩽ ∥ x − y ∥ 2 +κ ∥ ( I − T ) x − ( I − T ) y ∥ 2 ,∀x,y∈D(T).

In this case, T may be called a κ-strict pseudo-contraction mapping. In the even that κ=1, T is said to be a pseudo-contraction, i.e.,

∥ T x − T y ∥ 2 ⩽ ∥ x − y ∥ 2 + ∥ ( I − T ) x − ( I − T ) y ∥ 2 ,∀x,y∈D(T).
(1.3)

It is easy to see that (1.3) is equivalent to

〈 x − y , ( I − T ) x − ( I − T ) y 〉 ⩾0,∀x,y∈D(T).

By definition, it is clear that

firmly nonexpansive ⇒ nonexpansive ⇒ strict pseudo-contraction ⇒ pseudo-contraction.

However, the following examples show that the converse is not true.

Example 1.1 (Chidume and Mutangadura [13])

Take H= R 2 , B={x∈ R 2 :∥x∥≤1}, B 1 ={x∈B:∥x∥≤ 1 2 }, B 2 ={x∈B: 1 2 ≤∥x∥≤1}. If x=(a,b)∈H, we define x ⊥ to be (b,−a)∈H. Define T:B→B by

Tx={ x + x ⊥ , x ∈ B 1 , x ∥ x ∥ − x + x ⊥ , x ∈ B 2 .

Then, T is Lipschitz and a pseudo-contraction but not a strict pseudo-contraction.

Example 1.2 Take H= R 1 and define T:H→H by Tx=−3x. Then, T is a strict pseudo-contraction but not a nonexpansive mapping.

Indeed, it is clear that T is not nonexpansive. On the other hand, let us consider

∥ T x − T y ∥ 2 = ∥ ( − 3 x ) − ( − 3 y ) ∥ 2 = 9 ∥ x − y ∥ 2 = ∥ x − y ∥ 2 + 8 ∥ x − y ∥ 2 = ∥ x − y ∥ 2 + 16 2 ∥ x − y ∥ 2 = ∥ x − y ∥ 2 + 1 2 ∥ 4 x − 4 y ∥ 2 = ∥ x − y ∥ 2 + 1 2 ∥ ( 1 − ( − 3 ) ) x − ( 1 − ( − 3 ) ) y ∥ 2 = ∥ x − y ∥ 2 + 1 2 ∥ ( I − T ) x − ( I − T ) y ∥ 2 ≤ ∥ x − y ∥ 2 + κ ∥ ( I − T ) x − ( I − T ) y ∥ 2

for all κ∈[ 1 2 ,1). Thus T is a strict pseudo-contraction.

Example 1.3 Take H≠{0} and let T=−I, it is not hard to verify that T is nonexpansive but not firmly nonexpansive.

From a practical point of view, strict pseudo-contractions have more powerful applications than nonexpansive mappings do in solving inverse problems (see [14]). Therefore, it is important to develop a theory of iterative methods for strict pseudo-contractions.

Takahashi and Zembayashi [5, 6] proposed some hybrid methods to find the solution of a fixed point problem and an equilibrium problem in Banach spaces. Subsequently, many authors (see, e.g.[15–19] and references therein) have used the hybrid methods to solve fixed point problems and equilibrium problems.

Recently, Yao et al. [20] introduced the hybrid iterative algorithm which just involved one sequence of closed convex set for a pseudo-contractive mapping in Hilbert spaces as follows:

Let C be a nonempty closed convex subset of a real Hilbert space H. Let T:C→C be a pseudo-contraction. Let { α n } be a sequence in (0,1). Let x 0 ∈H. For C 1 =C and x 1 = P C 1 ( x 0 ), define a sequence { x n } of C as follows:

{ y n = ( 1 − α n ) x n + α n T z n , C n + 1 = { v ∈ C n : ∥ α n ( I − T ) y n ∥ 2 ⩽ 2 α n 〈 x n − v , ( I − T ) y n 〉 } , x n + 1 = P C n + 1 ( x 0 ) .
(1.4)

Theorem 1.4 ([20])

Let C be a nonempty closed convex subset of a real Hilbert space H. LetT:C→Cbe an L-Lipschitz pseudo-contraction such thatF(T)≠∅. Assume the sequence{ α n }⊂[a,b]for somea,b∈(0, 1 L + 1 ). Then the sequence{ x n }generated by (1.4) converges strongly to P F ( T ) ( x 0 ).

Very recently, Tang et al. [21] generalized the hybrid algorithm (1.4) in the case of the Ishikawa iterative process as follows:

{ y n = ( 1 − α n ) x n + α n T z n , z n = ( 1 − β n ) x n + β n T x n , C n + 1 = { v ∈ C n : ∥ α n ( I − T ) y n ∥ 2 ⩽ 2 α n 〈 x n − v , ( I − T ) y n 〉 C n + 1 = + 2 α n β n L ∥ x n − T x n ∥ ∥ y n − x n + α n ( I − T ) y n ∥ } , x n + 1 = P C n + 1 ( x 0 ) .
(1.5)

Under some appropriate conditions of { α n } and { β n }, they proved that (1.5) converges strongly to P F ( T ) ( x 0 ).

Motivated and inspired by the above research work, in this paper, by employing (1.4) and (1.5), we construct a sequence by using some appropriated closed convex sets based on the hybrid shrinking projection methods to find a common solution of fixed point problems of a Lipschitz pseudo-contraction and generalized mixed equilibrium problems in Hilbert spaces. More precisely, we also provide some applications of the main theorem for finding the common element of the set of zeroes of a Lipschitz monotone mapping and the set of generalized mixed equilibrium problems in Hilbert spaces.

2 Preliminaries

Let H be a real Hilbert space with inner product 〈⋅,⋅〉 and norm ∥⋅∥ and let C be a closed convex subset of H. 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,

where P C is called the metric projection of H onto C. We know that P C is a nonexpansive mapping. It is also known that H satisfies Opial’s condition, i.e., for any sequence { x n } with x n ⇀x, the inequality

lim inf n → ∞ ∥ x n −x∥< lim inf n → ∞ ∥ x n −y∥

holds for every y∈H with y≠x.

For a given sequence { x n }⊂C, let ω w ( x n )={x:∃ x n j ⇀x} denote the weak ω-limit set of { x n }.

Now we recall some lemmas which will be used in the proof of the main result in the next section. We note that Lemmas 2.1 and 2.2 are well known.

Lemma 2.1 Let H be a real Hilbert space. There holds the following identity

  1. (i)

    ∥ x − y ∥ 2 = ∥ x ∥ 2 − ∥ y ∥ 2 −2〈x−y,y〉 ∀x,y∈H.

Lemma 2.2 Let C be a closed convex subset of a real Hilbert space H. Givenx∈Handz∈C. Thenz= P C xif and only if there holds the relation

〈x−z,y−z〉⩽0∀y∈C.

For solving the equilibrium problem for a bifunction Θ:C×C→R, let us assume that Θ satisfies the following condition:

(A1) Θ(x,x)=0 for all x∈C;

(A2) Θ is monotone, i.e., Θ(x,y)+Θ(y,x)≤0 for all x,y∈C;

(A3) for each x,y,z∈C,

lim t ↓ 0 Θ ( t z + ( 1 − t ) x , y ) ≤Θ(x,y);

(A4) for each x∈C, y↦Θ(x,y) is convex and lower semi-continuous.

For a real Banach space E with norm ∥⋅∥, duality product 〈⋅,⋅〉 and dual space E ∗ , the normalized duality mapping J:E→ 2 E ∗ is defined by

Jx= { x ∗ ∈ E ∗ : 〈 x , x ∗ 〉 = ∥ x ∥ 2 = ∥ x ∗ ∥ 2 } ,for x∈E.

Lemma 2.3 (Blum and Oettli [1])

Let C be a nonempty closed convex subset of a smooth, strictly convex and reflexive Banach space E, and let Θ be a bifunction of C × C intoRsatisfying (A 1)-(A 4). Letr>0andx∈E. Then, there existsz∈Csuch that

Θ(z,y)+ 1 r 〈y−z,Jz−Jx〉≥0, for all y∈C.

The proof of the following lemma appears in [[5], Lemma 2.8].

Lemma 2.4 Let C be a closed convex subset of a uniformly smooth, strictly convex and reflexive Banach space E, and let Θ be a bifunction fromC×CtoRsatisfying (A 1)-(A 4). Forr>0andx∈E, define a mapping T r :E→Cas follows:

T r x= { z ∈ C : Θ ( z , y ) + 1 r 〈 y − z , J z − J x 〉 ≥ 0 , for all y ∈ C }

for allx∈C. Then, the following hold:

  1. (i)

    T r is single-valued;

  2. (ii)

    T r is firmly nonexpansive-type mapping, i.e., for any x,y∈H,

    〈 T r x− T r y,J T r x−J T r y〉≤〈 T r x− T r y,Jx−Jy〉;
  3. (iii)

    F( T r )=EP(Θ);

  4. (iv)

    EP(Θ) is closed and convex.

Lemma 2.5 (Zhang [22])

Let C be a closed convex subset of a smooth, strictly convex and reflexive Banach space E. LetA:C→ E ∗ be a continuous and monotone mapping, φ:C→Rbe a lower semi-continuous and convex function, and Θ be a bifunction ofC×CtoRsatisfying (A 1)-(A 4). Forr>0andx∈E. Then, there existsu∈Csuch that

Θ(u,y)+〈Au,y−u〉+φ(y)−φ(u)+ 1 r 〈y−u,Ju−Jx〉≥0,∀y∈C.

Define a mapping K r :C→Cas follows:

K r (x)= { u ∈ C : Θ ( u , y ) + 〈 A u , y − u 〉 + φ ( y ) − φ ( u ) + 1 r 〈 y − u , J u − J x 〉 ≥ 0 , ∀ y ∈ C }

for allx∈C. Then, the following conclusions hold:

  1. (i)

    K r is single-valued;

  2. (ii)

    K r is firmly nonexpansive-type mapping, i.e., for any x,y∈E,

    〈 K r x− K r y,J K r x−J K r y〉≤〈 K r x− K r y,Jx−Jy〉;
  3. (iii)

    F( K r )=GMEP(Θ,A,φ);

  4. (iv)

    GMEP(Θ,A,φ) is closed and convex;

  5. (v)

    ϕ(p, K r z)+ϕ( K r z,z)≤ϕ(p,z), ∀p∈F( K r ), z∈E.

Remark 2.6 In the framework of a Hilbert space, it is well known that J=I and then K r is firmly nonexpansive.

Lemma 2.7 ([23])

Let H be a real Hilbert space, C a closed convex subset of H andT:C→Ca continuous pseudo-contractive mapping, then

  1. (i)

    F(T) is a closed convex subset of C.

  2. (ii)

    I−T is demiclosed at zero, i.e., if { x n } is a sequence in C such that x n ⇀z and (I−T) x n →0, then (I−T)z=0.

Lemma 2.8 ([24])

Let C be a closed convex subset of H. Let{ x n }be a sequence in H andu∈H. Letq= P C u. If{ x n }is such that ω w ( x n )⊂Cand satisfies the condition

∥ x n −u∥⩽∥u−q∥∀n.

Then x n →q.

Lemma 2.9 Let∅≠C⊂Hbe a closed convex set, a∈Rand

K= { v ∈ C : a ≤ f ( v ) } ,

where f is continuous and concave functional. Then the set K is closed and convex.

Proof It is easy to see that the continuity of f yields the closeness of K. Notice that for all x,y∈K and t∈[0,1], we have tx+(1−t)y∈C, f(x)≥a, f(y)≥a, and then the concavity of f allows

f ( t x + ( 1 − t ) y ) ≥tf(x)+(1−t)f(y)≥ta+(1−t)a=a.

Thus K is convex. □

The following lemma provides some useful properties of a firmly nonexpansive mapping on a Hilbert space.

Lemma 2.10 ([[7], Lemma 2.5])

T is firmly nonexpansive if and only if(I−T)is firmly nonexpansive.

3 Main result

Theorem 3.1 Let C be a nonempty closed convex subset of a real Hilbert space H, T:C→Cbe an L-Lipschitz pseudo-contraction. Let Θ be a bifunction fromC×CintoRsatisfying (A 1)-(A 4), φ:C→Rbe a lower semicontinuous and convex function, A:C→Hbe a continuous and monotone mapping such thatΩ:=F(T)∩GMEP(Θ,A,φ)≠∅. Let x 0 ∈H. For C 1 =Cand x 1 = P C 1 ( x 0 ), define a sequence{ x n }of C as follows:

{ y n = ( 1 − α n ) x n + α n T z n , z n = ( 1 − β n ) x n + β n u n , u n ∈ C such that Θ ( u n , y ) + 〈 A u n , y − u n 〉 + φ ( y ) − φ ( u n ) u n ∈ C such that + 1 r n 〈 y − u n , u n − x n 〉 ≥ 0 , C n + 1 = { v ∈ C n : ∥ α n ( I − T ) y n ∥ 2 + ∥ x n − u n ∥ ≤ 2 α n 〈 x n − v , ( I − T ) y n 〉 C n + 1 = { v ∈ C n : + 〈 x n − v , x n − u n 〉 ( 2 α n β n L ∥ y n − x n + α n ( I − T ) y n ∥ + 1 ) } , x n + 1 = P C n + 1 ( x 0 ) .
(3.1)

Assume the sequence{ α n }, { β n }and{ r n }are such that

  1. (1)

    0<a⩽ α n ⩽b< 1 L + 1 <1 for all n∈N,

  2. (2)

    0⩽ β n ⩽1 for all n∈N,

  3. (3)

    r n >0 for all n∈N with lim inf n → ∞ r n >0.

Then{ x n }converges strongly to P Ω ( x 0 ).

Proof By Lemma 2.7(i) and Lemma 2.5(iv), we see that F(T) and GMEP(Θ,A,φ) are closed and convex respectively, then Ω is also. Hence P Ω is well defined. Next, we will prove by induction that Ω⊂ C n for all n∈N. Note that Ω⊂C= C 1 . Assume that Ω⊂ C k holds for some k⩾1. Let p∈Ω, thus p∈ C k . We observe that

(3.2)

Consider the last term of (3.2), we obtain

(3.3)

By connecting (3.2) and (3.3), and then by the assumption (1) on { α n }, we obtain

∥ x k − p − α k ( I − T ) y k ∥ 2 ⩽ ∥ x k − p ∥ 2 − ∥ x k − y k ∥ 2 − ∥ y k − x k + α k ( I − T ) y k ∥ 2 + α k ( L + 1 ) ( ∥ x k − y k ∥ 2 + ∥ y k − x k + α k ( I − T ) y k ∥ 2 ) + 2 α k β k L ∥ x k − u k ∥ ∥ y k − x k + α k ( I − T ) y k ∥ ⩽ ∥ x k − p ∥ 2 + 2 α k β k L ∥ x k − u k ∥ ∥ y k − x k + α k ( I − T ) y k ∥ .
(3.4)

Notice that u k = K r k x k and by Lemma 2.10, we observe that

∥ x k − u k ∥ 2 = ∥ ( I − K r k ) x k − ( I − K r k ) p ∥ 2 ≤ 〈 ( I − K r k ) x k − ( I − K r k ) p , x k − p 〉 = 〈 ( I − K r k ) x k , x k − p 〉 .

So, we have

∥ x k − u k ∥≤ 〈 x k − p , x k − u k 〉 .
(3.5)

Joining (3.4) and (3.5), we obtain

(3.6)

Notice that

∥ x k − p − α k ( I − T ) y k ∥ 2 = ∥ x k − p ∥ 2 −2 α k 〈 x k − p , ( I − T ) y k 〉 + ∥ α k ( I − T ) y k ∥ 2 .
(3.7)

By (3.6) and (3.7), we have

(3.8)

Combining (3.8) and (3.5), we obtain

Therefore, p∈ C k + 1 . By mathematical induction, we have Ω⊂ C n for all n∈N.

Let f n (⋅):=2 α n 〈 x n −(⋅),(I−T) y n 〉+ 〈 x n − ( ⋅ ) , x n − u n 〉 (2 α n β n L∥ y n − x n + α n (I−T) y n ∥+1), it is not hard to see that the linearity of 〈 x n −(⋅),(I−T) y n 〉 and 〈 x n −(⋅), x n − u n 〉 together with the continuity and concavity of ( ⋅ ) allow f n to be continuous and concave. By Lemma 2.9, C n is closed and convex for all n∈N. Therefore, { x n } is well defined. From x n = P C n ( x 0 ), we have 〈 x 0 − x n , x n −y〉⩾0 for all y∈ C n . Using Ω⊂ C n , we also have 〈 x 0 − x n , x n −u〉⩾0 for all u∈Ω. So, for u∈Ω, we have

0 ⩽ 〈 x 0 − x n , x n − u 〉 = 〈 x 0 − x n , x n − x 0 + x 0 − u 〉 = − ∥ x 0 − x n ∥ 2 + 〈 x 0 − x n , x 0 − u 〉 ⩽ − ∥ x 0 − x n ∥ 2 + ∥ x 0 − x n ∥ ∥ x 0 − u ∥ .

Hence,

∥ x 0 − x n ∥⩽∥ x 0 −u∥for all u∈Ω.
(3.9)

This implies that { x n } is bounded and then { y n }, {T y n } and { u n } are bounded too.

From x n = P C n ( x 0 ) and x n + 1 = P C n + 1 ( x 0 )∈ C n + 1 ⊂ C n , we have

〈 x 0 − x n , x n − x n + 1 〉⩾0.
(3.10)

Hence,

0 ⩽ 〈 x 0 − x n , x n − x n + 1 〉 = 〈 x 0 − x n , x n − x 0 + x 0 − x n + 1 〉 = − ∥ x 0 − x n ∥ 2 + 〈 x 0 − x n , x 0 − x n + 1 〉 ⩽ − ∥ x 0 − x n ∥ 2 + ∥ x 0 − x n ∥ ∥ x 0 − x n + 1 ∥ ,

and therefore

∥ x 0 − x n ∥⩽∥ x 0 − x n + 1 ∥,

which implies that lim n → ∞ ∥ x n − x 0 ∥ exists. From Lemma 2.1 and (3.10), we obtain

∥ x n + 1 − x n ∥ 2 = ∥ ( x n + 1 − x 0 ) − ( x n − x 0 ) ∥ 2 = ∥ x n + 1 − x 0 ∥ 2 − ∥ x n − x 0 ∥ 2 − 2 〈 x n + 1 − x n , x n − x 0 〉 ⩽ ∥ x n + 1 − x 0 ∥ 2 − ∥ x n − x 0 ∥ 2 → 0 as  n → ∞ .

Since x n + 1 ∈ C n + 1 ⊂ C n , we have

Therefore, we obtain

∥ y n −T y n ∥→0and∥ x n − u n ∥→0as n→∞.

We note that

∥ x n − T x n ∥ ⩽ ∥ x n − y n ∥ + ∥ y n − T y n ∥ + ∥ T y n − T x n ∥ ⩽ ( L + 1 ) ∥ x n − y n ∥ + ∥ y n − T y n ∥ ⩽ α n ( L + 1 ) ∥ x n − T z n ∥ + ∥ y n − T y n ∥ ⩽ α n ( L + 1 ) ∥ x n − T x n ∥ + α n ( L + 1 ) ∥ T x n − T z n ∥ + ∥ y n − T y n ∥ ⩽ α n ( L + 1 ) ∥ x n − T x n ∥ + α n β n L ( L + 1 ) ∥ x n − u n ∥ + ∥ y n − T y n ∥ ,

that is,

∥ x n −T x n ∥⩽ α n β n L ( L + 1 ) 1 − α n ( L + 1 ) ∥ x n − u n ∥+ 1 1 − α n ( L + 1 ) ∥ y n −T y n ∥→0as n→∞.

Next, we will show that

ω w ( x n )⊂Ω.
(3.11)

Since { x n } is bounded, the reflexivity of H guarantees that ω w ( x n )≠∅. Let p∈ ω w ( x n ), then there exists a subsequence { x n i } of { x n } such that x n i ⇀p and by Lemma 2.7(ii), we have p∈F(T). On the other hand, since ∥ x n − u n ∥→0 and x n i ⇀p, we have u n i ⇀p. Define G:C×C→R by G(x,y)=Θ(x,y)+〈Ax,y−x〉+φ(y)−φ(x) for all x,y∈C. It is not hard to verify that G satisfies conditions (A1)-(A4). It follows from u n = K r n x n and (A2) that

1 r n 〈y− u n , u n − x n 〉≥G(y, u n )for all y∈C.

Replacing n by n i , we have

〈 y − u n i , u n i − x n i r n i 〉 ≥G(y, u n i ).

By using (A4) and the assumption (3) on { r n }, we obtain 0≥G(y,p) for all y∈C. For t∈(0,1] and y∈C, let y t =ty+(1−t)p. So, from (A1) and (A4) we have

0=G( y t , y t )=G ( y t , t y + ( 1 − t ) p ) ≤tG( y t ,y)+(1−t)G( y t ,p)≤tG( y t ,y).

Dividing by t, we have

G( y t ,y)≥0for all y∈C.

From (A3) we have 0≤ lim t → 0 G( y t ,y)= lim t → 0 G(ty+(1−t)p,y)≤G(p,y) for all y∈C, and hence p∈GMEP(Θ,A,φ). So, p∈F(T)∩GMEP(Θ,A,φ)=Ω and then we have (3.11). Therefore, by inequality (3.9) and Lemma 2.8, we obtain { x n } converges strongly to P Ω ( x 0 ). This completes the proof. □

Remark 3.2 It is interesting that the assumption on a sequence of scalars { β n } is a very mild condition. This is a direct result of the firmly nonexpansiveness of I− K r n together with the structure and the definition of the set C n . If β n =0 for all n, then z n = x n and the sequence { y n } and { u n } are independent. However, the properties of C n still force to produce the sequence { x n } to cause a convergence to the common solution P Ω ( x 0 ).

If A=0 and φ=0, then we have the following corollary.

Corollary 3.3 Let C be a nonempty closed convex subset of a real Hilbert space H, T:C→Cbe an L-Lipschitz pseudo-contraction. Let Θ be a bifunction fromC×CintoRsatisfying (A 1)-(A 4), such thatΩ:=F(T)∩EP(Θ)≠∅. Let x 0 ∈H. For C 1 =Cand x 1 = P C 1 ( x 0 ), define a sequence{ x n }of C as follows:

{ y n = ( 1 − α n ) x n + α n T z n , z n = ( 1 − β n ) x n + β n u n , u n ∈ C such that Θ ( u n , y ) + 1 r n 〈 y − u n , u n − x n 〉 ≥ 0 , C n + 1 = { v ∈ C n : ∥ α n ( I − T ) y n ∥ 2 + ∥ x n − u n ∥ ≤ 2 α n 〈 x n − v , ( I − T ) y n 〉 C n + 1 = { v ∈ C n : + 〈 x n − v , x n − u n 〉 ( 2 α n β n L ∥ y n − x n + α n ( I − T ) y n ∥ + 1 ) } , x n + 1 = P C n + 1 ( x 0 ) .

Assume the sequence{ α n }, { β n }and{ r n }are as in Theorem 3.1. Then{ x n }converges strongly to P Ω ( x 0 ).

Corollary 3.4 (Yao et al. [[20], Theorem 3.1])

Let C be a nonempty closed convex subset of a real Hilbert space H. LetT:C→Cbe an L-Lipschitz pseudo-contraction such thatF(T)≠∅. Assume that{ α n }is a sequence such that0<a⩽ α n ⩽b< 1 L + 1 <1for all n. Then the sequence{ x n }generated by (1.4) converges strongly to P F ( T ) ( x 0 ).

Proof Put Θ=0, A=0, φ=0 and r n =1 for all n≥1 in Theorem 3.1. Then, K r n = P C for all n⩾1. So, u n = P C x n for all n⩾1 (note that x 1 = P C x 0 ). Since x n = P C n x 0 ∈ C n ⊂C for all n⩾1, so we have u n = x n and then z n = x n for all n⩾1. Thus x n − u n =0 for all n≥1. For this reason, (1.4) is a special case of (3.1). Applying Theorem 3.1, we have the desired result. □

Recall that a mapping B is said to be monotone, if 〈x−y,Bx−By〉⩾0 for all x,y∈H and inverse strongly monotone if there exists a real number γ>0 such that 〈x−y,Bx−By〉⩾γ ∥ B x − B y ∥ 2 for all x,y∈H. For the second case, B is said to be γ-inverse strongly monotone. It follows immediately that if B is γ-inverse strongly monotone, then B is monotone and Lipschitz continuous, that is, ∥Bx−By∥⩽ 1 γ ∥x−y∥. The pseudo-contractive mapping and strictly pseudo-contractive mapping are strongly related to the monotone mapping and inverse strongly monotone mapping, respectively. It is well known that

  1. (i)

    B is monotone ⟺ T:=(I−B) is pseudo-contractive.

  2. (ii)

    B is inverse strongly monotone ⟺ T:=(I−B) is strictly pseudo-contractive.

Indeed, for (ii), we notice that the following equality always holds in a real Hilbert space:

∥ ( I − B ) x − ( I − B ) y ∥ 2 = ∥ x − y ∥ 2 + ∥ B x − B y ∥ 2 −2〈x−y,Bx−By〉∀x,y∈H,
(3.12)

without loss of generality, we can assume that γ∈(0, 1 2 ], and then it yields

Corollary 3.5 Let C, H, Θ, A and φ be as in Theorem 3.1 and letB:H→Hbe an L-Lipschitz monotone mapping such thatΩ= B − 1 (0)∩GMEP(Θ,A,φ)≠∅. Let x 0 ∈H. For C 1 =Cand x 1 = P C 1 ( x 0 ), define a sequence{ x n }of C as follows:

{ y n = x n − α n ( x n − z n ) − α n B z n , z n = ( 1 − β n ) x n + β n u n , u n ∈ C such that Θ ( u n , y ) + 〈 A u n , y − u n 〉 + φ ( y ) − φ ( u n ) u n ∈ C such that + 1 r n 〈 y − u n , u n − x n 〉 ≥ 0 , C n + 1 = { v ∈ C n : ∥ α n B y n ∥ 2 + ∥ x n − u n ∥ ≤ 2 α n 〈 x n − v , B y n 〉 C n + 1 = { v ∈ C n : + 〈 x n − v , x n − u n 〉 ( 2 α n β n L ∥ y n − x n + α n B y n ∥ + 1 ) } , x n + 1 = P C n + 1 ( x 0 ) .
(3.13)

Assume0<a⩽ α n ⩽b< 1 L + 2 <1for alln∈N, { β n }and{ r n }are as in Theorem 3.1. Then{ x n }converges strongly to P Ω ( x 0 ).

Proof Let T:=(I−B). Then T is pseudo-contractive and (L+2)-Lipschitz. Hence, it follows from Theorem 3.1, we have the desired result. □

References

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

    MathSciNet  Google Scholar 

  2. Noor MA, Oettli W: On general nonlinear complementarity problems and quasi equilibria. Matematiche 1994, 49: 313–331.

    MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

  4. Takahashi S, Takahashi W: Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces. J. Math. Anal. Appl. 2007, 331: 506–515. 10.1016/j.jmaa.2006.08.036

    Article  MathSciNet  Google Scholar 

  5. Takahashi W, Zembayashi K: Strong and weak convergence theorems for equilibrium problems and relatively nonexpansive mappings in Banach spaces. Nonlinear Anal. 2009, 70: 45–57. 10.1016/j.na.2007.11.031

    Article  MathSciNet  Google Scholar 

  6. Takahashi W, Zembayashi K: Strong convergence theorem by a new hybrid method for equilibrium problems and relatively nonexpansive mappings. Fixed Point Theory Appl. 2008., 2008: Article ID 528476

    Google Scholar 

  7. Jarernsuk A, Ungchittrakool K: Strong convergence by a hybrid algorithm for solving equilibrium problem and fixed point problem of a Lipschitz pseudo-contraction in Hilbert spaces. Thai J. Math. 2012, 10(1):181–194.

    MathSciNet  Google Scholar 

  8. Flores-Bazan F: Existence theory for finite-dimensional pseudomonotone equilibrium problems. Acta Appl. Math. 2003, 77: 249–297. 10.1023/A:1024971128483

    Article  MathSciNet  Google Scholar 

  9. Hadjisavvas N, Komlósi S, Schaible S: Handbook of Generalized Convexity and Generalized Monotonicity. Springer, New York; 2005.

    Book  Google Scholar 

  10. Hadjisavvas N, Schaible S: From scalar to vector equilibrium problems in the quasimonotone case. J. Optim. Theory Appl. 1998, 96: 297–309. 10.1023/A:1022666014055

    Article  MathSciNet  Google Scholar 

  11. Moudafi A: Viscosity approximation methods for fixed-point problems. J. Math. Anal. Appl. 2000, 241: 46–55. 10.1006/jmaa.1999.6615

    Article  MathSciNet  Google Scholar 

  12. Tada A, Takahashi W: Strong convergence theorem for an equilibrium problem and a nonexpansive mapping. In Nonlinear Analysis and Convex Analysis. Edited by: Takahashi W, Tanaka T. Yokohama Publishers, Yokohama; 2006:609–617.

    Google Scholar 

  13. Chidume CE, Mutangadura SA: An example on the Mann iteration method for Lipschitz pseudocontractions. Proc. Am. Math. Soc. 2001, 129(8):2359–2363. 10.1090/S0002-9939-01-06009-9

    Article  MathSciNet  Google Scholar 

  14. Scherzer O: Convergence criteria of iterative methods based on Landweber iteration for solving nonlinear problems. J. Math. Anal. Appl. 1991, 194: 911–933.

    Article  MathSciNet  Google Scholar 

  15. Kumam P, Petrot N, Wangkeeree R: A hybrid iterative scheme for equilibrium problems and fixed point problems of asymptotically k -strict pseudo-contractions. J. Comput. Appl. Math. 2010, 233(8):2013–2026. 10.1016/j.cam.2009.09.036

    Article  MathSciNet  Google Scholar 

  16. Kumam P, Wattanawitoon K: Convergence theorems of a hybrid algorithm for equilibrium problems. Nonlinear Anal. Hybrid Syst. 2009, 3: 386–394. 10.1016/j.nahs.2009.02.006

    Article  MathSciNet  Google Scholar 

  17. Qin XL, Zhou HY, Kang SM: Convergence theorems of common elements for equilibrium problems and fixed point problems in Banach spaces. J. Comput. Appl. Math. 2009, 225(1):20–30. 10.1016/j.cam.2008.06.011

    Article  MathSciNet  Google Scholar 

  18. Plubtieng S, Ungchittrakool K: Approximation of common fixed points for a countable family of relatively nonexpansive mappings in a Banach space and applications. Nonlinear Anal. 2010, 72(6):2896–2908. 10.1016/j.na.2009.11.034

    Article  MathSciNet  Google Scholar 

  19. Ungchittrakool K: A strong convergence theorem for a common fixed point of two sequences of strictly pseudo contractive mappings in Hilbert spaces and applications. Abstr. Appl. Anal. 2010., 2010: Article ID 876819

    Google Scholar 

  20. Yao Y, Liou Y-C, Marino G: A hybrid algorithm for pseudo-contractive mappings. Nonlinear Anal. 2009, 71: 4997–5002. 10.1016/j.na.2009.03.075

    Article  MathSciNet  Google Scholar 

  21. Tang Y-C, Peng J-G, Liu L-W: Strong convergence theorem for pseudo-contractive mappings in Hilbert spaces. Nonlinear Anal. 2011, 74(2):380–385. 10.1016/j.na.2010.08.048

    Article  MathSciNet  Google Scholar 

  22. Zhang S: Generalized mixed equilibrium problem in Banach spaces. Appl. Math. Mech. 2009, 30: 1105–1112. 10.1007/s10483-009-0904-6

    Article  Google Scholar 

  23. Zhang QB, Cheng CZ: Strong convergence theorem for a family of Lipschitz pseudocontractive mappings in a Hilbert space. Math. Comput. Model. 2008, 48: 480–485. 10.1016/j.mcm.2007.09.014

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the Centre of Excellence in Mathematics under the Commission on Higher Education, Ministry of Education, Thailand. They also thank the Editor and two anonymous referees for reading this paper carefully and providing valuable comments to improve the original version of this paper. The project was supported by Centre of Excellence in Mathematics, CHE, Si Ayutthaya Road, Bangkok, 10400, Thailand.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kasamsuk Ungchittrakool.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

All authors read and approved the final manuscript.

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

Ungchittrakool, K., Jarernsuk, A. Strong convergence by a hybrid algorithm for solving generalized mixed equilibrium problems and fixed point problems of a Lipschitz pseudo-contraction in Hilbert spaces. Fixed Point Theory Appl 2012, 147 (2012). https://doi.org/10.1186/1687-1812-2012-147

Download citation

  • Received:

  • Accepted:

  • Published:

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

Keywords