• No results found

Convergence Theorems of Modified Ishikawa Iterative Scheme for Two Nonexpansive Semigroups

N/A
N/A
Protected

Academic year: 2020

Share "Convergence Theorems of Modified Ishikawa Iterative Scheme for Two Nonexpansive Semigroups"

Copied!
12
0
0

Loading.... (view fulltext now)

Full text

(1)

Volume 2010, Article ID 914702,12pages doi:10.1155/2010/914702

Research Article

Convergence Theorems of

Modified Ishikawa Iterative Scheme for

Two Nonexpansive Semigroups

Kriengsak Wattanawitoon and Poom Kumam

Department of Mathematics, Faculty of Science, King Mongkut’s University of Technology Thonburi (KMUTT), Bangmod, Thrungkru, Bangkok 10140, Thailand

Correspondence should be addressed to Poom Kumam,[email protected]

Received 26 September 2009; Accepted 24 November 2009

Academic Editor: Tomonari Suzuki

Copyrightq2010 K. Wattanawitoon and P. Kumam. 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.

We prove convergence theorems of modified Ishikawa iterative sequence for two nonexpansive semigroups in Hilbert spaces by the two hybrid methods. Our results improve and extend the corresponding results announced by Saejung2008and some others.

1. Introduction

LetCbe a subset of real Hilbert spaces Hwith the inner product·,·and the norm · .

T :CCis called a nonexpansive mapping if

TxTyxy x, yC. 1.1

We denote byFTthe set of fixed points ofT, that is,FT {xC:xTx}.

Let{Tt:t≥0}be a family of mappings from a subsetCofHinto itself. We call it a nonexpansive semigroup onCif the following conditions are satisfied:

iT0xxfor allxC;

iiTst TsTtfor alls, t≥0;

iiifor eachxCthe mappingtTtxis continuous;

(2)

The Mann’s iterative algorithm was introduced by Mann1in 1953. This iterative process is now known as Mann’s iterative process, which is defined as

xn1αnxn 1−αnTxn, n≥0, 1.2

where the initial guessx0is taken inCarbitrarily and the sequence{αn}n0is in the interval

0,1.

In 1967, Halpern2first introduced the following iterative scheme:

x0uC chosen arbitrarily,

xn1αnu 1−αnTxn,

1.3

see also Browder3. He pointed out that the conditions limn→ ∞αn0 and∞n1αn ∞are

necessary in the sence that, if the iteration1.3converges to a fixed point ofT, then these conditions must be satisfied.

On the other hand, in 2002, Suzuki4was the first to introduce the following implicit iteration process in Hilbert spaces:

xnαnu 1−αnTtnxn, n≥1, 1.4

for the nonexpansive semigroup. In 2005, Xu5established a Banach space version of the sequence1.4of Suzuki4.

In 2007, Chen and He 6 studied the viscosity approximation process for a nonexpansive semigroup and prove another strong convergence theorem for a nonexpansive semigroup in Banach spaces, which is defined by

xn1αnfxn 1−αnTtnxn,n∈N, 1.5

wheref:CCis a fixed contractive mapping.

Recently He and Chen7is proved a strong convergence theorem for nonexpansive semigroups in Hilbert spaces by hybrid method in the mathematical programming. Very recently, Saejung8proved a convergence theorem by the new iterative method introduced by Takahashi et al.9without Bochner integrals for a nonexpansive semigroup{Tt:t≥0} withF:∞t0FTt/∅in Hilbert spaces:

x0∈H taken arbitrary,

C1C,

x1PC1x0,

ynαnxn 1−αnTtnxn,

Cn1

zCn:ynzxnz,

xn1 PCn1x0,

1.6

(3)

In 1974, Ishikawa10introduced a new iterative scheme, which is defined recursively by

ynβnxn1−βnTxn,

xn1αnxn 1−αnTyn,

1.7

where the initial guessx0is taken inCarbitrarily and the sequences{αn}and{βn}are in the

interval0,1.

In this paper, motivated by the iterative sequences1.6given by Saejung in8and Ishikawa10, we introduce the modified Ishikawa iterative scheme for two nonexpansive semigroups in Hilbert spaces. Further, we obtain strong convergence theorems by using the hybrid methods. This result extends and improves the result of Saejung8and some others.

2. Preliminaries

This section collects some lemmas which will be used in the proofs for the main results in the next section.

It is known that every Hilbert spaceHsatisfies the Opial’s condition11, that is,

lim inf

n→ ∞ xnx<lim infn→ ∞ xny,yX, y /x. 2.1

Recall that the metricnearest pointprojectionPCfrom a Hilbert spaceHto a closed

convex subsetCofHis defined as follows. GivenxH, PCxis the only point inCwith the

property

xPCxinfxy:yC. 2.2

PCxis characterized as follows.

Lemma 2.1. LetHbe a real Hilbert space,Ca closed convex subset ofH. GivenxHandyC. ThenyPCxif and only if there holds the inequality

xy, yz≥0,zC. 2.3

Lemma 2.2. There holds the identity in a Hilbert spaceH

λx 1−λy2λx2 1−λy2−λ1−λxy2 2.4

(4)

Lemma 2.3see12, Lemma 1. Let{tn}be a real sequence and letτ be a real number such that

lim infntnτ≤lim supntn. Suppose that either of the following holds:

ilim supntn1−tn≤0or

iilim infntn1−tn≥0,

thenτ is a cluster point of{tn}. Moreover, forε > 0, k, m ∈ N, there exists m0 ≥ m such that |tjτ|< εfor every integerjwithm0≤jm0k.

3. Main Results

3.1. The Shrinking Projection Method

In this section, we prove strong convergence of an iterative sequence generated by the shrinking hybrid projection method in mathematical programming.

Theorem 3.1. LetC be a closed convex subset of a real Hilbert spaceH. Let{Tt : t ≥ 0}and {St : t ≥ 0}be nonexpansive semigroups onCwith a nonempty common fixed point setF, that is,F : ∞t0FTt∩∞t0FSt/. Let{αn} ⊂ 0, a ⊂ 0,1,{βn} ⊂ b, c ⊂ 0,1and {tn}be the sequences such thatlim infn→ ∞tn 0,lim supn→ ∞tn >0,andlimn→ ∞tn1−tn 0. Suppose that{xn}is a sequence generated by the following iterative scheme:

x0∈H taken arbitrary,

C1C,

x1PC1x0,

znβnxn1−βnTtnxn,

ynαnxn 1−αnStnzn,

Cn1

uCn:ynuxnu,

xn1 PCn1x0,

3.1

then{xn}converges strongly toPFx0.

Proof. We first show thatCn1is closed and convex for eachn≥0. From the definition ofCn1

it is obvious thatCn1 is closed for eachn ≥ 0. We show thatCn1is convex for any n≥ 0.

Since

ynuxnu ⇐⇒2xnyn, uxn2y

(5)

and henceCn1is convex. Next we show thatFCn1for alln≥0. LetpF, then we have

znpβnxn

1−βnTtnxnpβnxnp1−βnTtnxnpβnxnp1−βnxnpxnp,

3.3

ynpαnxn 1αnStnznp

αnxnp 1−αnStnznpαnxnp 1−αnznp.

3.4

Substituting3.3into3.4, we have

ynpxnp. 3.5

This means thatpCn1 for all n ≥ 0. Thus,{xn}is well defined. Sincexn PCnx0and

xn1∈Cn1 ⊂Cn, we get

x0−xn, xnxn1 ≥0 ∀n∈N. 3.6

Consequently,

0≤ x0−xn, xnxn1

x0−xn, xnx0x0−xn1

xnx0, xnx0x0−xn, x0−xn1

≤ −xnx02x0−xnx0−xn1,

3.7

forn∈N. This implies that

x0−xn ≤ x0−xn1 ∀n∈N. 3.8

Therefore,{x0−xn}is nondecreasing. FromxnPCnx0, we also havex0−xn, xnp ≥0, for allpCn.

SinceFCn, we get

(6)

Thus, forpF, we obtain

0≤ x0−xn, xnp

xnx0, xnx0 x0−xn, x0−p

≤ −xnx02x0−xnx0−p.

3.10

Thus,xnx0 ≤ x0−p, for allpFandn∈N. Then limn→ ∞xnx0exists and{xn}is

bounded.

Next, we show thatxn1−xn → 0 asn → ∞. From3.6we have

xnxn12xnx0x0−xn12

xnx022xnx0, x0−xn1x0−xn12

xnx022xnx0, x0−xnxnxn1x0−xn12

xnx02−2x0−xn, x0−xn −2x0−xn, xnxn1x0−xn12

xnx02−2xnx02x0−xn12

xnx02x0−xn12.

3.11

Since limn→ ∞xnx0exists, then

lim

n→ ∞xnxn10. 3.12

Further, as in the proof of8, page 3, we have{xn}which is a Cauchy sequence. So, we have

xn z.By definition ofyn, we have

ynxn 1αnStnznxn. 3.13

Sincexn1∈Cn1and3.12, we obtain

Stnznxn 11α n

ynxn

≤ 1

1−αn

ynxn1xn1xn

≤ 1

1−αnxnxn1xn1−xn

≤ 2

1−αnxnxn1 −→0 asn−→ ∞.

3.14

(7)

For pF, we have xnpxnStnzn ≤ Stnznp. This implies that

0≤ xnpznpxnStnzn → 0 and hencexnp2− znp2 → 0.Moreover, since

znp2β

nxnp21−βnTtnxnp2−βn1−βnxnTtnxn2, 3.15

we have

bcxnTtnxn2≤βn1−βnxnTtnxn2

βnxnp21−βnTtnxnp2−znp2

xnp2−znp2 −→0.

3.16

And sinceStnis a nonexpansive mapping, we obtain

xnStnxn ≤ xnStnznStnznStnxn,xnStnznznxn.

3.17

Sinceznxn 1−βnTtnxnxn → 0 andxnStnzn → 0, we obtain

lim

n→ ∞xnStnxn0. 3.18

As in the proof of12, Theorem 4, byLemma 2.3, we can choose a sequence{tnk}of positive real numbers such that

tnk −→0, 1

tnk

xnkTtnkxnk −→0, ask−→ ∞. 3.19

In similar way, we also have

tnk −→0, 1

tnk

(8)

Next, we show thatzF. To see this, we fixt >0,

xnkTtzt/tnk−1

j0

T

jtnk

xnkT

j1tnkxnk

T

t

tnk

tnk

xnkT

t

tnk

tnk

zT

t

tnk

tnk

zTtz

t

tnk

xnkTtnkxnkxnkz

T

t

t

tnk

tnk

zz

tt nk

xnkTtnkxnkxnkzsup{Tszz: 0≤stnk}.

3.21

Asxnkzand3.19, we obtainxnkTtzand soTtzz.Similarly, we haveStzz. ThuszF.

Finally, we show thatzPFx0.SinceFCn1andxn1PCn1x0,

xn1−x0 ≤qx0 ∀n∈N, qF. 3.22

Butxnzasn → ∞, we have

zx0 ≤qx0 ∀qF. 3.23

HencezPFx0as required. This completes the proof.

Corollary 3.2. Let C be a closed convex subset of a real Hilbert space H. Let {Tt : t ≥ 0} be nonexpansive semigroups onC with a nonempty common fixed point set F, that is, F :

t0FTt/. Let{αn} ⊂ 0, a ⊂ 0,1,{βn} ⊂ b, c ⊂ 0,1and{tn}be the sequences such thatlim infn→ ∞tn 0,lim supn→ ∞tn > 0,andlimn→ ∞tn1−tn 0. Suppose that {xn} is a sequence iteratively generated by the following iterative scheme:

x0∈H taken arbitrary,

C1C,

x1PC1x0,

ynαnxn 1−αnTtnzn,

znβnxn1−βnTtnxn,

Cn1

uCn:ynuxnu,

xn1 PCn1x0,

3.24

then{xn}converges strongly toPFx0.

(9)

Corollary 3.3see8, Theorem 2.1. LetCbe a closed convex subset of a real Hilbert spaceH. Let {Tt : t ≥ 0}be a nonexpansive semigroups on Cwith a nonempty common fixed point set

F, that is, F : ∞t0FTt/. Let {αn} ⊂ 0, a ⊂ 0,1and {tn} be the sequences such that

lim infn→ ∞tn0,lim supn→ ∞tn>0,andlimn→ ∞tn1−tn 0. Suppose that{xn}is a sequence iteratively generated by the following iterative scheme:

x0∈H taken arbitrary,

C1C,

x1PC1x0,

zn αnxn 1−αnTtnxn,

Cn1

uCn:ynuxnu,

xn1 PCn1x0,

3.25

thenxnPFx0.

Proof. IfStn Ttnfor alln ∈ NandTt I for everyt > 0 inTheorem 3.1then3.1

reduced to3.25. By usingTheorem 3.1, we get the following conclusion.

3.2. The CQ Hybrid Method

In this section, we consider the modified Ishikawa iterative scheme computing by the CQ hybrid method 13–15. We use the same idea as Saejung’s Theorem 2.2 in 8 and our

Theorem 3.1to obtain the following result and the proof is omitted.

Theorem 3.4. LetC be a closed convex subset of a real Hilbert spaceH. Let{Tt : t ≥ 0}and {St : t ≥ 0}be nonexpansive semigroups onCwith a nonempty common fixed point setF, that is,F : ∞t0FTt∩∞t0FSt/. Let{αn} ⊂ 0, a ⊂ 0,1,{βn} ⊂ b, c ⊂ 0,1and {tn}be the sequences such thatlim infn→ ∞tn 0,lim supn→ ∞tn >0,andlimn→ ∞tn1−tn 0. Suppose that{xn}is a sequence generated by the following iterative scheme:

x0∈H taken arbitrary,

ynαnxn 1−αnStnzn,

znβnxn1−βnTtnxn,

CnuC:ynuxnu,

Qn{uC:xnx0, uxn ≥0},

xn1PCnQnx0,

3.26

then{xn}converges strongly toPFx0.

Proof. First, we show that bothCn and Qn are closed and convex, and CnQn/∅ for all

n ∈ N∪ {0}. It follows easily from the definition thatCn and Qn are just intersection ofC

and the half-spaces see also 9. As in the proof of the preceding theorem, we haveF

(10)

we havepCkQk. In particular,xk1−x0, pxk1 ≥0,that is,pQk1. It follows from

the induction thatFQnfor alln∈N∪ {0}. This proves the claim. Next, we show thatxnTtnxn → 0,andxnStnxn → 0.

We first claim thatxn1−xn → 0.Indeed, asxn1∈QnandxnPQnx0,

xnx0 ≤ xn1−x0 ∀n∈N. 3.27

For fixedzF. It follows fromFQnfor alln∈Nthat

xnx0 ≤ zx0 ∀n∈N. 3.28

This implies that sequence{xn}is bounded and

lim

n→ ∞xnx0exists. 3.29

Notice that

xn1−xn, xnx0 ≥0. 3.30

This implies that

xn1−xn2 xn1−x02−2xn1−xn, xnx0 − x0−xn2

xn1−x02− xnx02−→0.

3.31

By using the same argument of Saejung 8, Theorem 2.2, page 6 and in the proof of

Theorem 3.1, we haveTtnxnxn → 0 andStnxnxn → 0. And we can choose a

subsequence{nk}of{n}such thatxnk zC,tnk → 0,1/tnkxnkTtnkxnk → 0 and

1/tnkxnkStnkxnk → 0 ask → ∞. From3.21, we obtain

lim sup

k→ ∞ xnkTtz

lim sup

k→ ∞ xnkz,

lim sup

k→ ∞ xnkStz ≤lim supk→ ∞ xnkz.

3.32

By the Opial’s condition ofH, we havezTtzandzStzfor allt >0, that is,zF. We note that

x0−PFx0 ≤ x0−z ≤lim inf

k→ ∞ x0−xnk ≤lim supk→ ∞ x0−xnkx0−PFx0. 3.33

This implies that

lim

(11)

Therefore,

xnk −→PFx0 z, ask−→ ∞. 3.35

Hence the whole sequence must converge to PFx0 z, as required. This completes the

proof.

Corollary 3.5. Let C be a closed convex subset of a real Hilbert space H. Let {Tt : t ≥ 0}

be nonexpansive semigroups on C with a nonempty common fixed point set F, that is, F :

t0FTt/. Let{αn} ⊂0, a⊂0,1,{βn} ⊂b, c⊂0,1and{tn}be the sequences such that

lim infn→ ∞tn0,lim supn→ ∞tn>0,andlimn→ ∞tn1−tn 0. Suppose that{xn}is a sequence iteratively generated by the following iterative scheme:

x0∈H taken arbitrary,

ynαnxn 1−αnTtnzn,

znβnxn1−βnTtnxn,

CnuC:ynuxnu,

Qn{uC:xnx0, uxn ≥0},

xn1PCnQnx0,

3.36

then{xn}converges strongly toPFx0.

Proof. IfStn Ttnfor alln∈N∪ {0}, inTheorem 3.4then3.26reduced to3.36. So, we obtain the result immediately.

We also deduce the following corollary.

Corollary 3.6see8, Theorem 2.2. LetCbe a closed convex subset of a real Hilbert spaceH. Let {Tt : t ≥ 0}be a nonexpansive semigroups on Cwith a nonempty common fixed point set

F, that is, F : ∞t0FTt/. Let {αn} ⊂ 0, a ⊂ 0,1and {tn} be the sequences such that

lim infn→ ∞tn0,lim supn→ ∞tn >0andlimn→ ∞tn1−tn 0. Suppose that{xn}is a sequence iteratively generated by the following iterative scheme:

x0∈H taken arbitrary,

zn αnxn 1−αnTtnxn,

CnuC:ynuxnu,

Qn{uC:xnx0, uxn ≥0},

xn1PCnQnx0,

3.37

(12)

Acknowledgments

The authors would like to thank the editors and the anonymous referees for their valuable suggestions which help to improve this paper. This research was supported by the Computational Science and Engineering Research Cluster, King Mongkut’s University of Technology Thonburi KMUTT National Research Universities under CSEC Project no. E01008.

References

1 W. R. Mann, “Mean value methods in iteration,”Proceedings of the American Mathematical Society, vol. 4, pp. 506–510, 1953.

2 B. Halpern, “Fixed points of nonexpanding maps,”Bulletin of the American Mathematical Society, vol. 73, pp. 957–961, 1967.

3 F. E. Browder, “Fixed-point theorems for noncompact mappings in Hilbert space,”Proceedings of the National Academy of Sciences of the United States of America, vol. 53, pp. 1272–1276, 1965.

4 T. Suzuki, “On strong convergence to common fixed points of nonexpansive semigroups in Hilbert spaces,”Proceedings of the American Mathematical Society, vol. 131, no. 7, pp. 2133–2136, 2002.

5 H.-K. Xu, “A strong convergence theorem for contraction semigroups in Banach spaces,”Bulletin of the Australian Mathematical Society, vol. 72, no. 3, pp. 371–379, 2005.

6 R. Chen and H. He, “Viscosity approximation of common fixed points of nonexpansive semigroups in Banach space,”Applied Mathematics Letters, vol. 20, no. 7, pp. 751–757, 2007.

7 H. He and R. Chen, “Strong convergence theorems of the CQ method for nonexpansive semigroups,”

Fixed Point Theory and Applications, vol. 2007, Article ID 59735, 8 pages, 2007.

8 S. Saejung, “Strong convergence theorems for nonexpansive semigroups without Bochner integrals,”

Fixed Point Theory and Applications, vol. 2008, Article ID 745010, 7 pages, 2008.

9 W. Takahashi, Y. Takeuchi, and R. Kubota, “Strong convergence theorems by hybrid methods for families of nonexpansive mappings in Hilbert spaces,” Journal of Mathematical Analysis and Applications, vol. 341, no. 1, pp. 276–286, 2008.

10 S. Ishikawa, “Fixed points by a new iteration method,”Proceedings of the American Mathematical Society, vol. 44, pp. 147–150, 1974.

11 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.

12 T. Suzuki, “Strong convergence of Krasnoselskii and Mann’s type sequences for one-parameter non-expansive semigroups without Bochner integrals,”Journal of Mathematical Analysis and Applications, vol. 305, no. 1, pp. 227–239, 2005.

13 Y. Haugazeau,Sur les In´equations variationnelles et la minimisation de fonctionnelles convexes, Ph.D. thesis, Universit´e Paris, Paris, France, 1968.

14 K. Nakajo and W. Takahashi, “Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups,”Journal of Mathematical Analysis and Applications, vol. 279, no. 2, pp. 372– 379, 2003.

References

Related documents

A complex data signature attribute can be used in similarity queries through distinct distance functions, but each index can only be used in queries that employ the same

The effects of excessive concentration are: overaccumulation of capital in the national economy; financialisation of the national economy (the transformation into the

Synaptophysin (Syp); Post-Synaptic Density Protein 95 (PSD-95); TAR DNA Binding Protein 43 (TDP-43); Chromosome 9 open reading frame 72 (C9orf72); Smith-Magenis syndrome

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

evolution, and potential functional significance. Integr Comp Biol. Blümmel A-S, Drepper F, Knapp B, Eimer E, Warscheid B, Müller M, et al. Structural features of the TatC

Thus, this paper presents the result of an experimental investigation on predicting surface roughness (Ra) of tool steel using Taguchi’s parameter design and response

Mean intensity of mEGFP- α -tubulin signal and cell diameter was measured in cells before and after control ( blue , seven cells), hypo- ( red , eight cells) or hyper- ( green ,

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