• No results found

Hybrid shrinking iterative solutions to convex feasibility problems for countable families of relatively nonexpansive mappings and a system of generalized mixed equilibrium problems

N/A
N/A
Protected

Academic year: 2020

Share "Hybrid shrinking iterative solutions to convex feasibility problems for countable families of relatively nonexpansive mappings and a system of generalized mixed equilibrium problems"

Copied!
12
0
0

Loading.... (view fulltext now)

Full text

(1)

R E S E A R C H

Open Access

Hybrid shrinking iterative solutions to convex

feasibility problems for countable families of

relatively nonexpansive mappings and a

system of generalized mixed equilibrium

problems

Wei-Qi Deng

1*

and Shanguang Qian

2

*Correspondence:

[email protected]

1School of Statistics and

Mathematics, Yunnan University of Finance and Economics, Kunming, Yunnan 650221, P.R. China Full list of author information is available at the end of the article

Abstract

We propose a new hybrid shrinking iterative scheme for approximating common elements of the set of solutions to convex feasibility problems for countable families of relatively nonexpansive mappings of a set of solutions to a system of generalized mixed equilibrium problems. A strong convergence theorem is established in the framework of Banach spaces. The results extend those of other authors, in which the involved mappings consist of just finitely many ones.

MSC: 47H09; 47H10; 47J25

Keywords: relatively nonexpansive mappings; hybrid iteration scheme; convex feasibility problems; generalized mixed equilibrium problems

1 Introduction

Throughout this paper we assume thatEis a real Banach space with its dualE∗,Cis a nonempty, closed, convex subset ofE, andJ:E→Eis thenormalized duality mapping defined by

Jx=fE∗:x,f=x=f, ∀xE. (.)

In the sequel, we useF(T) to denote the set of fixed points of a mappingT. A pointpinC

is said to be an asymptotic fixed point ofT ifCcontains a sequence{xn}which converges weakly topsuch that thelimn→∞(xnTxn) = . The set of asymptotic fixed points ofT will be denoted byFˆ(T). A mappingT:CCis said to be nonexpansive if

TxTyxy, ∀x,yC. (.)

A mappingT:CCis said to be relatively nonexpansive ifF(T) =Fˆ(T)=∅and

φ(p,Tx)≤φ(p,x), ∀xC,pF(T), (.)

(2)

whereφ:E×E→Rdenotes theLyapunov functionaldefined by

φ(x,y) =x– x,Jy+y, ∀x,yE. (.)

It is obvious from the definition ofφthat

xy≤φ(x,y)≤x+y, (.)

φ(x,y) =φ(x,z) +φ(z,y) + xz,JzJy, (.)

and

φ(x,y) =x,JxJy+yx,JyxJxJy+yxy. (.)

The asymptotic behavior of a relatively nonexpansive mapping was studied in [–]. In , Mann [] introduced the iteration as follows: a sequence{xn}is defined by

xn+=αnxn+ ( –αn)Txn, (.)

where the initial elementx∈Cis arbitrary and{αn}is a sequence of real numbers in [, ]. The Mann iteration has been extensively investigated for nonexpansive mappings. One of the fundamental convergence results was proved by Reich []. In an infinite-dimensional Hilbert space, a Mann iteration can yield only weak convergence (see [, ]). Attempts to modify the Mann iteration method (.) so that strong convergence is guaranteed have recently been made. Nakajo and Takahashi [] proposed the following modification of Mann iteration method (.) for a nonexpansive mappingTfromCinto itself in a Hilbert space: from an arbitraryx∈C,

⎧ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎩

yn=αnxn+ ( –αn)Txn,

Cn={zC:ynzxnz},

Qn={zC:xnz,x–xn ≥},

xn+=PCnQnx, ∀n∈N∪ {},

(.)

wherePKdenotes the metric projection from a Hilbert spaceHonto a closed convex sub-setKofHand proved that the sequence{xn}converges strongly toPF(T)x. A projection onto the intersection of two half-spaces is computed by solving a linear system of two equations with two unknowns (see [, Section ]).

Letθ:C×C→Rbe a bifunction,ψ:C→Ra real-valued function, andB:CE

a nonlinear mapping. The so-calledgeneralized mixed equilibrium problem(GMEP) is to find anuCsuch that

θ(u,y) +yu,Bu+ψ(y) –ψ(u)≥, ∀yC, (.)

whose set of solutions is denoted by(θ,B,ψ).

(3)

that variational inequalities and mathematical programming problems can be viewed as a special realization of the abstract equilibrium problems. Many authors have proposed some useful methods to solve the EP (equilibrium problem), GEP (generalized equilibrium problem), MEP (mixed equilibrium problem), and GMEP.

In , Plubtieng and Ungchittrakool [] established strong convergence theorems for a common fixed point of two relatively nonexpansive mappings in a Banach space by using the following hybrid method in mathematical programming:

⎧ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩

x=xC,

yn=J–[αnJxn+ ( –αn)Jzn],

zn=J–[βn()Jxn+βn()JTxn+βn()JSxn],

Hn={zC:φ(z,yn)φ(z,xn)},

Wn={zC:xnz,JxJy ≥},

xn+=PHnWnx, ∀n∈N∪ {}.

(.)

Their results extended and improved the corresponding ones announced by Nakajo and Takahashi [], Martinez-Yanes and Xu [], and Matsushita and Takahashi [].

Recently, Su and Qin [] modified iteration (.), the so-called monotoneCQmethod for nonexpansive mapping, as follows: from an arbitraryx∈C,

⎧ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩

yn=αnxn+ ( –αn)Txn,

C={zC:y–zx–z}, Q=C,

Cn={zCn–∩Qn–:ynzxnz},

Qn={zCn–∩Qn–:xnz,x–xn ≥},

xn+=PCnQnx, ∀n∈N∪ {},

(.)

and proved that the sequence{xn}converges strongly toPF(T)x.

Inspired and motivated by the studies mentioned above, in this paper, we use a modi-fied hybrid iteration scheme for approximating common elements of the set of solutions to convex feasibility problem for a countable families of relatively nonexpansive mappings, of set of solutions to a system of generalized mixed equilibrium problems. A strong con-vergence theorem is established in the framework of Banach spaces. The results extend those of the authors, in which the involved mappings consist of just finitely many ones.

2 Preliminaries

We say thatEisstrictly convexif the following implication holds forx,yE:

x=y= , x=yx+y

< . (.)

It is also said to beuniformly convexif for any> , there existsδ>  such that

x=y= , xyx+y

≤ –δ. (.)

It is well known that ifEis a uniformly convex Banach space, thenEis reflexive and strictly convex. A Banach spaceEis said to besmoothif

lim

t→

x+tyx

(4)

exists for eachx,yS(E) :={xE:x= }.Eis said to beuniformly smoothif the limit (.) is attained uniformly forx,yS(E).

Following Alber [], thegeneralized projection PC:ECis defined by

PC=arg inf

y(y,x), ∀xE. (.)

Lemma .[] Let E be a smooth,strictly convex and reflexive Banach space and C be a nonempty,closed,convex subset of E.Then the following conclusions hold:

() φ(x,PCy) +φ(PCy,y)≤φ(x,y)for allxCandyE.

() IfxEandzC,thenz=PCxzy,JxJz ≥,∀yC.

() Forx,yE,φ(x,y) = if and only ifx=y.

Lemma .[] Let E be a uniformly convex and smooth Banach space and let r> .Then there exists a continuous,strictly increasing,and convex function h: [, r]→[,∞)such that h() = and

hxyφ(x,y) (.)

for all x,yBr:={zE:zr}.

Lemma .[] Let E be a uniformly convex and smooth Banach space and let{xn}and {yn}be two sequences of E.Ifφ(xn,yn)→,whereφ is the function defined by(.),and

either{xn}or{yn}is bounded,thenxnyn →.

Remark . The following basic properties for a Banach spaceE can be found in Cio-ranescu [].

(i) IfEis uniformly smooth, thenJis uniformly continuous on each bounded subset ofE.

(ii) IfEis reflexive and strictly convex, thenJ–is norm-weak-continuous.

(iii) IfEis a smooth, strictly convex and reflexive Banach space, then the normalized duality mappingJ:E→E∗is single valued, one-to-one, and onto.

(iv) A Banach spaceEis uniformly smooth if and only ifE∗is uniformly convex. (v) Each uniformly convex Banach spaceEhas theKadec-Klee property,i.e., for any

sequence{xn} ⊂E, ifxnxEandxnx, thenxnxasn→ ∞.

Lemma .[] Let E be a real uniformly convex Banach space and let Br()be the closed

ball of E with center at the origin and radius r> .Then there exists a continuous strictly increasing convex function g: [,∞)→[,∞)with g() = such that

λx+μy+γz≤λx+μy+γz–λμgxy (.)

for all x,y,zBr()andλ,μ,γ ∈[, ]withλ+μ+γ = .

Lemma .[] The unique solutions to the positive integer equation

n=in+

(mn– )mn

(5)

are

in=n

(mn– )mn

 , mn= –

 –

n+ 

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

where[x]denotes the maximal integer that is not larger than x.

3 Main results

Theorem . Let E be a real uniformly smooth and strictly convex Banach space,and C be a nonempty,closed,convex subset of E.Let{Ti}:CC and{Si}:CC be two

sequences of relatively nonexpansive mappings with F:=∞i=(F(Ti)F(Si))=∅.Let{xn}

be the sequence generated by

⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩

x=xC, H–=W–=C,

yn=J–[λnJxn+ ( –λn)Jzn],

zn=J–[αnJxn+βnJTinxn+γnJSinxn], Hn={zHn–∩Wn–:φ(z,yn)φ(z,xn)},

Wn={zHn–∩Wn–:xnz,JxJy ≥},

xn+=PHnWnx, ∀n∈N∪ {},

(.)

where{λn},{αn},{βn},and{γn}are sequences in[, ]satisfying

() ≤λn< ,∀n∈N∪ {};lim supn→∞λn< ;

() αn+βn+γn= ;limn→∞αn= andlim infn→∞βnγn> ;

and inis the solution to the positive integer equation n=in+(mn–) mn (mnin,n= , , . . .),

that is,for each n≥,there exists a unique insuch that

i= , i= , i= , i= , i= , i= ,

i= , i= , i= , i= , i= , . . . .

Then{xn}converges strongly to PFx,where PFx is the generalized projection from C onto F.

Proof We divide the proof into several steps.

(I)HnandWn(∀n∈N∪ {}) both are closed and convex subsets inC. This follows from the fact thatφ(z,yn)φ(z,xn) is equivalent to

z,JxnJynxn–yn. (.)

(II)Fis a subset of∞n=(HnWn).

In fact, we note by [, Proposition .] that for eachi≥,F(Si) andF(Ti) are closed convex sets and so isF. It is clear thatFC=H–∩W–. Suppose thatFCn–∩Qn– for somen∈N. For anyuF, by the convexity of · , we have

φ(u,zn) =φu,J–[αnJxn+βnJTinxn+γnJSinxn]

=u– u,αnJxn+βnJTinxn+γnJSinxn

+αnJxn+βnJTinxn+γnJSinxn

(6)

+αnxn+βnTinxn

+γ

nSinxn

=αnφ(u,xn) +βnφ(u,Tinxn) +γnφ(u,Sinxn)

αnφ(u,xn) +βnφ(u,xn) +γnφ(u,xn)

=φ(u,xn), (.)

and then

φ(u,yn) =φu,J–λnJxn+ ( –λn)Jzn

=u– u,λnJxn+ ( –λn)Jzn

+λnJxn+ ( –λn)Jzn ≤ u– λnu,Jxn– ( –λn)u,Jzn+λnxn+ ( –λn)zn

=λn

u– u,Jxn+xn

+ ( –λn)u– u,Jzn+zn

=λnφ(u,xn) + ( –λn)φ(u,zn)

λnφ(u,xn) + ( –λn)φ(u,xn)

=φ(u,xn). (.)

This implies thatFHn. It follows fromxn=PHn–∩Wn–xand Lemma .() that

xnz,JxJxn ≥, ∀zHn–∩Wn–. (.)

Particularly,

xnz,JxJxn ≥, ∀uF, (.)

and henceFWn, which yieldsFHnWn. By induction,F

n=(HnWn). (III)limn→∞xnTinxn=limn→∞xnSinxn= .

In view ofxn+=PHnWnxHnand the definition ofHn, we also have

φ(xn+,yn)φ(xn+,xn),n∈N. (.)

This implies that

lim

n→∞φ(xn+,yn) =nlim→∞φ(xn+,xn) = . (.)

It follows from Lemma . that

lim

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

SinceJis uniformly norm-to-norm continuous on bounded sets, we have

lim

n→∞Jxn+–Jyn=nlim→∞Jxn+–Jxn=  (.)

and

(7)

This implies that

Jxn+–Jzn ≤   –λn

Jxn+–Jyn+λnJxn+–Jxn

≤ 

 –λn

Jxn+–Jyn+Jxn+–Jxn

. (.)

From (.) andlim supn→∞λn< , we havelimn→∞Jxn+–Jzn= . SinceJ–is also uni-formly norm-to-norm continuous on bounded sets, we obtain

lim

n→∞xn+–zn=nlim→∞J

–(Jx

n+) –J–(Jzn)= . (.)

From xnznxnxn++xn+–zn we havelimn→∞xnzn= . Since {xn} is bounded, φ(p,Tinxn)φ(p,xn) andφ(p,Sinxn)φ(p,xn) for anypF. We also find

that {Jxn}, {JTinxn} and{JSinxn} are bounded, and then there exists an r>  such that {Jxn},{JTinxn},{JSinxn} ⊂Br(). Therefore Lemma . is applicable and we observe that

φ(p,zn) =p– p,αnJxn+βnJTinxn+γnJSinxn

+αnJxn+βnJTinxn+γnJSinxn

p– αnp,Jxn– βnp,JTinxn– γnp,JSinxn

+αnxn+βnTinxn+γnSinxn–βnγng

JTinxnJSinxn

=αnφ(p,xn) +βnφ(p,Tinxn) +γnφ(p,Sinxn) –βnγng

JTinxnJSinxn

φ(p,xn) –βnγng

JTinxnJSinxn

. (.)

That is,

βnγng

JTinxnJSinxn

φ(p,xn) –φ(p,zn), (.)

whereg: [,∞)→[,∞) is a continuous strictly convex function withg() = .

Let{TinkxnkSinkxnk}be any subsequence of{TinxnSinxn}. Since{xnk}is bounded,

there exists a subsequence{xnj}of{xnk}such that for anypF,

lim

j→∞φ(p,xnj) =lim supk→∞ φ(p,xnk) :=a. (.) From (.) we have

φ(p,xnj) =φ(p,znj) +φ(znj,xnj) + pznj,JznjJxnj

φ(p,znj) +φ(znj,xnj) +MJznjJxnj (.)

for some appropriate constantM> . Since

lim

j→∞φ(znj,xnj) =  = lim

(8)

it follows that

a=lim inf

j→∞ φ(p,xnj)≤lim infj→∞ φ(p,znj). (.) From (.), we have

lim sup

j→∞

φ(p,znj)≤lim sup

j→∞

φ(p,xnj) =a (.)

and hencelimj→∞φ(p,xnj) =a=limj→∞φ(p,znj). By (.), we observe that, asj→ ∞, βnjγnjg

JTinjxnjJSinjxnj

φ(p,xnj) –φ(p,znj)→. (.)

Sincelim infn→∞βnγn> , it follows thatlimj→∞g(JTinjxnjJSinjxnj) = . By the

proper-ties of the mappingg, we havelimj→∞JTinjxnjJSinjxnj= . SinceJ–is also uniformly

norm-to-norm continuous on bounded sets, we obtain

lim

j→∞TinjxnjSinjxnj=jlim→∞

J–(JTinjxnj) –J

–(JS

injxnj)= , (.)

and thenlimn→∞TinxnSinxn= . Next, we note by the convexity of·and (.) that,

asn→ ∞,

φ(Tinxn,zn) =Tinxn– Tinxn,αnJxn+βnJTinxn+γnJSinxn

+αnJxn+βnJTinxn+γnJSinxn

Tinxn– αnTinxn,Jxn– βnTinxn,JTinxn– γnTinxn,JSinxn

+αnxn+βnTinxn+γnSinxn

=αnφ(Tinxn,xn) +βnφ(Tinxn,Sinxn)→, (.)

sinceαn→. By Lemma ., we havelimn→∞Tinxnzn=  and hence

TinxnxnTinxnzn+znxn → (.)

asn→ ∞. Moreover, we observe that

SinxnxnSinxnTinxn+Tinxnxn → (.)

asn→ ∞.

(IV)xnPFxasn→ ∞.

It follows from the definition of Wnand Lemma .() that xn=PWnx. Since xn+= PHnWnxWn, we have

φ(xn,x)≤φ(xn+,x), ∀n≥. (.)

Therefore,{φ(xn,x)}is nondecreasing. Usingxn=PWnxand Lemma .(), we have

(9)

for allpFand for alln∈N, that is,{φ(xn,x)}is bounded. Then

lim

n→∞φ(xn,x) exists. (.)

In particular, by (.), the sequence{(xnx)}is bounded. This implies that{xn}is bounded. Note again thatxn=PWnxand for any positive integerk,xn+kWn+k–⊂Wn. By Lemma .(),

φ(xn+k,xn) =φ(xn+k,PWnx)

φ(xn+k,x) –φ(PWnx,x)

=φ(xn+k,x) –φ(xn,x). (.)

By Lemma ., we have, form,n∈Nwithm>n,

hxmxn

φ(xm,xn)≤φ(xm,x) –φ(xn,x), (.)

whereh: [,∞)→[,∞) is a continuous, strictly increasing, and convex function with

h() = . Then the properties of the function g show that{xn}is a Cauchy sequence inC, so there existsx∗∈Csuch that

xnx∗ (n→ ∞). (.)

Now, setNi={k∈N:k=i+(m–) m,mi,m∈N} for eachi∈N. Note thatTik =Ti

and Sik =Si whenever k∈Ni. By Lemma . and the definition of Ni, we have N =

{, , , , , , . . .}andi=i=i=i=i=i=· · ·= . Then it follows from (.) and (.) that

lim

Nik→∞

Tixkxk= lim Nik→∞

Sixkxk= , ∀i∈N. (.)

It then immediately follows from (.) and (.) thatx∗∈F(Ti)∩F(Si) for eachi∈N and hencex∗∈F.

Putu=PFx. SinceuFHnWnandxn+=PHnWnx, we haveφ(xn+,x)≤φ(u,x),

n∈N. Then

φx∗,x= lim

n→∞φ(xn+,x)≤φ(u,x), (.)

which implies thatx∗=usinceu=PFx, and hencexnx∗=PFxasn→ ∞. This

com-pletes the proof.

Remark . Note that the algorithm (.) is based on the projection onto an intersection of two closed and convex sets. We first give an example [] of how to compute such a projection onto the intersection of two half-spaces.

LetHbe a Hilbert space and suppose that (x,y,z)∈Hsatisfies

(10)

Set

π=xy,yz, μ=xy, ν=yz, ρ=μνπ, (.)

and

Q(x,y,z) =

⎧ ⎪ ⎨ ⎪ ⎩

z, ifρ=  andπ≥;

x+ ( +π/ν)(zy), ifρ>  andπ νρ;

y+ (ν/ρ)(π(xy) +μ(zy)), ifρ>  andπ ν<ρ.

(.)

In [], Haugazeau introduced the operatorQas an explicit description of the projector onto the intersection of the two half-spaces defined in (.). He proved in [] that the sequence{yn}defined byy=xand

(∀n∈N) yn+=Q

x,Q(x,yn,PByn),PAQ(x,yn,PByn)

(.)

converges strongly toPCx.

Since the algorithm (.) involves the projection onto the intersection of two convex sets not necessarily half-spaces, we next give an example [] to explain and illustrate how the projection is calculated in the general convex case.

Dykstra’s algorithm Let,, . . . ,pbe closed and convex subsets ofRn. For anyi= , , . . . ,pandxRn, the sequences{xk

i}are defined by the following recursive formulas:

⎧ ⎪ ⎨ ⎪ ⎩ xk

=xkp–,

xk i =Pi(x

k

i––yki–), i= , , . . . ,p,

yki =xki – (xki–yki–), i= , , . . . ,p,

(.)

fork= , , . . . with initial valuesxp=xandyi =  fori= , , . . . ,p. If:=pi=i=∅, then{xki}converges tox∗=P(x), whereP(x) :=arg infyyx,∀x∈Rn.

Note Another iterative method termed HAAR (Haugazeau-like Averaged Alternating Re-flections) for finding the projection onto intersection of finitely many closed convex sets in a Hilbert space can be found in [, Remark .(iii)].

4 Applications

The so-called convex feasibility problem for a family of mappings{Ti}∞i=is to find a point in the nonempty intersection∞i=F(Ti).

Note Although the problem mentioned above is indeed a convex feasibility problem, it is mainly referred to the finite case.

LetEbe a smooth, strictly convex, and reflexive Banach space, andCbe a nonempty, closed, convex subset ofE. Let{Bi}∞i=:CE∗be a sequence ofβi-inverse strongly mono-tone mappings,{ψ}∞i=:C→R a sequence of lower semi-continuous and convex func-tions, and{θi}∞i=:C×C→Ra sequence of bifunctions satisfying the conditions:

(11)

(A) θis monotone,i.e.,θ(x,y) +θ(y,x)≤;

(A) lim supt↓θ(x+t(zx),y)≤θ(x,y);

(A) the mappingyθ(x,y)is convex and lower semicontinuous.

A system of generalized mixed equilibrium problems (GMEP) for {θi}∞i=, {Bi}∞i= and

{ψi}∞i=is to find anx∗∈Csuch that

θi

x∗,y+yx∗,Bix

+ψi(y) –ψi

x∗≥, ∀yC,i∈N, (.)

whose set of common solutions is denoted by:=∞i=i, whereidenotes the set of solutions to generalized mixed equilibrium problem forθi,Bi, andψi.

Define a countable family of mappings{Sr,i}i∞=:ECwithr>  as follows:

Sr,i(x) =

zC:τi(z,y) +

ryz,JzJx ≥,∀yC

, ∀i∈N, (.)

whereτi(x,y) =θi(x,y) +yx,Bix+ψi(y) –ψi(x),∀x,yC,i∈N. It has been shown by Zhang [] that

() {Sr,i}∞i=is a sequence of single-valued mappings;

() {Sr,i}∞i=is a sequence of closed relatively nonexpansive mappings;

() ∞i=F(Sr,i) =.

Theorem . Let E be a smooth,strictly convex,and reflexive Banach space,and C be a nonempty,closed,convex subset of E.Let{Ti}∞i=:CC be a sequence of relatively

non-expansive mappings and{Sr,i}∞i=:CC be a sequence of mappings defined by(.)with

F:=∞i=(F(Ti)F(Sr,i))=∅.Let{xn}be the sequence generated by

⎧ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩

x=xC, H–=W–=C,

yn=J–[λnJxn+ ( –λn)Jzn],

zn=J–[αnJxn+βnJTinxn+γnJSr,inxn], Hn={zHn–∩Wn–:φ(z,yn)φ(z,xn)},

Wn={zHn–∩Wn–:xnz,JxJy ≥},

xn+=PHnWnx, ∀n∈N∪ {},

(.)

where{λn},{αn},{βn}and{γn}are sequences in[, ]satisfying

() ≤λn< ,∀n∈N∪ {};lim supn→∞λn< ;

() αn+βn+γn= ;limn→∞αn= andlim infn→∞βnγn> ;

and insatisfies the equation n=in+(mn–) mn (mnin,n= , , . . .).Then{xn}converges

strongly to PFx,which is some common solution to the convex feasibility problem for{Ti}∞i=

and a system of generalized mixed equilibrium problems for{Sr,i}∞i=.

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

All authors contributed equally to the writing of this paper. All authors read and approved the final manuscript.

Author details

(12)

Acknowledgements

The authors are very grateful to the referees for their useful suggestions, by which the contents of this article has been improved. This study is supported by the National Natural Science Foundation of China (Grant No. 11061037).

Received: 22 February 2014 Accepted: 13 June 2014 Published: 22 July 2014 References

1. Butnariu, D, Reich, S, Zaslavski, AJ: Asymptotic behavior of relatively nonexpansive operators in Banach spaces. J. Appl. Anal.7, 151-174 (2001)

2. Butnariu, D, Reich, S, Zaslavski, AJ: Weak convergence of orbits of nonlinear operators in reflexive Banach spaces. Numer. Funct. Anal. Optim.24, 489-508 (2003)

3. Censor, Y, Reich, S: Iterations of paracontractions and firmly nonexpansive operators with applications to feasibility and optimization. Optimization37, 323-339 (1996)

4. Matsushita, S, Takahashi, W: A strong convergence theorem for relatively nonexpansive mappings in a Banach space. J. Approx. Theory134, 257-266 (2005)

5. Mann, WR: Mean value methods in iteration. Proc. Am. Math. Soc.4(3), 506-510 (1953)

6. Reich, S: Weak convergence theorems for nonexpansive mappings in Banach spaces. J. Math. Anal. Appl.67(2), 274-276 (1979)

7. Bauschke, HH, Matoušková, E, Reich, S: Projection and proximal point methods: convergence results and counterexamples. Nonlinear Anal., Theory Methods Appl.56(5), 715-738 (2004)

8. Genel, A, Lindenstrauss, J: An example concerning fixed points. Isr. J. Math.22(1), 81-86 (1975)

9. Nakajo, K, Takahashi, W: Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups. J. Math. Anal. Appl.279(2), 372-379 (2003)

10. Solodov, MV, Svaiter, BF: Forcing strong convergence of proximal point iterations in a Hilbert space. Math. Program., Ser. A87(1), 189-202 (2000)

11. Plubtieng, S, Ungchittrakool, K: Strong convergence theorems for a common fixed point of two relatively nonexpansive mappings in a Banach space. J. Approx. Theory149, 103-115 (2007)

12. Martinez-Yanes, C, Xu, HK: Strong convergence of the CQ method for fixed point iteration processes. Nonlinear Anal.

64, 2400-2411 (2006)

13. Su, Y, Qin, X: Monotone CQ iteration processes for nonexpansive semigroups and maximal monotone operators. Nonlinear Anal., Theory Methods Appl.68(12), 3657-3664 (2008). doi:10.1016/j.na.2007.04.008

14. Alber, YI: Metric and generalized projection operators in Banach spaces: properties and applications. In: Kartosator, AG (ed.) Theory and Applications of Nonlinear Operators of Accretive and Monotone Type, pp. 15-50. Dekker, New York (1996)

15. Kohsaka, F, Takahashi, W: Block iterative methods for a finite family of relatively nonexpansive mappings in Banach spaces. Fixed Point Theory Appl.2007, Article ID 21972 (2007)

16. Kamimura, S, Takahashi, W: Strong convergence of a proximal-type algorithm in a Banach space. SIAM J. Optim.13, 938-945 (2002)

17. Cioranescu, I: Geometry of Banach Spaces, Duality Mappings and Nonlinear Problems. Kluwer Academic, Dordrecht (1990)

18. Zhou, HY, Guo, GT, Hwang, HJ, Cho, YJ: On the iterative methods for nonlinear operator equations in Banach spaces. Panam. Math. J.14, 61-68 (2004)

19. Deng, W-Q, Bai, P: An implicit iteration process for common fixed points of two infinite families of asymptotically nonexpansive mappings in Banach spaces. J. Appl. Math.2013, Article ID 602582 (2013)

20. Bauschke, HH, Combettes, PL, Luke, DR: A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space. J. Approx. Theory141, 63-69 (2006)

21. Haugazeau, Y: Sur les Inéquations Variationnelles et la Minimisation de Fonctionnelles Convexes, Thèse, Université de Paris, France (1968)

22. Boyle, JP, Dykstra, RL: A method for finding projections onto the intersections of convex sets in Hilbert spaces. In: Advances in Order Restricted Statistical Inference. Lecture Notes in Statistics vol. 37, pp. 28-47 (1986)

23. Zhang, SS: The generalized mixed equilibrium problem in Banach space. Appl. Math. Mech.30, 1105-1112 (2009). doi:10.1007/s10483-009-0904-6

doi:10.1186/1687-1812-2014-148

References

Related documents

This has rendered further subgroup analyses (e.g. age, gender, socioeco- nomic influences) less fruitful against our aim and the backdrop of updating the evidence base on ethnic

We investigated the relationship between different assem- blies of Aβ — freshly prepared, oligomeric, and fibrillar — and tau seeding using several cell-culture models,

Thus, the data obtained through comprehensive surveillance indicate that JEV is hyperen- demic in Bali, that it causes substantial human illness, and that it circulates year-round..

The secondary objectives of the study were to determine the antibody concentrations to measles, mumps, rubella and varicella at 42 days after concomitant vaccination and to evaluate

To this end, we assessed the relationships between the extent of WML (WML load), cognition, and functional connectivity using struc- tural equation modeling (SEM) and tested for

Integrated model of functional elements at the Ses locus The molecular characterization of Ses shows that it is com- posed of two linked and expressed genes, SesA and SesB ,

The present study also shows that MH84 reversed mitochondrial dysfunction and PGC-1 α levels, de- creased β -secretase processing of A β PP, and reduced levels of soluble A β 40

Conclusions: We show that α -synuclein aggregates induce microglial activation and demonstrate for the first time that galectin-3 plays a significant role in microglia