• No results found

Some results on a viscosity splitting algorithm in Hilbert spaces

N/A
N/A
Protected

Academic year: 2020

Share "Some results on a viscosity splitting algorithm in Hilbert spaces"

Copied!
15
0
0

Loading.... (view fulltext now)

Full text

(1)

R E S E A R C H

Open Access

Some results on a viscosity splitting

algorithm in Hilbert spaces

Yunpeng Zhang

* *Correspondence:

[email protected] College of Electric Power, North China University of Water Resources and Electric Power, Zhengzhou, 450011, China

Abstract

In this paper, a viscosity splitting for common solution problems is proposed. Strong convergence theorems are obtained in the framework of Hilbert spaces. Applications are also provided to support the main results.

Keywords: zero point; fixed point; variational inclusion; nonexpansive mapping

1 Introduction; preliminaries

In this paper, we always assume thatHis a real Hilbert space with the inner productx,y and the induced normx=√x,xforx,yH. Recall that a set-valued mappingM:HHis said to bemonotoneiff, for allx,yH,fMx, andgMyimplyx–y,fg ≥. In this paper, we use M–() to denote the zero point set ofM. A monotone mapping M:HHismaximaliff the graphGraph(M) ofMis not properly contained in the graph of any other monotone mapping. It is well known that a monotone mappingMis maximal if and only if, for any (x,f)∈H×H,x–y,fg ≥, for all (y,g)∈Graph(M) implies fMx. For a maximal monotone operatorMonH, andr> , we may define the single-valued resolventJr:H→Dom(M), whereDom(M) denotes the domain ofM. It is well

known thatJris firmly nonexpansive, andM–() =F(Jr).

The proximal point algorithm, which was proposed by Martinet [, ] and generalized by Rockafellar [, ] is one of the classical methods for solving zero points of maximal monotone operators. In this paper, we investigate the problem of finding a zero of the sum of two monotone operators. The problem is very general in the sense that it includes, as special cases, convexly constrained linear inverse problems, split feasibility problem, convexly constrained minimization problems, fixed point problems, variational inequal-ities, Nash equilibrium problem in noncooperative games and others. Because of their importance, splitting methods, which were proposed by Lions and Mercier [] and Passty [], for zero problems have been studied extensively recently; see, for instance, [–] and the references therein.

LetCbe a nonempty closed and convex subset ofH. LetA:CHbe a mapping. Recall that the classical variational inequality problem is to find a pointxCsuch that

yx,Ax ≥, ∀yC. (.)

Such a pointxCis called a solution of variational inequality (.). In this paper, we use VI(C,A) to denote the solution set of variational inequality (.). Recall thatAis said to be

(2)

monotoneiff

Ax–Ay,xy ≥, ∀x,yC.

Recall thatAis said to beinverse-strongly monotoneiff there exists a constantκ>  such that

AxAy,xyκAxAy, ∀x,yC.

For such a case, we also callAisκ-inverse-strongly monotone. It is also not hard to see that every inverse-strongly monotone mapping is monotone and continuous.

LetS:CCbe a mapping. In this paper, we useF(S) to denote the fixed point set ofS. Sis said to becontractiveiff there exists a constantβ∈(, ) such that

Sx–Sy ≤βx–y, ∀x,yC.

We also callSisβ-contractive.Sis said to benonexpansiveiff

Sx–Sy ≤ xy, ∀x,yC.

It is well known ifCis nonempty closed convex ofH, thenF(S) is not empty.Sis said to befirmly nonexpansiveiff

Sx–Sy≤ x–y–(I–S)x– (I–S)y, ∀x,yC.

In order to prove our main results, we also need the following lemmas.

Lemma .[] Let A be a maximal monotone operator on H.Forλ> ,μ> ,and xE, we have Jλx=(μλx+ ( –μλ)Jλx),where Jλ= (I+λA)–and Jμ= (I+μA)–.

Lemma .[] Let{xn}and{yn}be bounded sequences in H.Let{βn}be a sequence in

(, )with <lim infn→∞βn≤lim supn→∞βn< .Suppose that xn+= ( –βn)yn+βnxn,

n≥and

lim sup

n→∞

yn+–yn–xn+–xn

≤.

Thenlimn→∞ynxn= .

Lemma . [] Let {an} be a sequence of nonnegative numbers satisfying the

condi-tion an+≤( –tn)an+tnbn,∀n≥,where{tn}is a number sequence in(, )such that

limn→∞tn= and

n=tn=∞,{bn}is a number sequence such thatlim supn→∞bn≤.

Thenlimn→∞an= .

Lemma .[] Let C be a nonempty closed convex subset of H. Let A:CH be a

mapping and let B:HH be a maximal monotone operator.Thenx– (I+sB)–x ≤

(3)

Lemma .[] Let{λn}be a real sequence that does not decreasing at infinity,in the sense

that there exists a subsequence{λnk}such thatλnkλnk+for all k≥.For every n>n,

define an integer sequence d(n)as d(n) =max{n≤kn|λnkλnk+}.Thenlimn→∞d(n) =

and for all n>nmax{λd(n),λn} ≤λd(n)+.

Lemma . [] Let C be a nonempty closed convex subset of H.Let S:CC be a

nonexpansive mapping with a nonempty fixed point set.If{xn}converges weakly to x and

{xnTxn}converges to zero.Then xF(S).

2 Main results

Now, we are in a position to state our main results.

Theorem . Let C be a nonempty closed convex subset of H.Let S:CC be a

non-expansive mapping with fixed points and let f :CC be aβ-contractive mapping.Let A:CH be anα-inverse-strongly monotone mapping and let B be a maximal monotone operator on H.Assume thatDom(B)⊂C and F(S)∩(A+B)–()is not empty.Let{α

n}and

{βn}be real number sequences in(, )and let{rn}be a positive real number sequence in

(, α).Let{xn}be a sequence generated in the following process:x∈C and

⎧ ⎨ ⎩

yn=αnf(xn) + ( –αn)xn,

xn+=βnxn+ ( –βn)S(I+rnB)–(ynrnAyn), ∀n≥.

Assume that the control sequences satisfy the following restrictions: (a) limn→∞αn= ,

n=αn=∞;

(b)  <lim infn→∞βn≤lim supn→∞βn< ;

(c)  <arnb< αand

n=|rnrn–|<∞,

where a and b are two real numbers.Then{xn}converges strongly to a pointx¯∈F(S)∩(A+

B)–(),which is also a unique solution to the following variational inequality:

fx) –x,¯ px¯≤, ∀pF(S)∩(A+B)–().

Proof Note that the mappingIrnAis nonexpansive. Indeed, we have

(I–rnA)x– (I–rnA)y

=x–y– rnx–y,AxAy+rnAx–Ay

≤ x–y–rn(αrn)Ax–Ay.

In light of restriction (c), one finds thatIrnAis nonexpansive. It is obvious thatF((I+

rnB)–(I–rnA)) = (A+B)–(). Fixp∈(A+B)–()∩F(S). It follows that

ynp ≤αnf(xn) –p+ ( –αn)xnp

≤ –αn( –β)

(4)

PuttingJrn= (I+rnB)–, we see that

xn+–p ≤βnxnp+ ( –βn)SJrn(ynrnAyn) –p

βnxnp+ ( –βn)(ynrnAyn) –p

≤ –αn( –βn)( –β)

xnp+αn( –βn)( –β)

f(p) –p  –β .

By mathematical induction, we find that the sequence{xn}is bounded. Note that

ynyn– ≤αnf(xn) –f(xn–)+ ( –αn)xnxn–

+|αnαn–|f(xn–) –xn–

≤ –αn( –β)

xnxn–+|αnαn–|f(xn–) –xn–.

Puttingzn=ynrnAyn, we find from Lemma . that

JrnznJrn–zn– ≤

rn–

rn

(znzn–) +

 –rn– rn

(Jrnznzn–)

≤ znzn–+|

rnrn–|

a Jrnznzn

≤ ynyn–+|rnrn–|Ayn–+|

rnrn–|

a Jrnznzn ≤ –αn( –β)

xnxn–+|αnαn–|f(xn–) –xn–

+|rnrn–|Ayn–+|

rnrn–|

a Jrnznzn.

This yields

SJrnznSJrn–zn– ≤ JrnznJrn–zn–

≤ xnxn–+|αnαn–|f(xn–) –xn–

+|rnrn–|Ayn–+|

rnrn–|

a Jrnznzn.

It follows from restrictions (a) and (c) that

lim sup

n→∞

SJrnznSJrn–zn––xnxn–

≤.

Using Lemma ., we havelimn→∞SJrnznxn= . It follows that

lim

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

Sinceynxn=αnf(xn) –xn, we find that

lim

(5)

Since · is convex, we find that

ynp≤αnf(xn) –p+ ( –αn)xnp. (.)

It follows that

xn+–p≤βnxnp+ ( –βn)SJrnznp

βnxnp+ ( –βn)Jrn(I–rnA)ynp

βnxnp+ ( –βn)(I–rnA)ynp

βnxnp+ ( –βn)ynp–rn( –βn)(αrn)AynAp

≤ xnp+αnf(xn) –p–rn( –βn)(αrn)AynAp.

Hence, we have

rn( –βn)(αrn)AynAp

≤xnp+xn+–p

xn+–xn+αnf(xn) –p.

In view of restrictions (a), (b), and (c), we find from (.) that

lim

n→∞AynAp= . (.)

SinceJrnis firmly nonexpansive, we have

Jrnznp≤ Jrnznp, (ynrnAyn) – (p–rnAp)

= 

Jrnznp+(ynrnAyn) – (p–rnAp)

–(Jrnznp) –

(ynrnAyn) – (p–rnAp)

≤ 

Jrnznp+ynp–Jrnznyn

+ rnAynApJrnznyn

.

This implies from (.) that

Jrnznp≤ ynp–Jrnznyn+ rnAynApJrnznyn

αnf(xn) –p+ ( –αn)xnp–Jrnznyn

+ rnAynApJrnznyn.

On the other hand, we have

xn+–p≤βnxnp+ ( –βn)SJrnznp

(6)

≤ xnp+αnf(xn) –p

– ( –βn)Jrnznyn

+ rnAynApJrnznyn.

This implies that

( –βn)Jrnznyn≤

xnp+xn+–p

xnxn++αnf(xn) –p

+ rnAynApJrnznyn.

In view of restrictions (a) and (b), we find from (.) and (.) that

lim

n→∞Jrnznyn= . (.)

Next, we show thatlim supn→∞f(¯x) –x,¯ ynx ≤¯ , wherex¯=ProjF(S)∩(A+B)–()fx). To show it, we can choose a subsequence{yni}of{yn}such that

lim sup

n→∞

fx) –x,¯ ynx¯

=lim

i→∞fx) –x,¯ ynix¯

.

Since{yni}is bounded, we can choose a subsequence{ynij}of{yni}which converges weakly

some pointx. We may assume, without loss of generality, thatyniconverges weakly tox.

Now, we are in a position to show thatx∈(A+B)–(). Setλ

n=Jrn(ynrnAyn). It follows

that ynλn

rnAynBλn. SinceBis monotone, we get, for any (μ,ν)∈B,

λnμ,

ynλn

rn

Aynν

≥.

Replacingnbyniand lettingi→ ∞, we obtain from (.) that

x–μ, –Ax–ν ≥.

This gives –Ax∈Bx, that is, ∈(A+B)(x). This proves thatx∈(A+B)–().

Now, we are in a position to prove thatxF(S). Notice that

Sλnyn

  –βn

xn+–yn+ βn

 –βn

ynxn.

This implies that limn→∞Sλnyn= . This implies from (.) thatSλnλn →.

SinceISis demiclosed at zero, we find thatxF(S). This complete the proof thatxF(S)∩(A+B)–(). It follows that

lim sup

n→∞

fx) –x,¯ ynx¯

≤.

Finally, we show thatxn→ ¯x. Notice that

ynx¯≤αnf(xn) –x,¯ ynx¯

+ ( –αn)xnx¯ynx¯

≤ –αn( –β)

xnx¯ynx¯+αnf(x) –¯ x,¯ ynx¯

(7)

This implies that

ynx¯ ≤αnfx) –x,¯ ynx¯

+ –αn( –β)

xnx¯ .

It follows that

xn+–x¯ ≤βnxnx¯ + ( –βn)SJrn(I–rnA)ynx¯

βnxnx¯ + ( –βn)ynx¯ 

≤ –αn( –βn)( –β)

xnx¯ + αn( –βn)fx) –x,¯ ynx¯

.

In view of restrictions (a) and (b), we find from Lemma . thatxn→ ¯x. This completes

the proof.

From Theorem ., we have the following results immediately.

Corollary . Let C be a nonempty closed convex subset of H.Let S:CC be a non-expansive mapping with fixed points and let f :CC be aβ-contractive mapping.Let {αn}and{βn}be real number sequences in(, ).Let{xn}be a sequence generated in the

following process:x∈C and

⎧ ⎨ ⎩

yn=αnf(xn) + ( –αn)xn,

xn+=βnxn+ ( –βn)Syn, ∀n≥.

Assume that the control sequences satisfy the following restrictions: (a) limn→∞αn= ,

n=αn=∞;

(b)  <lim infn→∞βn≤lim supn→∞βn< .

Then {xn}converges strongly to a pointx¯ ∈F(S),which is also a unique solution to the

following variational inequality:

fx) –x,¯ px¯≤, ∀pF(S).

Corollary . Let C be a nonempty closed convex subset of H.Let f :CC be a β

-contractive mapping.Let A:CH be anα-inverse-strongly monotone mapping and let B be a maximal monotone operator on H.Assume thatDom(B)⊂C and(A+B)–()is

not empty.Let{αn}and{βn}be real number sequences in(, )and{rn}be a positive real

number sequence in(, α).Let{xn}be a sequence generated in the following process:x∈C

and

⎧ ⎨ ⎩

yn=αnf(xn) + ( –αn)xn,

xn+=βnxn+ ( –βn)(I+rnB)–(ynrnAyn), ∀n≥.

Assume that the control sequences satisfy the following restrictions: (a) limn→∞αn= ,

n=αn=∞;

(8)

(c)  <arnb< αand

n=|rnrn–|<∞,

where a and b are two real numbers.Then{xn}converges strongly to a pointx¯∈(A+B)–(),

which is also a unique solution to the following variational inequality:

fx) –x,¯ px¯≤, ∀p∈(A+B)–().

Next, we give a result on the zeros of the sum of the operators AandBbased on a different method.

Theorem . Let C be a nonempty closed convex subset of H.Let f :CC be aβ

-contractive mapping.Let A:CH be anα-inverse-strongly monotone mapping and let B be a maximal monotone operator on H.Assume thatDom(B)⊂C and(A+B)–()is

not empty.Let{αn}and{βn}be real number sequences in(, )and{rn}be a positive real

number sequence in(, α).Let{xn}be a sequence generated in the following process:x∈C

and

⎧ ⎨ ⎩

yn=αnf(xn) + ( –αn)xn,

xn+=βnxn+ ( –βn)(I+rnB)–(ynrnAyn), ∀n≥.

Assume that the control sequences satisfy the following restrictions: (a) limn→∞αn= ,

n=αn=∞;

(b) ≤βn≤ ¯β< ;

(c)  <arnb< α,

whereβ¯,a,and b are real numbers.Then{xn}converges strongly to a pointx¯∈(A+B)–(),

which is also a unique solution to the following variational inequality:

f(x) –¯ x,¯ px¯≤, ∀p∈(A+B)–().

Proof From the proof of Theorem ., we find that{xn}is bounded. SincePF(S)∩(A+B)–()f is contractive, it has a unique fixed point. Next, we usex¯to denote the unique fixed point. Note that

ynx¯ =αnf(xn) –x,¯ ynx¯

+ ( –αn)xnx,¯ ynx¯

≤ –αn( –β)

xnxy¯ nx¯ +αnfx) –x,¯ ynx¯

≤( –αn( –β)

xnx¯ +ynx¯ 

+αnfx) –x,¯ ynx¯

.

It follows that

ynx¯≤

 – αn( –β)  +αn( –β)

xnx¯+

αn

 +αn( –β)

f(x) –¯ x,¯ ynx¯

. (.)

SinceJrnis firmly nonexpansive andAis inverse-strongly monotone, we find that

Jrn(ynrnAyn) –x¯ 

≤(ynrnAyn) – (¯xrnA¯x)

(9)

≤ ynx¯ –rn(αrn)AynA¯x

–(I–Jrn)(ynrnAyn) – (I–Jrn)(¯xrnA¯x)

. (.)

Substituting (.) into (.), we find that

Jrn(ynrnAyn) –x¯

 – αn( –β)  +αn( –β)

xnx¯ +

αn

 +αn( –β)

fx) –x,¯ ynx¯

rn(αrn)AynA¯x–(I–Jrn)(ynrnAyn) – (I–Jrn)(¯xrnA¯x).

It follows that

xn+–x¯ ≤βnxnx¯ + ( –βn)Jrn(ynrnAyn) –x¯ 

 –αn( –βn)( –β)  +αn( –β)

xnx¯ +

αn( –βn)

 +αn( –β)

fx) –x,¯ ynx¯

– ( –βn)rn(αrn)AynA¯x

– ( –βn)(I–Jrn)(ynrnAyn) – (I–Jrn)(¯xrnA¯x). (.)

Next, we consider the following possible two cases.

Case . Suppose that there exists some nonnegative integermsuch that the sequence {xnx¯}is eventually decreasing. Thenlimn→∞xnx¯exists. By (.), we find that

( –βn)rn(αrn)AynA¯x

≤ xnx¯ –xn+–x¯ + αnfx) –x¯ynx.¯

By use of restrictions (b) and (c), we havelimn→∞AynA¯x= . It also follows from (.)

that

( –βn)(I–Jrn)(ynrnAyn) – (I–Jrn)(x¯–rnAx)¯ 

xnx¯–xn+–x¯+ αnf(x) –¯ x¯ynx¯.

From restrictions (b) and (c), we obtain

lim

n→∞(I–Jrn)(ynrnAyn) – (I–Jrn)(¯xrnA¯x)= .

Hence, we havelimn→∞ynJrn(ynrnAyn)= . From Lemma ., we find thatyn

Jr(ynrAyn) ≤ynJrn(ynrnAyn). This implies thatlimn→∞ynJr(ynrAyn)= .

Next, we show thatlim supn→∞f(x) –¯ x,¯ ynx¯ ≤. To show it, we can choose a

subse-quence{yni}of{yn}such that

lim sup

n→∞

fx) –x,¯ ynx¯

=lim

i→∞fx) –x,¯ ynix¯

.

Since{yni}is bounded, we can choose a subsequence{ynij}of{yni}which converges weakly

(10)

Since the mappingJr(I–rA) is nonexpansive, we find thatxF(Jr(I–rA)) = (A+B)–().

It follows thatlim supn→∞fx) –x,¯ ynx¯ ≤. In view of (.), we find from Lemma .

thatxn→ ¯x.

Next, we consider another case.

Case . Suppose that the sequence{xnx}¯ is not eventually decreasing. There exists a

subsequence{xnix¯}such thatxnix¯ ≤ xni+–x¯for alli≥. We define an integer

sequencek(n) as in Lemma .. By use of (.), we have

xk(n)+–x¯

 –αk(n)( –βk(n))( –β)  +αk(n)( –β)

xk(n)–x¯

+αk(n)( –βk(n))  +αk(n)( –β)

fx) –x,¯ yk(n)–x¯

– ( –βk(n))rk(n)(αrk(n))Ayk(n)–A¯x

– ( –βk(n))(I–Jrk(n))(yk(n)–rk(n)Ayk(n)) – (I–Jrk(n))(x¯–rk(n)Ax)¯

. (.)

It follows that

lim

n→∞yk(n)–Jrk(n)(yk(n)–rk(n)Ayk(n))= . (.)

Hence, we havelim supn→∞f(¯x) –x,¯ yk(n)–x ≤¯ . In view of (.), we find that

lim

n→∞xk(n)–x¯= .

Note that

yk(n)+–x ≤ y¯ k(n)+–xk(n)++xk(n)+–xk(n)+xk(n)–x¯

αk(n)+f(xk(n)+) –xk(n)+

+ ( –βk(n))Jrk(n)(yk(n)–rk(n)Ayk(n)) –xk(n)+xk(n)–x¯

αk(n)+f(xk(n)+) –xk(n)++Jrk(n)(yk(n)–rk(n)Ayk(n)) –yk(n)

+αk(n)f(xk(n)) –xk(n)+xk(n)–x.¯

By use of (.), we find thatlimn→∞ynx¯= . Sincexnx¯ ≤αnf(xn) –xn+ynx¯,

we find thatlimn→∞xnx¯= . This completes the proof.

Remark . Comparing Theorem . with the recent results announced in [, ] and

[], we have the following:

(i) Our proofs are different from theirs.

(ii) We remove the additional restriction∞n=|rn+–rn|<∞.

3 Applications

(11)

LetFbe a bifunction ofC×CintoR, whereRdenotes the set of real numbers. Recall the following equilibrium problem:

FindxCsuch thatF(x,y)≥, ∀y∈C. (.)

In this paper, we useEP(F) to denote the solution set of the equilibrium problem. To study equilibrium problems (.), we may assume thatFsatisfies the following con-ditions:

(A) F(x,x) = for allxC;

(A) Fis monotone,i.e.,F(x,y) +F(y,x)≤for allx,yC; (A) for eachx,y,zC,

lim sup

t↓ F

tz+ ( –t)x,yF(x,y);

(A) for eachxC,yF(x,y)is convex and weakly lower semi-continuous.

Lemma .[] Let C be a nonempty closed convex subset of a real Hilbert space H.Let F be a bifunction from C×C toRwhich satisfies(A)-(A)and let B be a multivalued mapping of H into itself defined by

Bx=

⎧ ⎨ ⎩

{z∈H:F(x,y)≥ y–x,z,∀y∈C}, xC,

∅, x∈/C. (.)

Then B is a maximal monotone operator with the domain D(BF)⊂C,EP(F) =B–(),and

Trx= (I+rB)–x,∀x∈H,r> ,where Tris defined as

Trx=

zC:F(z,y) +

ry–z,zx ≥,∀y∈C

.

Theorem . Let C be a nonempty closed convex subset of H.Let S:CC be a

non-expansive mapping with fixed points and let f :CC be aβ-contractive mapping.Let A:CH be anα-inverse-strongly monotone mapping and let F be a bifunction from C×C toRwhich satisfies(A)-(A).Assume that F(S)∩EP(F)is not empty.Let{αn}and

{βn}be real number sequences in(, )and let{rn}be a positive real number sequence in

(, α).Let{xn}be a sequence generated in the following process:x∈C and

⎧ ⎨ ⎩

yn=αnf(xn) + ( –αn)xn,

xn+=βnxn+ ( –βn)S(I+rnB)–(ynrnAyn), ∀n≥,

where B is a mapping defined as in(.).Assume that the control sequences satisfy the following restrictions:

(a) limn→∞αn= ,

n=αn=∞;

(b)  <lim infn→∞βn≤lim supn→∞βn< ;

(c)  <arnb< αand

(12)

where a and b are two real numbers.Then{xn}converges strongly to a pointx¯∈F(S)

EP(F),which is a unique solution to the following variational inequality:

fx) –x,¯ px¯≤, ∀p∈F(S)EP(F).

Theorem . Let C be a nonempty closed convex subset of H.Let f :CC be aβ

-contractive mapping.Let A:CH be anα-inverse-strongly monotone mapping and Let F be a bifunction from C×C toRwhich satisfies(A)-(A).Assume that EP(F)is not empty. Let{αn}and{βn}be real number sequences in(, )and let{rn}be a positive real number

sequence in(, α).Let{xn}be a sequence generated in the following process:x∈C and

⎨ ⎩

yn=αnf(xn) + ( –αn)xn,

xn+=βnxn+ ( –βn)(I+rnB)–(ynrnAyn), ∀n≥.

Assume that the control sequences satisfy the following restrictions: (a) limn→∞αn= ,

n=αn=∞;

(b) ≤βn≤ ¯β< ;

(c)  <arnb< α,

whereβ¯,a,and b are real numbers.Then{xn}converges strongly to a pointx¯∈(A+B)–(),

which is also a unique solution to the following variational inequality:

fx) –x,¯ px¯≤, ∀p∈(A+B)–().

Letg:H→(–∞, +∞] be a proper convex lower semi-continuous function. Then the subdifferential∂gofgis defined as follows:

∂g(x) =yH:g(z)g(x) +zx,y,zH, ∀xH.

From Rockafellar [], we know that∂gis maximal monotone. It is easy to verify that ∈

∂g(x) if and only ifg(x) =minyHg(y). LetICbe the indicator function ofC,i.e.,

IC(x) = ⎧ ⎨ ⎩

, xC,

+∞, x∈/C. (.)

SinceICis a proper lower semi-continuous convex function onH, we see that the

subdif-ferential∂ICofICis a maximal monotone operator.

Lemma .[] Let C be a nonempty closed convex subset of H and letProjCbe the metric projection from H onto C.Let∂ICbe the subdifferential of IC,where ICis as defined in(.).

Then y= (I+λ∂IC)–x⇐⇒y=ProjCx,xH,yC,

Theorem . Let C be a nonempty closed convex subset of H.Let S:CC be a

(13)

real number sequence in(, α).Let{xn}be a sequence generated in the following process:

x∈C and ⎧ ⎨ ⎩

yn=αnf(xn) + ( –αn)xn,

xn+=βnxn+ ( –βn)SProjC(ynrnAyn), ∀n≥.

Assume that the control sequences satisfy the following restrictions: () limn→∞αn= ,

n=αn=∞;

()  <lim infn→∞βn≤lim supn→∞βn< ;

()  <arnb< αand

n=|rnrn–|<∞,

where a and b are two real numbers.Then{xn}converges strongly to a pointx¯∈F(S)

VI(C,A),which is a unique solution to the following variational inequality:

fx) –x,¯ px¯≤, ∀p∈F(S)VI(C,A).

Proof PuttingBx=∂IC, we find from Theorem . and Lemma . the desired conclusion

immediately.

Theorem . Let C be a nonempty closed convex subset of H. Let f :CC be aβ

-contractive mapping and let A:CH be anα-inverse-strongly monotone mapping. As-sume that FVI(C,A)is not empty.Let{αn}and{βn}be real number sequences in(, )and

let{rn}be a positive real number sequence in(, α).Let{xn}be a sequence generated in

the following process:x∈C and

⎨ ⎩

yn=αnf(xn) + ( –αn)xn,

xn+=βnxn+ ( –βn)ProjC(ynrnAyn), ∀n≥.

Assume that the control sequences satisfy the following restrictions: (a) limn→∞αn= ,

n=αn=∞;

(b) ≤βn≤ ¯β< ;

(c)  <arnb< α,

whereβ¯,a,and b are real numbers.Then{xn}converges strongly to a pointx¯∈(A+B)–(),

which is also a unique solution to the following variational inequality:

fx) –x,¯ px¯≤, ∀p∈(A+B)–().

Proof PuttingB=∂IC, we find from Theorem . and Lemma . the desired conclusion

immediately.

LetW :H→Rbe a convex and differentiable function andM:H→Ris a convex function. Consider the convex minimization problemminxH(W(x) +M(x)). From [],

we know if∇WisL-Lipschitz continuous, then it isL-inverse-strongly monotone. Hence, we have the following results.

(14)

such that(∇W+∂M)–()is not empty.Let f be aβ-contractive mapping on H.Let{α n}

and{βn}be real number sequences in(, )and let{rn}be a positive real number sequence

in(, α).Let{xn}be a sequence generated in the following process:x∈C and

⎨ ⎩

yn=αnf(xn) + ( –αn)xn,

xn+=βnxn+ ( –βn)(I+rnM)–(ynrn∇Wyn), ∀n≥.

Assume that the control sequences satisfy the following restrictions: (a) limn→∞αn= ,

n=αn=∞;

(b) ≤βn≤ ¯β< ;

(c)  <arnb< α,

whereβ¯,a,and b are real numbers.Then{xn}converges strongly to a pointx¯∈(∇W+ ∂M)–,which is also a unique solution to the following variational inequality:

f(x) –¯ x,¯ px¯≤, ∀p∈(∇W+∂M)–.

Proof PuttingA=∇W andB=∂M, we find from Theorem . the desired conclusion

immediately.

4 Conclusions

In this paper, we study a convex feasibility problem via two monotone mappings and a nonexpansive mapping. The common solution is also a unique solution of another vari-ational inequality. The restrictions imposed on the sequence{rn}are mild. The results

presented in this paper mainly improve the corresponding results in [] and [].

Competing interests

The author declares that they have no competing interests.

Acknowledgements

The author is very grateful to the editor and anonymous reviewers’ suggestions which improved the contents of the article.

Received: 25 August 2014 Accepted: 5 December 2014 Published:06 Jan 2015

References

1. Martinet, B: Regularisation d’inéquations variationelles par approximations successives. Rev. Fr. Inform. Rech. Oper.4, 154-158 (1970)

2. Martinet, B: Determination approchée d’un point fixe d’une application pseudo-contractante. C. R. Acad. Sci. Paris Sér. A-B274, 163-165 (1972)

3. Rockafellar, RT: Monotone operators and the proximal point algorithm. SIAM J. Control Optim.14, 877-898 (1976) 4. Rockafellar, RT: Augmented Lagrangians and applications of the proximal point algorithm in convex programming.

Math. Oper. Res.1, 97-116 (1976)

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

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

7. Cho, SY, Qin, X, Wang, L: Strong convergence of a splitting algorithm for treating monotone operators. Fixed Point Theory Appl.2014, Article ID 94 (2014)

8. Zegeye, H, Shahzad, N: Strong convergence theorem for a common point of solution of variational inequality and fixed point problem. Adv. Fixed Point Theory2, 374-397 (2012)

9. Cho, SY, Kang, SM: On iterative solutions of a common element problem. J. Nonlinear Funct. Anal.2014, Article ID 3 (2014)

10. Zhang, M: An algorithm for treating asymptotically strict pseudocontractions and monotone operators. Fixed Point Theory Appl.2014, Article ID 52 (2014)

(15)

12. Hecai, Y: On weak convergence of an iterative algorithm for common solutions of inclusion problems and fixed point problems in Hilbert spaces. Fixed Point Theory Appl.2013, Article ID 155 (2013)

13. Zhao, J, Zhang, Y, Yang, Q: Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem. Appl. Math. Comput.219, 1644-1653 (2012)

14. Qin, X, Cho, SY, Wang, L: Convergence of splitting algorithms for the sum of two accretive operators with applications. Fixed Point Theory Appl.2014, Article ID 166 (2014)

15. Yu, L, Liang, M: Convergence of iterative sequences for fixed point and variational inclusion problems. Fixed Point Theory Appl.2011, Article ID 368137 (2011)

16. Yang, S: Zero theorems of accretive operators in reflexive Banach spaces. J. Nonlinear Funct. Anal.2013, Article ID 2 (2013)

17. Qin, X, Su, Y: Approximation of a zero point of accretive operator in Banach spaces. J. Math. Anal. Appl.329, 415-424 (2007)

18. Barbu, V: Nonlinear Semigroups and Differential Equations in Banach Space. Noordhoff, Groningen (1976) 19. Suzuki, T: Strong convergence of Krasnoselskii and Mann’s type sequences for one-parameter nonexpansive

semigroups without Bochner integrals. J. Math. Anal. Appl.305, 227-239 (2005)

20. Liu, LS: Ishikawa and Mann iterative process with errors for nonlinear strongly accretive mappings in Banach spaces. J. Math. Anal. Appl.194, 114-125 (1995)

21. Lopez, G, Marquez, VM, Wang, F, Xu, HK: Forward-backward splitting methods for accretive operators in Banach spaces. Abstr. Appl. Anal.2012, Article ID 109236 (2012)

22. Mainge, PE: Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization. Set-Valued Anal.16, 899-912 (2008)

23. Browder, FE: Nonexpansive nonlinear operators in a Banach space. Proc. Natl. Acad. Sci. USA54, 1041-1044 (1965) 24. Takahashi, S, Takahashi, W, Toyoda, M: Strong convergence theorems for maximal monotone operators with

nonlinear mappings in Hilbert spaces. J. Optim. Theory Appl.147, 27-41 (2010)

25. Baillon, JB, Haddad, G: Quelques propriétés des opérateurs angle-bornés et cycliquement monotones. Isr. J. Math.26, 137-150 (1977)

10.1186/1029-242X-2015-2

Cite this article as:Zhang:Some results on a viscosity splitting algorithm in Hilbert spaces.Journal of Inequalities and

References

Related documents