Two-Steps Hybrid Iterative Schemes With Errors For Generalized Equilibrium Problems And
Common Fixed Point Problems
Seung-Hyun Kim
y, Mee-Kwang Kang
z, Byung-Soo Lee
xReceived 5 April 2015
Abstract
In this paper, we consider a two-steps hybrid iterative scheme with errors for generalized equilibrium problems and common …xed point problems, and prove the weak limits of sequences fxng and fvng obtained under the given scheme for N …nite asymptotically ki-strictly pseudo-contractive mappingsfTigNi=1and a …rmly nonexpansive mappingSr are the same and hence the point is a common
…xed point offTigNi=1andSr.
1 Introduction
The applications of equilibrium problems and …xed point theory to many branches have been well-known for a long time in nonlinear analysis including optimization theory, economics, etc. (see [2, 3, 5, 7, 9, 12]).
Recently there have been many researches on approximating convergence of …xed points under iteration schemes with errors concerning equilibrium problems and vari- ational inequalities, etc. (see [2, 3, 4, 5, 9]).
On the other hand, Qin et al. [11] and Kumam et al. [6] considered equilibrium problems with …xed point problems under one-step hybrid iterative schemes and two- step hybrid iterative schemes, respectively, in Hilbert spaces.
Inspired by those results, we consider the following two-step hybrid iterative scheme with errors for generalized equilibrium problems and common …xed point problems, and obtain a result that the weak limits of sequences fxng andfvng obtained under the given scheme for N …nite asymptoticallyki-strictly pseudo-contractive mappings fTigNi=1 and a …rmly nonexpansive mappingSrare the same and that the same point is a common …xed point of fTigNi=1 andSr.
ALGORITHM 1.1. Let C be a closed convex subset of a Hilbert space H; Ti; : C ! C (i= 1;2; ; N) be mappings and :C C ! Rbe a bifunction. For any
Mathematics Sub ject Classi…cations: 47H09, 47H10.
yDepartment of Mathematics, Kyungsung University, Busan 608-736, Korea
zCorresponding author. Department of Mathematics, Dongeui University, Busan 614-714, Korea
xDepartment of Mathematics, Kyungsung University, Busan 608-736, Korea
276
x02C;letfxngandfvngbe sequences generated by ( (vn 1; y) +h vn 1; y vn 1i+r1
n 1hy vn 1; vn 1 xn 1i 0;
xn=an 1vn 1+bn 1Ti(n)h(n)vn 1+cn 1un 1, (1) for all y 2C andn2N, wherefang, fbng andfcng are sequences in[0;1)such that an +bn +cn = 1, an k+", bn " for some " 2 (0;1), P1
n=1
cn < 1, fung is a bounded sequence in C, frng is a sequence in (0;1) such that lim
n!1infrn > 0 and i(n) n(modN), h(n) =dNnewith a ceiling function d e.
REMARK 1.1. (a) Putting 0in (1), we obtain an algorithm ( (vn 1; y) +r1
n 1hy vn 1; vn 1 xn 1i 0 for ally2C;
xn=an 1vn 1+bn 1Ti(n)h(n)vn 1+cn 1un 1 for eachn2N: (2) (b) Puttingcn= 0for alln2Nin (2), we obtain the algorithm considered in [6]
( (vn 1; y) +r1
n 1hy vn 1; vn 1 xn 1i 0 for ally 2C;
xn =an 1vn 1+ (1 an 1)Ti(n)h(n)vn 1 or eachn2N: (3) (c) Putting 0 andvn=xn (n2N)in (3), we obtain the algorithm considered in [11]
xn=an 1xn 1+ (1 an 1)Ti(n)h(n)xn 1for eachn2N. (4)
2 Preliminaries
First of all, we recall some de…nitions and results needed in the main results.
DEFINITION 2.1. Let :C C!Rbe a function and :C!Cbe a nonlinear mapping. (a) is said to be monotone if (x; y) + (y; x) 0 for allx; y2C. (b) is said to be monotone ifh x y; x yi 0 for allx; y2C.
DEFINITION 2.2. A mapping T : C ! C is asymptotically k-strictly pseudo- contractive if there existk2[0;1)and a sequencefkng [1;1)with lim
n!1kn= 1such that
kTnx Tnyk2 k2nkx yk2+kk(I Tn)x (I Tn)yk2 for allx; y2C andn2N:
LEMMA 2.1 ([7, 10]). LetH be a real Hilbert space. Then we have the following identities:
(i) kx yk2=kxk2 kyk2 2hx y; yifor allx; y2H.
(ii) For allx; y2H anda; b; c2[0;1]with a+b+c= 1,
kax+by+czk2=akxk2+bkyk2+ckzk2 abkx yk2 bcky zk2 cakz xk2: (iii) Iffxngis a sequence inH weakly converging toz, then
nlim!1supkxn yk2= lim
n!1supkxn zk2+kz yk2 for ally2H:
LEMMA 2.2 ([10]). Letfang, fcng andf ng be nonnegative real sequences satis- fying the conditionan+1 (1 + n)an+cn for eachn2N. If
X1 n=1
n <1 and X1 n=1
cn<1; then lim
n!1an exists.
3 Main Results
We assume that the mapping :C C!Rsatis…es the following conditions:
(i) (x; x) = 0for allx2C;
(ii) is monotone;
(iii) is upper hemi-continuous in the …rst variable;
(iv) is convex and lower semi-continuous in the second variable.
We have the following theorems.
THEOREM 3.1. Let C be a closed convex subset of a Hilbert space H. Let :C!Cbe a monotone nonlinear mapping. Forr >0andx2H, de…ne a mapping Sr:H!2C by
Srx= z2C: (z; y) +h z; y zi+1
rhy z; z xi 0 for ally2C : Then the following statements (i)–(iii) hold.
(i) Srxis a singleton for eachx2H. (ii) Sr is …rmly nonexpansive, i.e.,
kSrx Sryk2 hSrx Sry; x yi forx; y2H:
(iii) The set F(Sr)of all …xed points of Sr is a closed and convex subset of C as a solution set of the following equilibrium problem considered in [9]: …ndingx2C such that (x; y) +h x; y xi 0 for ally2C.
PROOF. (i) We put (x; y) = (x; y)+h x; y xifor allx; y2C:By the conditions of and [1, Theorem 1], we see thatSrx6=; for anyx2C. Next, we show that Srx is a singleton forx2C. Suppose thatz1; z22Srx. Then
8<
:
(z1; y) +h z1; y z1i+1rhy z1; z1 xi 0 fory2C, (z2; y) +h z2; y z2i+1rhy z2; z2 xi 0 fory2C.
(5)
Putting y=z2 in the …rst inequality andy=z1 in the second inequality (5), respec- tively and adding them, we have
(z1; z2) + (z2; z1) +h z1 z2; z2 z1i 1
rkz1 z2k2:
Since (z1; z2) + (z2; z1) 0 and h z1 z2; z2 z1i 0, we have z1=z2. So we prove statement (i).
(ii) Letz=Srxandz0=Srx0. Then (
(z; z0) +h z; z0 zi+1rhz0 z; z xi 0;
(z0; z) +h z0; z z0i+1rhz z0; z0 x0i 0:
Adding two inequalities and applying the monotonicity of and , we have hSrx Srx0; x x0i=hz z0; x x0i kz z0k2=kSrx Srx0k2: Hence,Sr is a …rmly nonexpansive mapping. So we prove statement (ii).
(iii) Ifx2F(Sr), then
(x; y) +h x; y xi= (x; y) +h x; y xi+1
rhy x; x xi 0
for ally2C. Soxis a solution of the equilibrium problem in [9]. Next, letfxngbe a convergent sequence in F(Sr) with a limitx2H. Since F(Sr) C and C is closed, we have x2C. Also,Sr is continuous. Then we have
x= lim
n!1xn= lim
n!1Srxn =Srx:
It means that x2F(Sr), that is,F(Sr)is closed.
To show that F(Sr) is convex, we let z = x+ (1 )y for x; y 2 F(Sr) and 2[0;1]. By Lemma 2.1(ii) and the nonexpansiveness ofSr, we have
kz Srzk2 = k (x Srz) + (1 )(y Srz)k2
= kx Srzk2+ (1 )ky Srzk2 (1 )kx yk2 kx zk2+ (1 )ky zk2 (1 )kx yk2
= kx ( x+ (1 )y)k2+ (1 )ky ( x+ (1 )y)k2 (1 )kx yk2
= (1 )2kx yk2+ (1 ) 2kx yk2 (1 )kx yk2= 0:
Hence, Srz =z and z 2 F(Sr). Therefore F(Sr) is convex. So we prove statement (iii).
The proof of Theorem 3.1 is complete.
REMARK 3.1. By putting 0 in Theorem 3.1, we obtain [4, Lemma 2.12].
Next, we consider our main result.
THEOREM 3.2. Assume that the mappingsTi : C !C fori = 1; ; N satisfy the following conditions:
(i) Cis a closed convex subset of a Hilbert space H;
(ii) Ti is asymptoticallyki-strictly pseudo-contractive forki2[0;1),i= 1;2; ; N and for eachi2 f1;2; ; Ng,fkn;igis a sequence in[1;1)such that P1
n=1
(kn;i2 1)<1;
(iii) k= maxfki: 1 i Ngandk0n= maxfkn;i: 1 i Ng for eachn2N. Let :C!C be a monotone nonlinear mapping with
F :=
\N i=1
F(Ti)
!\
F(Sr)6=;:
For any x0 2 C, letfxng and fvng be sequences generated by Algorithm 1.1. Then fxngandfvngconverge weakly to the unique same element ofF.
PROOF. Let p2 F. By Algorithm 1.1 and Theorem 3.1(i), we see that vn 1 = Srn 1xn 1and
kvn 1 pk=kSrn 1xn 1 Srn 1pk kxn 1 pk
for eachn2N. By Algorithm 1.1 and Lemma 2.1(ii), we have
kxn pk2 = an 1(vn 1 p) +bn 1(Ti(n)h(n)vn 1 p) +cn 1(un 1 p) 2 an 1kvn 1 pk2+bn 1 Ti(n)h(n)vn 1 Ti(n)h(n)p 2+cn 1kun 1 pk2
an 1bn 1 Ti(n)h(n)vn 1 vn 1 2
an 1kvn 1 pk2+bn 1 (kh(n)0 )2kvn 1 pk2+k (I Ti(n)h(n))vn 1
(I Ti(n)h(n))p 2 +cn 1kun 1 pk2 an 1bn 1 Ti(n)h(n)vn 1 vn 1 2 (k0h(n))2kvn 1 pk2 bn 1(an 1 k) Ti(n)h(n)vn 1 vn 1
2
+cn 1kun 1 pk2 (6) h
1 + ((kh(n)0 )2 1) i
kxn 1 pk2+cn 1kun 1 pk2: (7) Since P1
n=1
(kn;i2 1)<1, and by Lemma 2.2, we see that lim
n!1kxn pk exists. On the other hand, since an k+"andbn "forn2Nand some "2(0;1), we have
(k0h(n))2kxn 1 pk2 kxn pk2+cn 1kun 1 pk2 bn 1(an 1 k)kTi(n)h(n)vn 1 vn 1k2
"2kTi(n)h(n)vn 1 vn 1k2: Since lim
n!1k0h(n) = 1 and lim
n!1cn = 0, taking the limits as n ! 1 in the above inequality, we have
nlim!1 Ti(n)h(n)vn 1 vn 1 2= 0: (8) Observe that
kxn vn 1k = an 1vn 1+bn 1Ti(n)h(n)vn 1+cn 1un 1 vn 1
= (1 an 1) vn 1 Ti(n)h(n)vn 1 +cn 1 un 1 Ti(n)h(n)vn 1
(1 an 1) vn 1 Ti(n)h(n)vn 1 +cn 1 un 1 Ti(n)h(n)vn 1 :
By (8), we see that
nlim!1kxn vn 1k= 0: (9)
By the …rm nonexpansiveness of Srn 1 and Lemma 2.1(i), we have
kvn 1 pk2=kSrn 1xn 1 Srn 1pk2 hSrn 1xn 1 Srn 1p; xn 1 pi
=hvn 1 p; xn 1 pi= h (xn 1 vn 1) (xn 1 p); xn 1 pi
= 1
2 kxn 1 vn 1k2 kxn 1 pk2 kvn 1 pk2 ; and hence
kvn 1 pk2 kxn 1 pk2 kxn 1 vn 1k2: Applying this inequality to (6), we have
kxn pk2 kh(n)0 2(kxn 1 pk2 kxn 1 vn 1k2) +cn 1kun 1 pk2: Since lim
n!1kxn pkexists and lim
n!1kh(n)0 = 1, we see that
nlim!1kxn 1 vn 1k= 0: (10)
Applying (9) and (10) to the triangle inequality, we have
kvn vn 1k kvn xnk+kxn vn 1k !0 asn! 1; which implies that
nlim!1kvn vn+jk= 0 forj2 f1; ; Ng: (11) Similarly, applying (10) and (11) to the triangle inequality, we obtain
kxn xn 1k kxn vnk+kvn vn 1k+kvn 1 xn 1k !0 asn! 1; which implies that lim
n!1kxn xn+jk= 0 forj 2 f1; ; Ng. On the other hand, kvn 1 Tnvn 1k vn 1 Ti(n)h(n)vn 1 + Ti(n)Ti(n)h(n) 1vn 1 Ti(n)vn 1
vn 1 Ti(n)h(n)vn 1 +L Ti(n)h(n) 1vn 1 Ti(n N)h(n) 1vn N
+ Ti(n N)h(n) 1vn N vn N 1 +kvn N 1 vn 1k ; (12) where
L= sup
(k+p
1 + (k2n 1)(1 k)
1 k :n2N
) :
Since, for eachn > N,n= (h(n) 1)N+i(n),i(n N) =i(n)andh(n N) =h(n) 1, Ti(n)h(n) 1vn 1 Ti(n N)h(n) 1vn N = Ti(n)h(n) 1vn 1 Ti(n)h(n) 1vn N
Lkvn 1 vn Nk (13)
and
Ti(n Nh(n) 1)vn N vn N 1
Ti(n Nh(n N))vn N Ti(n N)h(n N)vn N 1 + Ti(n N)h(n N)vn N 1 vn N 1
L kvn N vn N 1k+ Ti(n N)h(n N)vn N 1 vn N 1 : (14) So by (12)–(14), we see that
kvn 1 Tnvn 1k
vn 1 Ti(n)h(n)vn 1 +L n
Ti(n)h(n) 1vn 1 Ti(n N)h(n) 1vn N
+ Ti(n Nh(n) 1)vn N vn N 1 +kvn N 1 vn 1ko
vn 1 Ti(n)h(n)vn 1 +L fLkvn 1 vn Nk+L kvn N vn N 1k + Ti(n Nh(n N))vn N 1 vn N 1 +kvn N 1 vn 1k
o :
By (8) and (11), we have that lim
n!1kvn 1 Tnvn 1k= 0. Since
kvn Tnvnk kvn vn 1k+kvn 1 Tnvn 1k+kTnvn 1 Tnvnk (1 +L) kvn vn 1k+kvn 1 Tnvn 1k !0asn! 1; for anyj = 1; ; N, we have
kvn Tn+jvnk kvn vn+jk+kvn+j Tn+jvn+jk+kTn+jvn+j Tn+jvnk (1 +L) kvn vn+jk+kvn+j Tn+jvn+jk !0asn! 1; which gives that lim
n!1kvn Tlvnk = 0 for l 2 f1; ; Ng. Moreover, for each l 2 f1; ; Ng, we have
kxn Tlxnk kxn vnk+kvn Tlvnk+kTlvn Tlxnk
(1 +L) kxn vnk+kvn Tlvnk !0 asn! 1: Put
W(xn) =fx2H :xni * xfor some subsequencefxnigoffxngg: ThenW(xn)6=;by the fact thatfxngis bounded inH. Next, we claim thatW(xn) F. Letw2W(xn)be an arbitrary element. Then there exists a subsequencefxnigof fxngconverging weakly to w. Since lim
n!1kxn vnk= 0, we can obtain thatvni* w asi! 1. By the fact that lim
n!1kvn Tlvnk= 0,Tlvni !wforl2 f1; ; Ng. Now, we show that wis a …xed point ofSr. Sincevn =Trnvn for each n2N, we have
(vn; y) +h vn; y vni+ 1
rnhy vn; vn xni 0 for ally2Candn2N: By the monotonicity of , we have
hy vni;vni xni rni
i (y; vni) +h vni; vni yifori2N. Since vnir xni
ni !0 andvni* was i! 1, and by the condition (iv) of , we have (y; w) +h w; w yi 0 fory2C:
By the conditions (i) and (iv) of , we see that 0 = (yt; yt) t (yt; y) + (1 t) (yt; w)
t (yt; y) + (1 t)h w; yt wi=t (yt; y) + (1 t)th w; y wi (yt; y) + (1 t)h w; y wi;
where t2(0;1],y2C, andyt=ty+ (1 t)w. By the condition (iii) of , 0 (w; y) +h w; y wi for ally2C;
which shows that w2F(Sr). Moreover,w2 TN l=1
F(Tl). In fact, ifw62F(Tl)for some l2 f1; ; Ng, then from the Opial’s condition and the fact that lim
n!1kxn Tlxnk= 0,
ilim!1infkxni wk< lim
i!1infkxni Tlwk lim
i!1inffkxni Tlxnik+kTlxni Tlwkg
ilim!1infL kxni wk;
which derives a contradiction. Consequently, we have w2F =
\N l=1
F(Tl)
!\ F(Sr):
Finally, we show thatfxng andfvngconverge weakly to the unique same element ofF. Indeed, it is su¢ cient to show that W(xn)is a singleton. We take anyw1; w22 W(xn) and let fxnig and fxnjg be subsequences of fxng such that xni * w1 and xnj * w2. Since lim
n!1kxn pk exists for each p 2 F and w1; w2 2 F, by Lemma 2.1(iii), we obtain
lim sup
n!1 kxn w1k2= lim sup
j!1 kxnj w1k2= lim sup
j!1 kxnj w2k2+kw2 w1k2
= lim sup
i!1 kxni w2k2+kw2 w1k2
= lim sup
i!1 kxni w1k2+ 2kw2 w1k2
= lim sup
n!1 kxn w1k2+ 2kw2 w1k2:
Hence w1=w2, which shows thatW(xn)is a singleton. The proof of Theorem 3.2 is complete.
We have the following theorems in [6, 11] as corollaries of Theorem 3.2.
THEOREM 3.3 ([6]). Assume that the conditions (i)–(iii) in Theorem 3.2 hold and that satis…es
F :=
\N i=1
F(Ti)
!\
S( )6=;:
For any x0 2 C, let fxng and fvng be sequences generated by (3), where n = (h 1)N +i(n 1), i = i(n) 2 f1;2; ; Ng, h = h(n) 1 is a positive integer and h(n)! 1 as n ! 1. Let fang and frng be sequences satisfying fang [ ; ] for some ; 2(k;1), frng (0;1)and lim
n!1infrn >0. Then fxng andfvng converge weakly to an element ofF.
THEOREM 3.4 ([11]). Assume that the conditions (i)–(iii) in Theorem 3.2 hold and
F :=
\N i=1
F(Ti)
!
6
=;:
For any x02C, letfxngbe a sequence generated by (4), where fang is a sequence in (0;1)such thatk+" an 1 "for some"2(0;1),n= (h 1)N+i(n 1);where i=i(n)2 f1;2; ; Ng, h=h(n) 1 is a positive integer andh(n)! 1 asn! 1. Thenfxngconverges weakly to an element ofF.
REMARK 3.2. Our result is a weak convergence under Algorithm 1.1 for a …nite family of asymptoticallyki-strictly pseudo-contractive mappings in Hilbert spaces. The convergences, mappings and spaces need to be more weakened, for examples, strongly convergences, asymptotically nonexpansive mappings andCAT(0)-spaces, respectively.
Till now, many kinds of strong convergence results are well-known, but the weak con- vergence results are few. So, we suggest the following open problem.
Open problem. Dofxngandfvng weakly converge for a …nite family of asymptot- ically nonexpansive mappings with Algorithm 1.1 under suitable conditions?
Acknowledgment. This work was supported by Dong-eui University Foundation Grant (2013).
References
[1] E. Blum and W. Oettli, From optimization and variational inequalities to equilib- rium problems, Math. Student, 63(1994), 123–145.
[2] S. S. Chang, H. W. J. Lee and C. K. Chan, A new hybrid method for solving a generalized equilibrium problem, …xed point problem and variational inequality problem with application to optimization, Nonlinear Anal., 70(2009), 3307–3310.
[3] S. S. Chang, H. W. J. Lee and C. K. Chan, A new method for solving equilibrium problem solving a variational iequality problem and obtaining common …xed points in Banach spaces, with applications, Nonlinear Anal., 73(2010), 2260–2270.
[4] P. L. Combettes and S. A. Hirstoaga, Equilibrium programming in Hilbert spaces, J. Nonlinear Convex Anal., 6(2005), 117–136.
[5] S. H. Kim and B. S. Lee, Weak convergence of a hybrid iterative scheme with errors for equilibrium problems and common …xed point problems, J. Korean Soc.
Math. Educ. Ser. B: Pure Appl. Math., 21(2014), 195–206.
[6] P. Kumam, N. Petrot and R. Wangkeeree, A hybrid iterative scheme for equi- librium problems and …xed point problems of asymptotically k-strict pseudo- contractions, J. Comp. Appl. Math., 233(2010), 2013–2026.
[7] G. Marino and H. K. Xu, Weak and strong convergence theorems for strict pseudo- contractions in Hilbert space, J. Math. Anal. Appl., 329(2007), 336–346.
[8] A. Mouda…, Mixed equilibrium problems: Sensitivity analysis and algorithm as- pect, Comp. Math. Appl., 44(2002), 1099–1108.
[9] A. Mouda… and M. Théra, Proximal and Dynamical Approaches to Equilib- rium Problems, Lecture Notes in Economics and Mathematical Systems, vol. 477, Springer-Verlag, New York, 1999.
[10] M. O. Osilike and D. I. Igbokwe, Weak and strong convergence theorems for …xed points of pseudocontractions and solutions of monotone type operator equations, Comput. Math. Appl., 40(2000), 559–567.
[11] X. Qin, Y. J. Cho, S. M. Kang and M. Shang, A hybrid iterative scheme for asymptotically k-strict pseudo-contractions in Hilbert spaces, Nonlinear Anal., 70(2009), 1902–1911.
[12] Y. Tanaka, On Constructive versions of the tychono¤ and Schauder …xed point theorems, Appl. Math. E-Notes, 11(2011), 125–132.