• No results found

Weak and Strong Convergence Theorems of an Implicit Iteration Process for a Countable Family of Nonexpansive Mappings

N/A
N/A
Protected

Academic year: 2020

Share "Weak and Strong Convergence Theorems of an Implicit Iteration Process for a Countable Family of Nonexpansive Mappings"

Copied!
18
0
0

Loading.... (view fulltext now)

Full text

(1)

Volume 2008, Article ID 732193,18pages doi:10.1155/2008/732193

Research Article

Weak and Strong Convergence Theorems of

an Implicit Iteration Process for a Countable

Family of Nonexpansive Mappings

Kittikorn Nakprasit,1Weerayuth Nilsrakoo,2and Satit Saejung1

1Department of Mathematics, Khon Kaen University, Khon Kaen 40002, Thailand 2Department of Mathematics, Statistics and Computer, Ubon Rajathanee University,

Ubon Ratchathani 34190, Thailand

Correspondence should be addressed to Satit Saejung,[email protected]

Received 22 July 2008; Accepted 18 November 2008

Recommended by Anthony Lau

Using the implicit iteration and the hybrid method in mathematical programming, we prove weak and strong convergence theorems for finding common fixed points of a countable family of nonexpansive mappings in a real Hilbert space. Our results include many convergence theorems by Xu and Ori2001and Zhang and Su2007as special cases. We also apply our method to find a common element to the set of fixed points of a nonexpansive mapping and the set of solutions of an equilibrium problem. Finally, we propose an iteration to obtain convergence theorems for a continuous monotone mapping.

Copyrightq2008 Kittikorn Nakprasit et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

1. Introduction

LetHbe a real Hilbert space with inner product·,·and norm·,and letCbe a nonempty subset ofH. A mappingT :CHis said to benonexpansiveif

TxTyxyx, yC. 1.1

We denote byFTthe set of all fixed points ofT. IfCis bounded closed convex andT is a nonexpansive mapping ofCinto itself, thenFTis nonemptysee1. We writexnx

xn x, resp.if {xn} converges strongly weakly, resp. to x. There are many methods

(2)

x1α1x01−α1T1x1,

x2α2x11−α2T2x2, ..

.

xNαNxN−1

1−αNTNxN,

xN1αN1xN1−αN1

T1xN1

.. .

1.2

where{αn}is a sequence in0,1. The iteration above can be written in the following compact form:

xnαnxn−1

1−αnTnxn, n≥1, 1.3

whereTnTnmodN,here the mod Nfunction takes values in{1,2, . . . , N}.They proved that

this process converges weakly to a common fixed point of{Ti}Ni1. Recently, to obtain a strong convergence theorem, Zhang and Su 3 modify iteration processes 1.3 by the implicit hybrid method for a finite family of nonexpansive mappings{Ti}Ni1: an initial pointx0C,

x0Cis arbitrary,

ynαnxn1−αnTnzn,

znβnyn1−βnTnyn,

CnzC:ynzxnz,

QnzC:xnz, x0xn≥0,

xn1PCnQnx0, n0,1,2, . . . ,

1.4

whereTnTnmodN, {αn}and{βn}are real sequences in0,1withαn<1.

In this paper, we establish weak and strong convergence theorems for finding common fixed points of a countable family of nonexpansive mappings in a real Hilbert space. Our results include many convergence theorems by 2, Theorems 2 and 3, Theorems 2.4 as special cases. The new iteration introduced in this paper is applied to find a common element to the set of fixed points of a nonexpansive mapping and the set of solutions of an equilibrium problem. We also propose an iteration to obtain convergence theorems for a continuous monotone mapping.

2. Preliminaries

LetHbe a real Hilbert space. Then,

xy2x2y22xy, y, 2.1

λx 1−λy2λx2 1λy2λ1λxy2 2.2

(3)

1Opial’s condition4, that is, for any sequence{xn}withxn x, the inequality

lim inf

n→ ∞ xnx<lim infn→ ∞ xny 2.3

holds for everyyHwithy /x.

2The Kadec-Klee property 1, that is, for any sequence {xn} with xn x and xnxtogether impliesxnx → 0.

LetCbe a nonempty closed convex subset ofH. Then, for anyxH, there exists the nearest pointPCxinCsuch that

xPCxxyyC. 2.4

Such a mapping, PC is called the metric projection of H onto C. We know that PC is

nonexpansive. Furthermore, forxHandzC,

zPCx iffxz, zy ≥0∀yC. 2.5

Lemma 2.1see5, Lemma 1. Suppose that{an}and{bn}are two sequences of nonnegative real numbers such that

an1≤anbnn≥1, 2.6

andn1bn<∞, thenlimn→ ∞anexists. In particular, iflim infn→ ∞an0, thenlimn→ ∞an0.

Lemma 2.2see6, Lemma 2.2. Suppose that{an}and{bn}are two sequences of nonnegative real numbers such thatn1anandn1anbn<∞. Then,lim infn→ ∞bn0.

Lemma 2.3see7, Lemma 3.2. LetCbe a nonempty closed convex subset of a real Hilbert space

H. Let{xn}be a sequence inHsuch that

xn1yxny yC, nN. 2.7

Then, the sequence{PCxn}converges strongly to somezC.

To deal with a family of mappings, the following conditions are introduced. LetCbe a subset of a Banach space, let{Tn}andTbe families of mappings ofCwith ∞n1FTn

FT/∅, whereFTis the set of all common fixed points of all mappings inT.

a{Tn}is said to satisfy the AKTT-condition8if for each bounded subsetBofC,

n1

supTn1z−Tnz:zB<. 2.8

b{Tn}is said to satisfy the NST-conditionIwithT9if for each bounded sequence

{zn}inC,

lim

n→ ∞znTnzn0 implies limn→ ∞znTzn0 ∀T ∈ T. 2.9

(4)

c{Tn}is said to satisfy the NST-conditionII 9if for each bounded sequence{zn} inC,

lim

n→ ∞zn1−Tnzn0 implies limn→ ∞znTmzn0 ∀m∈N. 2.10

Inspired by conditions above, we introduce the following one.

d{Tn}is said to satisfy the NST∗-condition withTif for each bounded sequence{zn} inC,

lim

n→ ∞znTnzn0, nlim→ ∞znzn10 2.11

imply that limn→ ∞znTzn 0 for allT ∈ T. In particular, ifT {T}, then we simply say that{Tn}satisfies the NST∗-condition withT.

Remark 2.4. iIf {Tn}satisfies the NST-conditionIwith T, then {Tn} satisfies the NST∗ -condition withT.

iiIf{Tn}satisfies the NST-conditionII, then{Tn}satisfies the NST∗-condition with

{Tn}.

Lemma 2.5 see8, Lemma 3.2. LetCbe a nonempty closed subset of a Banach space, and let {Tn}be a family of mappings ofCinto itself which satisfies the AKTT-condition, then there exists a mappingT :CCsuch that

Tx lim

n→ ∞TnxxC, 2.12

andlimn→ ∞sup{TzTnz:zB}0for each bounded subsetBofC.

Lemma 2.6. LetCbe a nonempty closed subset of a Banach space, and let{Tn}be a family of mappings ofCinto itself which satisfies AKTT-condition andn1FTn/. LetTbe the mapping fromCinto itself defined byTz limn→ ∞Tnzfor allzCand suppose thatFTn1FTn. Then,{Tn}

satisfies the NST-condition (I) withT. This implies that{Tn}satisfies the NST-condition withT. Proof. Let {zn} be a bounded sequence in Csuch that limn→ ∞znTnzn 0.We apply

Lemma 2.5to get

znTznznTnznTnznTzn

znTnznsupTnzTz:zzn−→0.

2.13

Hence, we obtain that{Tn}satisfies the NST-conditionIwithT. This completes the proof.

Lemma 2.7. Let C be a nonempty subset of a Banach space, and let {Tn}Nn1 be a finite family of nonexpansive mappings of Cinto itself with a common fixed point. Then,{Tn} satisfies NST -condition withT{T1, T2, . . . , TN}, whereTnTnmodN.

Proof. Let{zn}be a bounded sequence inCsuch that lim

(5)

Obviously, it is easy to see that limn→ ∞znizn0 for eachi1,2, . . . , N. Consequently,

znTniznznznizniTnizniTnizniTnizn

≤2znznizniTnizni−→0 asn−→ ∞.

2.15

This implies that limn→ ∞znTmzn0 for eachm1,2, . . . , N. This completes the proof.

Remark 2.8. There are families of mappings{Tn}andTsuch that

1{Tn}satisfies the NST∗-condition withT;

2{Tn}fails the NST-conditionIwithTand the NST-conditionII.

The following example shows that the NST∗-condition withTis strictly weaker than NST-conditionIwithTand the NST-conditionII.

Example 2.9. LetH:R2andC: 0,1×0,1. DefineT1, T2:C Cas follows:

T1x, y x,1−y, T2x, y 1−x, y 2.16

for allx, yC. Hence,T1andT2are nonexpansive mappings with

FT1FT2

0,

1 2

1 2

×0,1

1 2,

1 2

/

. 2.17

LetTnTnmod 2. ByLemma 2.7, we have{Tn}satisfies NST∗-condition with{T1, T2}.

a{Tn}fails the NST-condition Iwith T {T1, T2}. In fact, letz2n1 1,1/2and z2n 1/2,1for alln∈N. Then,z2n−1 ∈FT2n−1 FT1andz2nFT2n FT2.

In particular,znTnzn ≡0. Clearly,

znT1zn0, znT2zn0. 2.18

Hence,{Tn}fails the NST-conditionIwith{T1, T2}.

b{Tn} fails the NST-condition II. To this end, let z4n−3 1/4,1/4, z4n−2

1/4,3/4, z4n−1 3/4,3/4, andz4n 3/4,1/4for all n ∈ N. Then,zn1 − Tnzn ≡0. But,

znT1zn0, znT2zn0. 2.19

Hence,{Tn}fails the NST-conditionII.

Lemma 2.10see10. LetCbe a nonempty closed convex subset of a strictly convex Banach space,

SandTbe two nonexpansive mappings ofCinto itself with a common fixed point, and0< β <1. Let

Ube a mapping defined by

UTβI 1−βS, 2.20

whereIis the identity mapping. Then,Uis a nonexpansive mapping fromCinto itself andFU

(6)

Lemma 2.11. LetCbe a nonempty closed convex subset of a strictly convex Banach space. Let{Tn} andTbe two families of nonexpansive mappings fromCinto itself such thatn1FTn FT/, and suppose that{Tn} satisfies the NST-condition withT. Let {Un} be a family of nonexpansive mappings fromCinto itself defined by

UnTnβnI1−βnTn 2.21

for alln ∈N, whereI is the identity mapping, and{βn}is a sequence ina,1for somea ∈0,1. Then,{Un}satisfies the NST-condition withT.

Proof. ByLemma 2.10, we haveFUn FTnfor alln∈Nand so,

n1

FUnFT/. 2.22

Let{zn}be a bounded sequence inCsuch that

lim

n→ ∞znUnzn0, nlim→ ∞zn1−zn0. 2.23

Since

znTnznznUnznTn

βnzn1−βnTnznTnznznUnzn1−βnznTnzn

znUnzn 1−aznTnzn,

2.24

it follows that

znTnzn 1

aznUnzn−→0. 2.25

Since{Tn}satisfies the NST∗-condition withT, we have

lim

n→ ∞znTzn0 ∀T ∈ T. 2.26

Hence, we obtain that{Un}satisfies the NST∗-condition withT. This completes the proof.

3. Weak convergence theorems

Lemma 3.1. LetCbe a nonempty closed convex subset of a real Hilbert spaceH. Let{Tn}be a family of nonexpansive mappings fromCinto itself with a common fixed point. Let{xn}be a sequence inC defined byx0Cand

xnαnxn−1

1−αnTnxn 3.1

for alln∈N, where{αn}is a sequence in0,1. Then,

ilimn→ ∞xnpexists for eachp∈∞n1FTn;

(7)

Proof. Observe that ifCis a nonempty closed convex subset of a real Hilbert space Hand

T : CC is a nonexpansive mapping, then for everyuC, α ∈ 0,1, the mapping

SSα,T:CCdefined by

Sxαu 1−αTx xC 3.2

is a1−α-contraction, that is, for allx, yC,

SxSy 1−αTxTy ≤1−αxy. 3.3

Consequently,Shas a unique fixed pointx∗∈C. Thus, there exists a uniquex∗∈C, that is,

xαu 1αTx. 3.4

This implies that the implicit iteration scheme 3.1 is well defined. To seei, we letp

n1FTn. It follows from2.2that

xnp2 α

nxn−1−p

1−αnTnxnp2

αnxn−1−p2

1−αnTnxnp2−αn1−αnxn−1−Tnxn2

αnxn−1−p2

1−αnxnp2−αn1−αnxn1−Tnxn2.

3.5

Sinceαn>0, we have

xnp2x

n−1−p2−

1−αnxn−1−Tnxn2. 3.6

In particular,

xnpxn1p. 3.7

So, limn→ ∞xnpexists. Furthermore, from3.6, we have

1−αnxn−1−Tnxn2≤xn−1−p2−xnp2. 3.8

Summing from 1 tomand tending to infinity form, we haveii. This completes the proof.

Theorem 3.2. LetCbe a nonempty closed convex subset of a real Hilbert space H. Let {Tn}and T be two families of nonexpansive mappings fromCinto itself such thatn1FTn FT/, and suppose that{Tn}satisfies the NST-condition withT. Then, the sequence{xn}inCdefined by

3.1, where{αn}is a sequence in0, bfor someb∈0,1, converges weakly towFT. Moreover,

limn→ ∞PFTxnw.

Proof. It follows fromLemma 3.1ithat{xn}is bounded. ByLemma 3.1iiandαnb, we have

n1

xn1Tnxn2 <.

(8)

It follows that limn→ ∞xn−1−Tnxn0.From3.1, we immediately have

lim

n→ ∞xnTnxnnlim→ ∞αnxn−1−Tnxn0, 3.10

and so,

lim

n→ ∞xnxn−10. 3.11

Since{Tn}satisfies the NST∗-condition withT, we have

lim

n→ ∞xnTxn0 ∀T ∈ T. 3.12

We now extract a subsequence{xni}of{xn}such thatxni w. So, by the demiclosedness

principle,wFT. To prove thatxn w, suppose that there exists another subsequence {xmj}of{xn}such thatxmj w/w. So, we havewFT. It follows fromLemma 3.1i

and Opial’s condition that

lim

n→ ∞xnwilim→ ∞xniw<ilim→ ∞xniw

lim

j→ ∞xmjw

< lim

j→ ∞xmjw

lim

n→ ∞xnw,

3.13

arriving at a contradiction. Hence,xn wFT.Finally, we prove that limn→ ∞zn w,

wherezn PFTxn for eachn ∈ N. By3.7andLemma 2.3, there isw0FTsuch that

znw0.FromznPFTxnandwFT, we have

xnzn, znw≥0 ∀n∈N. 3.14

It follows fromznw0andxn wthat

ww0, w0w≥0, 3.15

and thenw0w.This completes the proof.

UsingTheorem 3.2andLemma 2.7, we have the following result.

Corollary 3.3see2, Theorem 2. LetCbe a nonempty closed convex subset of a real Hilbert spaceH,and let{Tn}Nn1be a finite family of nonexpansive mappings ofCinto itself with a common fixed point. Then, the sequence{xn}inCdefined by1.3, where{αn}is a sequence in0, bfor some

b∈0,1, converges weakly towlimn→ ∞PN

n1FTnxn.

In the presence of the stronger condition than NST∗-condition withT, we are able to weaken the restriction on{αn}.

Theorem 3.4. Let Cbe a nonempty closed convex subset of a real Hilbert space H, and let{Tn} be a family of nonexpansive mappings of C into itself which satisfies the AKTT-condition and

n1FTn/. LetTbe the mapping fromCinto itself defined byTzlimn→ ∞Tnzfor allzC,and

(9)

Proof. By Lemmas2.2and3.1iiand n11−αn ∞, we have

lim inf

n→ ∞ xn−1−Tnxn0, 3.16

and hence,

lim inf

n→ ∞ xnTnxnlim infn→ ∞ αnxn−1−Tnxn0. 3.17

Next, we prove that the limit limn→ ∞xnTnxnexists. Since{xn}is bounded, it follows from

AKTT-condition that

n1

supTnzTn−1z:zxn<. 3.18

Notice that

xnxn1

1−αnxn1−Tnxn

≤1−αnxn−1−Tn−1xn−1Tn−1xn−1−Tn−1xnTn−1xnTnxn

≤1−αnxn−1−Tn−1xn−1

1−αnxn−1−xn

1−αnsupTnzTn1z:zxn,

3.19

so we have

αnxnxn−1≤

1−αnxn−1−Tn−1xn−1

1−αnsupTnzTn−1z:zxn.

3.20

It follows that

xnTnxn αn

1−αn

xnxn1

xn−1−Tn−1xn−1supTnzTn−1z:zxn.

3.21

ByLemma 2.1and3.18, we have limn→ ∞xnTnxnexists. Thus, we have

lim

n→ ∞xnTnxn0. 3.22

From the definition ofT, we haveT is nonexpansive. ByLemma 2.6, we have{Tn}satisfies the NST∗-condition withT. As in the proof ofTheorem 3.2,{xn}converges weakly to w

limn→ ∞PFTxn.

Remark 3.5. Since the NST∗-condition is implied by the AKTT-condition,Theorem 3.4still holds under the same condition of{αn}as inTheorem 3.2.

(10)

Corollary 3.6. LetCbe a nonempty closed convex subset of a real Hilbert spaceH. Let{αn}be a sequence in0,1withn11−αn ∞. Let{βkn}be a family of positive real numbers with indices

n, k∈Nwithknsuch that

i nk1βkn1for everyn∈N;

iilimn→ ∞βkn>0for everyk∈N;

iii ∞n1 nk1|βkn1βkn|<∞.

Let {Sk} be a family of nonexpansive mappings from C into itself with a common fixed point. Then, the sequence {xn} in C defined by 3.1, where Tnnk1βknSk, converges weakly to

wlimn→ ∞P

k1FSkxn.

4. Strong convergence theorems

We next use the hybrid method from mathematical programming to obtain several strong convergence theorems.

Theorem 4.1. LetCbe a nonempty closed convex subset of a real Hilbert spaceH. Let{Tn}andT be two families of nonexpansive mappings fromCinto itself such thatn1FTn FT/,and suppose that{Tn}satisfies the NST-condition withT. Let{xn}be a sequence inCdefined as follows:

x0Cis arbitrary,

ynαnxn1−αnTnyn,

CnzC:ynzxnz,

QnzC:xnz, x0xn≥0,

xn1PCnQnx0, n0,1,2, . . . ,

4.1

where{αn}is a sequence in0, bfor someb∈0,1. Then,{xn}converges strongly toPFTx0. Proof. We first prove thatCn andQn are closed and convex for eachn ∈N∪ {0}. From the definitions ofCnandQn, it is obvious thatCnis closed andQnis closed and convex for each

n∈N∪ {0}. We prove thatCnis convex. Sinceynzxnzis equivalent to

ynxn2

2ynxn, xnz≤0, 4.2

by2.1it follows thatCnis convex. Next, we show that

FT⊂Cnn∈N∪ {0}. 4.3

LetpFTandn∈N∪ {0}.Since

ynpαnxn

1−αnTnynpαnxnp1−αnTnynpαnxnp1−αnynp,

(11)

it follows that

ynpxnp, 4.5

and hence,pCn. Therefore, we obtain4.3. Now, we show that

FT⊂Qnn∈N∪ {0}. 4.6

We prove this by induction. Forn0, we haveFT⊂CQ0. Suppose thatFT⊂Qn. Then, ∅/FT⊂CnQnand there exists a unique elementxn1 ∈CnQnsuch thatxn1PCnQnx0.

Then,

xn1−z, x0xn1

≥0 4.7

for eachzCnQn. In particular,

xn1−p, x0xn1

≥0 4.8

for eachpFT. It follows thatFT⊂Qn1,and hence4.6holds. Therefore,

FT⊂CnQnn∈N∪ {0}. 4.9

This implies that{xn}is well defined. It follows from the definition ofQn thatxn PQnx0,

that is,

xnx0zx0 zQn and all nN∪ {0}. 4.10

In particular,

xnx0zx0 zFTand all n∈N∪ {0}. 4.11

On the other hand, fromxn1PCnQnx0Qn, we have

xnx0xn1x0 nN∪ {0}. 4.12

Therefore,{xnx0}is nondecreasing and bounded. So, limn→ ∞xnx0exists. This implies

that{xn}is bounded. Sincexn1 PCnQnx0Qn, we have

xnxn1, x0−xn≥0. 4.13

It follows from2.1that

xn1xn2x

n1−x0

xnx02

xn1−x02−xnx02−2xn1−xn, xnx0xn1−x02−xnx02

4.14

for alln∈N∪ {0}.This implies that

lim

(12)

Sincexn1∈Cn, we have

ynxnynxn1xnxn1

≤2xnxn1−→0.

4.16

It follows fromαnb <1 that

xnTnxnxnTnynTnynTnxn

xnTnynynxn

1

1−αn

ynxnynxn

≤ 1

1−bynxnynxn−→0.

4.17

Since{Tn}satisfies the NST∗-condition withT, we have

lim

n→ ∞xnTxn0 ∀T ∈ T. 4.18

Finally, we show thatxnw, wherew PFTx0. Since{xn} is bounded, let{xnk} be a

subsequence of{xn}such thatxnk w. SinceIT is demiclosed and by using4.18, we

havewFT. By4.11, we have

xnx0wx0. 4.19

It follows fromwPFTx0and the lower semicontinuity of the norm that

wx0wx0lim inf

k→ ∞ xnkx0≤lim supk→ ∞ xnkx0wx0. 4.20

Thus, we obtain that limk→ ∞xnkx0wx0wx0. Using the Kadec-Klee property ofH, we obtain that limk→ ∞xnk w w.Since{xnk}is an arbitrary subsequence of{xn},

we can conclude that the whole sequence{xn}converges strongly toPFTx0.

UsingTheorem 4.1and Lemmas2.7and2.11, we have the following result.

Corollary 4.2see3, Theorem 2.4. LetCbe a nonempty closed convex subset of a real Hilbert spaceH,and let{Tn}Nn1be a finite family of nonexpansive mappings ofCinto itself with a common fixed point. Then, the sequence{xn}inCdefined by1.4, where{αn}is a sequence in0, afor some

a∈0,1,and{βn}is a sequence inb,1for someb∈0,1, converges strongly toPN

n1FTnx0. 5. Applications

5.1. Equilibrium problems

LetCbe a nonempty closed convex subset of a real Hilbert spaceH. Letfbe a bifunction of

C×CintoR, whereRis the set of real numbers. The equilibrium problem forf:C×C → R is to findxCsuch that

(13)

The set of solutions of 5.1 is denoted by EPf. Numerous problems in physics, optimization, and economics are reduced to find a solution of 5.1. Some methods have been proposed to solve the equilibrium problem11–17. In 2005, Combettes and Hirstoaga

12introduced an iterative scheme of finding the best approximation to the initial data when EPfis nonempty, and they also proved a strong convergence theorem.

For solving the equilibrium problem, let us assume that the bifunctionf satisfies the following conditionssee11.

A1fx, x 0 for allxC;

A2fis monotone, that is,fx, y fy, x≤0 for anyx, yC;

A3fis upper-hemicontinuous, that is, for eachx, y, zC,

lim sup

t→0 f

tz 1−tx, yfx, y; 5.2

A4fx,·is convex and lower semicontinuous for eachxC.

The following lemma is shown in11, Corollary 1and12, Lemma 2.12.

Lemma 5.1. LetCbe a nonempty closed convex subset of a real Hilbert spaceH, letfbe a bifunction fromC×CintoRsatisfies (A1)–(A4), and letr >0andxH. Then, there exists a uniquex∗∈C such that

fx, y 1

r

yx, xx0 yC. 5.3

Moreover, letTr be a mapping ofHintoCdefined by

Trx x∗ ∀xH. 5.4

Then, the following conditions hold:

iTr is firmly nonexpansive, that is, for anyx, yH,

TrxTry2xy2T

rxxTryy2; 5.5

iiFTr EPf;

iiiEPfis closed and convex.

Lemma 5.2. Let C be a nonempty closed convex subset of a real Hilbert space H. Let S be a nonexpansive mapping of Cinto H, and letT be a firmly nonexpansive mapping fromH into C such thatFSFT/. Then,STis a nonexpansive mapping fromHinto itself and

FST FSFT. 5.6

Proof. SinceTis firmly nonexpansive, there exists a nonexpansive mappingUsuch thatT

1/2IUandFU FT. As in the proof ofLemma 2.10, the conclusion holds.

(14)

Theorem 5.3. Let C be a nonempty closed convex subset of a real Hilbert space H. Let f be a bifunction fromC×CintoRsatisfying (A1)–(A4), and letSbe a nonexpansive mapping ofCintoH such thatFSEPf/. Let{xn}and{un}be two sequences generated byx0Hand

fun, y r1 n

yun, unxn≥0 ∀yC,

xnαnxn−1

1−αnSun

5.7

for alln ∈ N, where{αn}is a sequence in0,1withn11−αn,and {rn}is a sequence in0,withlim infn→ ∞rn > 0andn1|rn1 −rn| < ∞. Then,{xn}converges weakly towFSEPf. Moreover,limn→ ∞PFSEPfxnw.

Proof. It is noted that the iteration scheme is well defined. As in the proof of14, Theorem 16, it follows from lim infn→ ∞rn>0 and ∞n1|rn1−rn|<∞that

n1

supTrn1zTrnz:zB

<∞ 5.8

for any bounded subsetBofH. Moreover, byLemma 2.5, the mappingT defined by

Tx lim

n→ ∞TrnxxH 5.9

satisfies

FT

n1

FTrnEPf. 5.10

It is easy to see thatT is a firmly nonexpansive mapping ofHintoC. WriteTnSTrn then,

byLemma 5.2, we haveTnis a nonexpansive mapping fromHinto itself, and

FTnFSTrnFSFTrnFS∩EPf FST 5.11

for alln∈Nand so,

n1

FTn FST FS∩EPf. 5.12

SinceSis nonexpansive,5.8and5.9, we have

n1

supTn1z−Tnz:zB<∞ 5.13

for any bounded subsetBofH,and

STxS

lim

n→ ∞Trnx

lim

n→ ∞STrnxnlim→ ∞TnxxH. 5.14

(15)

Similarly, we have the following strong convergence theorem. We safely suppress the proof.

Theorem 5.4. Let C be a nonempty closed convex subset of a real Hilbert space H. Let f be a bifunction fromC×CintoRsatisfying (A1)–(A4), and letSbe a nonexpansive mapping ofCintoH such thatFSEPf/. Let{xn}and{un}be two sequences generated byx0Hand

fun, yr1 n

yun, unyn≥0 ∀yC,

ynαnxn−1

1−αnSun,

CnzC:ynzxnz,

QnzC:xnz, x0xn≥0,

xn1PCnQnx0, n0,1,2, . . . ,

5.15

where {αn} is a sequence in 0, a for some a ∈ 0,1, and {rn} is a sequence in 0,with

lim infn→ ∞rn>0and n∞1|rn1−rn|<∞. Then,{xn}converges strongly toPFSEPfx0.

5.2. Convergence theorem for monotone mappings

LetHbe a real Hilbert space, andCbe a nonempty closed convex subset ofH. LetA:CH be a mapping. The classical variational inequality is to findxCsuch that

Ax, yx ≥0 ∀yC. 5.16

The set of solutions of classical variational inequality is denoted by VIPC, A. The variational inequality has been extensively studied in the literaturessee7,18–23and the references therein. We recall that a mappingA:CHis said to be

amonotone if

AuAv, uv ≥0 ∀u, vC; 5.17

bα-inverse-strongly monotone if there exists a constantα >0 such that

AuAv, uvαAuAv2 u, vC; 5.18

cr-strongly monotone if there exists a constantr >0 such that

AuAv, uvruv2 u, vC; 5.19

drelaxedγ, r-cocoercive if there exist constantsγ,r >0 such that

AuAv, uv ≥ −γAuAv2ruv2 u, vC; 5.20

eμ-Lipschitzian if there exists a constantμ >0 such that

(16)

Remark 5.5. 1Everyα-inverse-strongly monotone mapping is monotone and 1 -Lipschit-zian.

2Everyr-strongly monotone is monotone.

3 Every relaxed γ, r-cocoercive and μ-Lipschitzian mapping with γμ2 r is

monotone.

Lemma 5.6. Let C be a nonempty closed convex subset of a real Hilbert space H. Let A be a continuous monotone mapping ofCintoH. Define a bifunctionf :C×C → Ras follows:

fx, y Ax, yxx, yC. 5.22

Then,

i[14, Lemma 19]fsatisfies (A1)–(A4) and VIPC, A EPf;

ii[14, Lemma 20] IfxH, uC,andr >0, then

fu, y 1ryu, ux ≥0 ∀yC⇐⇒uPCxrAu. 5.23

UsingTheorem 5.3andLemma 5.6, we haveTheorem 5.7.

Theorem 5.7. Let C be a nonempty closed convex subset of a real Hilbert space H. Let A be a continuous monotone mapping ofC,and letS be a nonexpansive mapping of Cinto H such that

FSVIPC, A/. Let{xn}and{un}be sequences generated byx0Hand

unPCxnrnAun,

xnαnxn−1

1−αnSun

5.24

for alln ∈ N, where{αn}is a sequence in0,1withn11−αn,and {rn}is a sequence

in0,withlim infn→ ∞rn > 0andn1|rn1 −rn| < ∞. Then,{xn}converges weakly tow

FSVIPC, A. Moreover,limn→ ∞PFSVIPC,Axnw.

UsingTheorem 5.4andLemma 5.6, we also haveTheorem 5.8.

Theorem 5.8. Let C be a nonempty closed convex subset of a real Hilbert space H. Let A be a continuous monotone mapping ofC,and letS be a nonexpansive mapping of Cinto H such that

FSVIPC, A/. Let{xn}and{un}be sequences generated byx0Hand

unPCynrnAun,

ynαnxn−1

1−αnSun,

CnzC:ynzxnz,

QnzC:xnz, x0xn≥0,

xn1PCnQnx0, n0,1,2, . . . ,

5.25

where {αn} is a sequence in 0, a for some a ∈ 0,1, and {rn} is a sequence in 0,with

(17)

Remark 5.9. 1 By Remark 5.5, we obtain a strong convergence theorem for α -inverse-strongly monotone mappings,r-strongly monotone and continuous mappings and relaxed

γ, r-cocoercive andμ-Lipschitzian mappings withγμ2r.

2Some weak and strong convergence theorems for monotone Lipschitzian mappings were established by several authors 7, 18–23. However, there is a monotone continuous mapping which is not Lipschitziansee14, Remark 23. Therefore, Theorems5.7and5.8

provide a new convergence theorem for a wider class of mappings.

Acknowledgments

The authors would like to thank the referee for comments which improve the manuscript. Satit Saejung was supported by the Commission on Higher Education and the Thailand Research Fund under Grant MRG5180146.

References

1 K. Goebel and W. A. Kirk,Topics in Metric Fixed Point Theory, vol. 28 ofCambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge, UK, 1990.

2 H.-K. Xu and R. G. Ori, “An implicit iteration process for nonexpansive mappings,” Numerical Functional Analysis and Optimization, vol. 22, no. 5-6, pp. 767–773, 2001.

3 F. Zhang and Y. Su, “Strong convergence of modified implicit iteration processes for common fixed points of nonexpansive mappings,”Fixed Point Theory and Applications, vol. 2007, Article ID 48174, 9 pages, 2007.

4 Z. Opial, “Weak convergence of the sequence of successive approximations for nonexpansive mappings,”Bulletin of the American Mathematical Society, vol. 73, pp. 591–597, 1967.

5 K.-K. Tan and H. K. Xu, “Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process,”Journal of Mathematical Analysis and Applications, vol. 178, no. 2, pp. 301–308, 1993.

6 E. U. Ofoedu, “Strong convergence theorem for uniformlyL-Lipschitzian asymptotically pseudocon-tractive mapping in real Banach space,”Journal of Mathematical Analysis and Applications, vol. 321, no. 2, pp. 722–728, 2006.

7 W. Takahashi and M. Toyoda, “Weak convergence theorems for nonexpansive mappings and monotone mappings,”Journal of Optimization Theory and Applications, vol. 118, no. 2, pp. 417–428, 2003.

8 K. Aoyama, Y. Kimura, W. Takahashi, and M. Toyoda, “Approximation of common fixed points of a countable family of nonexpansive mappings in a Banach space,”Nonlinear Analysis: Theory, Methods & Applications, vol. 67, no. 8, pp. 2350–2360, 2007.

9 K. Nakajo, K. Shimoji, and W. Takahashi, “Strong convergence to common fixed points of families of nonexpansive mappings in Banach spaces,”Journal of Nonlinear and Convex Analysis, vol. 8, no. 1, pp. 11–34, 2007.

10 W. Takahashi and T. Tamura, “Convergence theorems for a pair of nonexpansive mappings,”Journal of Convex Analysis, vol. 5, no. 1, pp. 45–56, 1998.

11 E. Blum and W. Oettli, “From optimization and variational inequalities to equilibrium problems,”The Mathematics Student, vol. 63, no. 1–4, pp. 123–145, 1994.

12 P. L. Combettes and S. A. Hirstoaga, “Equilibrium programming in Hilbert spaces,” Journal of Nonlinear and Convex Analysis, vol. 6, no. 1, pp. 117–136, 2005.

13 S. D. Fl˚am and A. S. Antipin, “Equilibrium programming using proximal-like algorithms,”

Mathematical Programming, vol. 78, no. 1, pp. 29–41, 1997.

14 W. Nilsrakoo and S. Saejung, “Weak and strong convergence theorems for countable Lipschitzian mappings and its applications,”Nonlinear Analysis: Theory, Methods & Applications, vol. 69, no. 8, pp. 2695–2708, 2008.

15 W. Nilsrakoo and S. Saejung, “Equilibrium problems and Moudafi’s viscosity approximation methods in Hilbert spaces,” to appear inDynamics of Continuous, Discrete and Impulsive Systems.

(18)

17 S. Takahashi and W. Takahashi, “Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces,”Journal of Mathematical Analysis and Applications, vol. 331, no. 1, pp. 506–515, 2007.

18 H. Iiduka and W. Takahashi, “Strong convergence theorems for nonexpansive mappings and inverse-strongly monotone mappings,”Nonlinear Analysis: Theory, Methods & Applications, vol. 61, no. 3, pp. 341–350, 2005.

19 N. Nadezhkina and W. Takahashi, “Weak convergence theorem by an extragradient method for nonexpansive mappings and monotone mappings,”Journal of Optimization Theory and Applications, vol. 128, no. 1, pp. 191–201, 2006.

20 M. A. Noor and Z. Huang, “Three-step methods for nonexpansive mappings and variational inequalities,”Applied Mathematics and Computation, vol. 187, no. 2, pp. 680–685, 2007.

21 Y. Yao, Y.-C. Liou, and J.-C. Yao, “An extragradient method for fixed point problems and variational inequality problems,”Journal of Inequalities and Applications, vol. 2007, Article ID 38752, 12 pages, 2007.

22 Y. Yao and J.-C. Yao, “On modified iterative method for nonexpansive mappings and monotone mappings,”Applied Mathematics and Computation, vol. 186, no. 2, pp. 1551–1558, 2007.

References

Related documents

AUTOMATIC CLEANING OF SOLAR PANEL WITH MAXIMUM POWER TRACKING BY USING ARDUINO..

Methods: In a blinded, UK-wide, multi-centre, Zelen ’ s designed, 4-arm (postal, online, telephone, compared to face- to-face), pragmatic non-inferiority randomised controlled trial

The algorithm tries to modify the departure time of the trains (the due date of the job completion) due to information obtained at the pre-scheduling stage in order to decrease

Preference ranking methods are special types of MCDM approaches in which the decision maker’s preferences and preferences on criteria are aggregated together to

In this paper, a joint lot sizing and marketing problem was investigated by considering production of various types of non-perfect products. The products are classified in four

When proofreading or base selectivity is impaired by homologous active site point mutations in POL3 (encod- ing Pol δ ) and POL2 (encoding Pol ε ), the mutator effects are

In addition to the sampling properties, one result which becomes obvious from the present analysis is that subnets of the same size can differ quite considerably; and, in par-

It is clear, however, that when identical mtDNA haplotypes are shared among many ethnic groups from different parts of Africa, it is impossible to determine which single ethnic