• No results found

Ergodicity of the implicit midpoint rule for nonexpansive mappings

N/A
N/A
Protected

Academic year: 2020

Share "Ergodicity of the implicit midpoint rule for nonexpansive mappings"

Copied!
9
0
0

Loading.... (view fulltext now)

Full text

(1)

R E S E A R C H

Open Access

Ergodicity of the implicit midpoint rule for

nonexpansive mappings

Hong-Kun Xu

1,2*

, Maryam A Alghamdi

3

and Naseer Shahzad

2

*Correspondence:

[email protected]

1Department of Mathematics,

School of Science, Hangzhou Dianzi University, Hangzhou, Zhejiang 310018, China

2Department of Mathematics, King

Abdulaziz University, P.O. Box 80203, Jeddah, 21589, Saudi Arabia Full list of author information is available at the end of the article

Abstract

We prove a mean ergodic theorem for the implicit midpoint rule for nonexpansive mappings in a Hilbert space. We obtain weak convergence for the general case and strong convergence for certain special cases.

MSC: 47J25; 47N20; 34G20; 65J15

Keywords: ergodic; implicit midpoint rule; nonexpansive mapping; projection; Hilbert space

1 Introduction

The first mean ergodic theorem for nonlinear noncompact operators was proved by Bail-lon []. LetCbe a closed convex subset of a Hilbert space H and letT :CC be a nonexpansive mapping (i.e.,Tx–Ty ≤ xyfor allx,yC) with fixed points. Then, for eachxC, the Cesàro means

Sn(x) :=

n

n–

k=

Tkx, n≥,

converge weakly to a fixed point ofT. This mean ergodic theorem was extended by Bruck [] to the setting of Banach spaces that are uniformly convex and have a Fréchet differen-tiable norm. Baillon and Clement [] also investigated ergodicity of the nonlinear Volterra integral equations in Hilbert spaces.

It is quite natural to consider ergodic convergence of iterative algorithms in the case where the sequences generated by the algorithms either are not guaranteed to converge or not convergent at all. For instance, the double-backward method of Passty [] generates a sequence{xn}in the recursive manner:

xn+=

Jλn+ BJ

λn+ A

xn, n≥, (.)

whereAandBare maximal monotone operators in a Hilbert space such thatA+Bis also maximal monotone and the inclusion ∈(A+B)xis solvable, and

AandJ

λ

Bare the

resol-vents ofAandB, respectively, that is,Jλ

A= (I+λA)–andJBλ= (I+λB)–. It is well known []

that the sequence{xn}generated by the double-backward method (.) fails to converge

weakly, in general. However, Passty [] showed that if the sequence of parameters,{λn}, is

(2)

in\, then the averages

zn:=

n i=λixi

n i=λi

, n= , , . . . , (.)

converge weakly to a solution to the inclusion ∈(A+B)x.

The implicit midpoint rule (IMR) for nonexpansive mappings in a Hilbert spaceH, in-spired by the IMR for ordinary differential equations [–], was introduced in []. This rule generates a sequence{xn}via the semi-implicit procedure:

xn+= ( –tn)xn+tnT

xn+xn+

, n≥, (.)

where the initial guessx∈Cis arbitrarily chosen,tn∈(, ) for alln, andT:CCis a

nonexpansive mapping with fixed points.

The IMR (.) is proved to converge weakly [] in the Hilbert space setting provided the sequence{tn}satisfies the two conditions:

(C) tn+≤atnfor alln≥and somea> , and

(C) lim infn→∞tn> .

However, this algorithm may fail to converge weakly without the assumption (C). We therefore turn our attention to the ergodic convergence of the algorithm. We will show that for any sequence{tn}in the interval (, ), the mean averages{zn}as defined by (.) will

always converge weakly to a fixed point ofTas long as{xn}is an approximate fixed point

ofT(i.e.,xnTxn →). We will also show that under certain additional conditions the

means{zn}can converge in norm to a fixed point ofT. This paper is organized as follows.

In the next section we introduce the concept of nearest point projections and properties of nonexpansive mappings. The main results of this paper (i.e., weak and strong ergodicity of the IMR (.)) are presented in Section .

2 Preliminaries

LetCbe a nonempty closed convex subset of a Hilbert spaceH. Recall that the nearest point projection fromHtoC,PC, is defined by

PCx:=arg min yCxy

, xH. (.)

We need the following characterization of projections.

Lemma . Let C be a nonempty closed convex subset of a Hilbert space H.Given xH and zC,then z=PCx if and only if any one of the following properties is satisfied:

(i) xzxyfor allyC; (ii) x–z,yz ≤for allyC;

(iii) xzxyzyfor allyC.

Recall that a mappingT:CCis said to be nonexpansive if

(3)

A pointxCsuch thatTx=xis said to be a fixed point ofT. The set of all fixed points of T is denoted byFix(T), namely,

Fix(T) ={x∈C:Tx=x}.

In the rest of this paper we always assumeFix(T)=∅.

We need the demiclosedness principle of nonexpansive mappings as described below.

Lemma .[] Let C be a closed convex subset of a Hilbert space H and let T:CC be a nonexpansive mapping.Then the mapping IT is demiclosed in the sense that,for any sequence{xn}of C,the following implication holds:

xnx weakly and(I–T)xn→in norm ⇒ (I–T)x= .

Next we need the following lemma (not hard to prove).

Lemma .[] For each integer n≥,λ≥, . . . ,λn≥such thatλ+· · ·+λn= ,points

u, . . . ,unC,and any nonexpansive mapping T:CC,we have

T

n

j=

λjuj

n

j=

λjTuj

i<j

λiλj

uiuj–TuiTuj

. (.)

Recall also that the implicit midpoint rule (IMR) [] generates a sequence{xn}by the

recursion process

xn+= ( –tn)xn+tnT

xn+xn+

, n≥, (.)

wheretn∈(, ) for alln, andT:CCis a nonexpansive mapping.

The following properties of the IMR (.) are proved in [].

Lemma . Let{tn}be any sequence in(, )and let{xn}be the sequence generated by the

IMR(.).Then

(i) xn+–pxnpfor alln≥andp∈Fix(T).In particular,{xn}is bounded,

and moreover,we have

lim

n→∞xnpexists for everyp∈Fix(T). (.)

(ii) ∞n=tnxnxn+<∞.

(iii) ∞n=tn( –tn)xnT(xn+xn+)<∞.

The convergence of the IMR (.) is proved in [].

(4)

where the sequence{tn}of parameters satisfies the conditions(C)and(C)in the

Intro-duction.Then{xn}converges weakly to a fixed point of T.

3 Ergodicity

In this section we discuss the ergodic convergence of the sequence{xn}generated by the

IMR (.), that is, the convergence of the means

zn:=

sn

n

k=

akxk, n= , , . . . , (.)

where{an}is a sequence of positive numbers such that

sn:= n

k=

ak→ ∞ (asn→ ∞). (.)

SetF=Fix(T) and letPFbe the nearest point projection fromHtoF.

Lemma . The sequence{PFxn}is convergent in norm.

Proof First observe that

lim

n→∞xnPFxnexists. (.)

As a matter of fact, we get forn>m, by Lemma .(i) and Lemma .(i),

xnPFxn ≤ xnPFxm ≤ xmPFxm.

That is,{xnPFxn}is decreasing and (.) is proven.

Applying the inequality (Lemma .(iii))

PFvu≤ v–u–PFvv, vH,uF (.)

to the case wherev=xnandu=PFxm(withn>m) together with Lemma .(i), we get

PFxnPFxm≤ xnPFxm–PFxnxn

≤ xmPFxm–PFxnxn.

The strong convergence of{PFxn}follows immediately from the fact (.).

Remark . The limit of{PFxn}, which we denote by p, can also be identified as theˆ

asymptotic center of the sequence{xn}with respect to the fixed point setFofT. In other

words,

ˆ

p=arg min

xF f(p) :=lim supn→∞ xnp

(5)

As a matter of fact, by (.) we get, for anypF,

PFxnxn≤ xnp–PFxnp.

Upon taking limsup we immediately obtain

fp)f(p) –p–pˆ , pF.

Hence, (.) holds.

Theorem . Let C be a closed convex subset of a Hilbert space H and let T:CC be a nonexpansive mapping such that F≡Fix(T)=∅.Assume{tn}is any sequence of positive

numbers in the unit interval(, )and let{xn}be the sequence generated by the IMR(.).

Define the means{zn}by(.),where the weights{an}are all positive and satisfy the

con-dition(.).Assume,in addition,limn→∞xnTxn= .Then{zn}converges weakly to a

point z,where z=limn→∞PFxn(in norm).

Proof Letz=limn→∞PFxnwhich is well defined by Lemma .. By Lemma .(ii), we have,

for eachk,

xkPFxk,uPFxk ≤, uF.

It turns out that, foruF,

xkPFxk,uz ≤–xkPFxk,zPFxkMzPFxk.

(HereMis a constant such thatM≥ xkPFxkfor allk.)

By multiplying byakand then summing up fromk=  ton, we conclude

zn

sn

n

k=

akPFxk,uz

M

sn n

k=

akzPFxk. (.)

We now claim that

lim

n→∞znTzn= . (.)

Consequently, by Lemma ., each weak cluster point of{zn}falls inF.

To see (.), we will prove that

Tznzn<δ(ε) (.)

for allnbig enough, whereδ(ε)→ asε→. For the sake of simplicity, we may, due to the assumptionlimn→∞xnTxn= , assume that

xnTxn<ε (.)

(6)

Leth(t) =tfort≥ and letMbe a constant such thatM≥·diam(xn). For eachn,

we putλ(jn)=aj

sn for ≤jnand apply (.) to get

T(zn) –

n

j=

λ(jn)Txj

h

M

i<j

λ(in)λ(jn)xixj–TxiTxj

h

M

i<j

λ(in)λ(jn)xiTxi+xjTxj

h

εM

i<j

λ(in)λ(jn)

h(εM). (.)

Combining (.) and (.), we derive that

T(zn) –zn

T(zn) –

n

j=

λ(jn)Txj

+ n j=

λ(jn)(Txjxj)

h(εM) +

n

j=

λ(jn)Txjxj

h(εM) +ε. (.)

It turns out that (.) withδ(ε) =√εM+ε.

Now sincePFxnzin norm, we see that the means sn

n

k=akPFxkzin norm, as

well. Consequently, if{znj}is a subsequence weakly converging to some pointz∗, it follows from (.) that

z∗–z,uz≤, uF. (.)

This together with the fact thatz∗∈Fimplies thatz=PFz∗=z∗. That is,zis the only weak

cluster point of the sequence{zn}and therefore, we must haveznzweakly.

Remark . In Theorem . we assumed thatlimn→∞xnTxn= . This assumption

is guaranteed if the sequence{tn}satisfies the condition (C) in the Introduction, that is,

lim infn→∞tn> . Indeed, by (C) and Lemma .(ii), we find

lim

n→∞xn+–xn= . (.)

Since the definition of IMR (.) yields

xn+–xn=tn

xnT

xn+xn+

,

we also have

lim

n→∞

xnT

xn+xn+

(7)

Combining (.) and (.), we infer that

xnTxn

xnT

xn+xn+

+TxnT

xn+xn+

xnT

xn+xn+

+

xnxn+ →.

Remark . If we assume (.) holds for all n>N, then we need some more delicate technicalities dealing with (.). We may proceed as follows. Decomposezn(forn>N)

as

zn=

sN

sn

zN+

sNn sn

zNn,

where

sNn =

n

j=N+

aj, zNn = n

j=N+

λ(jn,N)xj, λ(jn,N)=

aj

sN n

, n>N.

Assn→ ∞, we may assumessNnzN<ε. Repeating the argument for (.) and (.), we

get

TzNnzNnh(εM) +ε.

LetM=supn≥xn. We finally obtain, forn>N,

T(zn) –znT(zn) –T

zNn+TzNnzNn+znNzn

TzNnznN+ zNnzn

=TzN n

zN n+ 

sN

sn

zNzNn

h(εM) +ε+ Mε.

Next we show that in some circumstances, the sequence{zn}can converge strongly.

Theorem . Let the assumptions of Theorem.holds.Then the sequence{zn}converges

in norm to the point z=limn→∞PFxnif,in addition,any one of the following conditions is

satisfied:

(i) The fixed point setFofT has nonempty interior. (ii) Tis a contraction,that is,

TxTyρxy, x,yC,

whereρ∈[, )is a constant.In this case,the sequence{xn}generated by the IMR

(.)converges in norm to the unique fixed point ofT.

(iii) Tis compact,namely,Tmaps bounded sets to relatively norm-compact sets.

Proof (i) By assumption, we havex∈Fandδ>  such that

(8)

Therefore, upon substitutingx+δwforuin (.) we obtain

δ

zn

sn

n

k=

akPFxk,w

≤–

zn

sn

n

k=

akPFxk,x–z

+M sn n k=

akz–PFxk, (.)

for allwHsuch thatw ≤.

Taking the supremum in (.) overwHsuch thatw ≤ immediately yields

δ

zn

sn

n

k=

akPFxk

≤–

zn

sn

n

k=

akPFxk,x–z

+M sn n k=

akz–PFxk →.

This verifies thatznzin norm.

(ii) SinceT is a contraction,T has a unique fixed point which is denoted byp. By (.) we deduce that (noticingxn+–p ≤ xnp)

xn+–p ≤( –tn)xnp+tnρ

(xn+xn+) –p

≤( –tn)xnp+

 ρtn

xnp+xn+–p

≤ – ( –ρ)tn

xnp.

It turns out that

( –ρ)tnxnpxnpxn+–p

and hence

n=

tnxnp<∞.

Since∞n=tn=∞, we must havelim infn→∞xnp= . However, since the sequence

{xnp}is decreasing, we must havelimn→∞xnp= . Namely,xnpin norm, and

soznpin norm.

(iii) SinceT is compact and since{zn}is weakly convergent,{Tzn}is relatively

norm-compact. This together with (.) evidently implies that{zn}is relatively norm-compact.

Therefore,{zn}must converge in norm toz=limn→∞PFxn.

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

(9)

Author details

1Department of Mathematics, School of Science, Hangzhou Dianzi University, Hangzhou, Zhejiang 310018, China. 2Department of Mathematics, King Abdulaziz University, P.O. Box 80203, Jeddah, 21589, Saudi Arabia.3Department of

Mathematics, Sciences Faculty for Girls, King Abdulaziz University, P.O. Box 4087, Jeddah, 21491, Saudi Arabia.

Acknowledgements

The authors are grateful to the anonymous referees for their helpful comments and suggestions, which improved the presentation of this manuscript. This project was funded by the Deanship of Scientific Research (DSR), King Abdulaziz University, under grant No. (49-130-35-HiCi). The authors, therefore, acknowledge technical and financial support of KAU.

Received: 24 October 2014 Accepted: 8 December 2014 Published:06 Jan 2015

References

1. Baillon, J-B: Un théorème de type ergodique pour les contractions non linéaires dans un espace de Hilbert. C. R. Acad. Sci. Paris Sér. A-B280(22), Aii, A1511-A1514 (1975) (in French)

2. Bruck, RE: A simple proof of the mean ergodic theorem for nonlinear contractions in Banach spaces. Isr. J. Math. 32(2-3), 107-116 (1979)

3. Baillon, J-B, Clement, P: Ergodic theorems for nonlinear Volterra equations in Hilbert space. Nonlinear Anal.5(7), 789-801 (1981)

4. Passty, GB: Ergodic convergence to a zero of the sum of monotone operators in Hilbert spaces. J. Math. Anal. Appl. 72, 383-390 (1979)

5. Lions, PL, Mercier, B: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal.16, 964-979 (1979)

6. Auzinger, W, Frank, R: Asymptotic error expansions for stiff equations: an analysis for the implicit midpoint and trapezoidal rules in the strongly stiff case. Numer. Math.56, 469-499 (1989)

7. Bader, G, Deuflhard, P: A semi-implicit mid-point rule for stiff systems of ordinary differential equations. Numer. Math. 41, 373-398 (1983)

8. Deuflhard, P: Recent progress in extrapolation methods for ordinary differential equations. SIAM Rev.27(4), 505-535 (1985)

9. Edith, E: Numerical and approximative methods in some mathematical models. Ph.D. thesis, Babes-Bolyai University of Cluj-Napoca (2006)

10. Schneider, C: Analysis of the linearly implicit mid-point rule for differential-algebra equations. Electron. Trans. Numer. Anal.1, 1-10 (1993)

11. Somalia, S: Implicit midpoint rule to the nonlinear degenerate boundary value problems. Int. J. Comput. Math.79(3), 327-332 (2002)

12. Somalia, S, Davulcua, S: Implicit midpoint rule and extrapolation to singularly perturbed boundary value problems. Int. J. Comput. Math.75(1), 117-127 (2000)

13. Alghamdi, MA, Alghamdi, MA, Shahzad, N, Xu, HK: The implicit midpoint rule for nonexpansive mappings. Fixed Point Theory Appl.2014, 96 (2014)

14. Goebel, K, Kirk, WA: Topics in Metric Fixed Point Theory. Cambridge Studies in Advanced Mathematics, vol. 28. Cambridge University Press, Cambridge (1990)

15. Zarantonello, EH: Projections on convex sets in Hilbert space and spectral theory. In: Zarantonello, EH (ed.) Contributions to Nonlinear Functional Analysis, pp. 237-424. Academic Press, New York (1971)

10.1186/1029-242X-2015-4

References

Related documents

- Groups of four students. - The teacher works intensely with them a bibliographic piece of information. - Afterwards, each student returns to his/her group and teaches

Teachers’ reflective practices through action research and professional development efforts are arguably one of the areas that reflect a single loop model of learning

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

Guattari’s concept of asignifying semiotics is an attempt to explore how abstract, decoded, and non-representational elements such as signals play a crucial role in the

We have identified mutations in the H-Ras proto-oncogene as a significant feature of Wnt1- induced tumorigenesis (Table 1), and we have shown that an inherited Neu transgene or