• No results found

Weak convergence theorems of a hybrid algorithm in Hilbert spaces

N/A
N/A
Protected

Academic year: 2020

Share "Weak convergence theorems of a hybrid algorithm in Hilbert spaces"

Copied!
13
0
0

Loading.... (view fulltext now)

Full text

(1)

R E S E A R C H

Open Access

Weak convergence theorems of a hybrid

algorithm in Hilbert spaces

Yan Hao

* *Correspondence:

[email protected]

School of Mathematics, Physics and Information Science, Zhejiang Ocean University, Zhoushan, 316004, China

Abstract

In this paper, a hybrid algorithm is investigated for solving common solutions of a generalized equilibrium problem, a variational inequality, and fixed point problems of an asymptotically strict pseudocontraction. Weak convergence theorems are

established in the framework of real Hilbert spaces.

Keywords: equilibrium problem; variational inequality; nonexpansive mapping; common solution

1 Introduction

Monotone variational inequalities recently have been investigated as an effective and pow-erful tool for studying a wide class of real world problems which arise in economics, finance, image reconstruction, ecology, transportation, and network; see [–] and the ref-erences therein. Monotone variational inequalities, which include many important prob-lems in nonlinear analysis and optimization, such as the Nash equilibrium problem, com-plementarity problems, fixed point problems, saddle point problems, and game theory recently have been extensively studied based on projection methods. Many well-known problems can be studied by using methods which are iterative in their nature. As an ex-ample, in computer tomography with limited data, each piece of information implies the existence of a convex set in which the required solution lies. The problem of finding a point in the intersection of these convex subsets is then of crucial interest, and it cannot be usually solved directly. Therefore, an iterative algorithm must be used to approximate such a point. Krasnoselskii-Mann iteration, which is also known as a one-step iteration, is a classic algorithm to study fixed points of nonlinear operators. However, Krasnoselskii-Mann iteration only enjoys weak convergence for nonexpansive mappings; see [] and the references therein.

The purposes of this paper is to study common solutions of a generalized equilibrium problem, a variational inequality, and fixed point problems of an asymptotically strict pseudocontraction based on a hybrid algorithm. Weak convergence theorems are estab-lished in the framework of real Hilbert spaces. The organization of this paper is as follows. In Section , we provide some necessary preliminaries. In Section , a hybrid algorithm is introduced and the convergence analysis is given. Weak convergence theorems are estab-lished in a real Hilbert space.

(2)

2 Preliminaries

From now on, we always assume thatHis a real Hilbert space with the inner product·,· and the norm · ,Cis a nonempty closed convex subset ofHandPCdenotes the metric

projection fromHontoC.

LetA:CHbe a mapping. Recall thatAis said to be monotone if

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

Ais said to be inverse-strongly monotone if there exists a constantα>  such that

Ax–Ay,xy ≥αAx–Ay, ∀x,yC.

For such a case, we also call it anα-inverse-strongly monotone mapping.

A set-valued mappingT:H→His said to be monotone if for allx,yH,f Txandg

Tyimplyx–y,fg> . A monotone mappingT:H→His maximal if the graphG(T)

ofT is not properly contained in the graph of any other monotone mapping. It is known that a monotone mappingTis maximal if and only if, for any (x,f)∈H×H,x–y,f–g ≥ for all (y,g)G(T) impliesfTx. LetAbe a monotone mapping ofCintoHandNCvbe

the normal cone toCatvC,i.e.,

NCv=

wH:v–u,w ≥,∀u∈C and define a mappingTonCby

Tv=

⎧ ⎨ ⎩

Av+NCv, vC,

∅, v∈/C.

ThenTis maximal monotone and ∈Tvif and only ifAv,uv ≥ for alluC; see [] and the references therein.

Recall that the classical variational inequality problem is to findxCsuch that

Ax,yx ≥, ∀y∈C. (.)

It is known thatxCis a solution to (.) if and only ifxis a fixed point of the mapping PC(I–λA), whereλ>  is a constant andIis the identity mapping. Projection methods

recently have been studied for variational inequality (.); see [–] and the references therein.

LetS:CCbe a nonlinear mapping. In this paper, we useF(S) to denote the fixed point set ofS. Recall thatSis said to be nonexpansive if

Sx–Sy ≤ xy, ∀x,yC.

Sis said to be asymptotically nonexpansive if there exists a sequence{kn} ⊂[,∞) with limn→∞kn=  such that

(3)

Sis said to beκ-strictly pseudocontractive if there exists a constantk∈[, ) such that

Sx–Sy≤ x–y+κ(x–Sx) – (ySy), ∀x,yC.

The class of strict pseudocontractions was introduced by Browder and Petryshyn []. It is clear that every nonexpansive mapping is a -strict pseudocontraction.

T is said to be an asymptoticallyκ-strict pseudocontraction if there exists a sequence {kn} ⊂[,∞) withlimn→∞kn=  and a constantκ∈[, ) such that

TnxTny≤knx–y+κITn x

ITn y, ∀x,yC,n≥.

The class of asymptotically strict pseudocontractions was introduced by Qihou []. It is clear that every asymptotically nonexpansive mapping is an asymptotically -strict pseu-docontraction.

LetFbe a bifunction ofC×CintoR, whereRdenotes the set of real numbers andA: CHis an inverse-strongly monotone mapping. In this paper, we consider the following generalized equilibrium problem:

FindxCsuch thatF(x,y) +Ax,yx ≥, ∀yC. (.)

In this paper, the set of suchxCis denoted byEP(F,A),i.e.,

EP(F,A) =xC:F(x,y) +Ax,yx ≥,∀y∈C.

To study the generalized equilibrium problem (.), we may assume thatFsatisfies the following conditions:

(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↓

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

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

If A≡, then the generalized equilibrium problem (.) is reduced to the following equilibrium problem:

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

In this paper, the set of suchxCis denoted byEP(F),i.e.,

EP(F) =xC:F(x,y)≥,∀yC.

IfF≡, then the generalized equilibrium problem (.) is reduced to the classical vari-ational inequality (.).

(4)

(.), generalized equilibrium problem (.), and fixed points of an asymptotically strict pseudocontraction. Possible computation errors are taken into account. Weak conver-gence theorems are established in the framework of real Hilbert spaces.

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

Lemma .[] Let C be a nonempty closed convex subset of H,and let F:C×C→R

be a bifunction satisfying(A)-(A).Then,for any r> and xH,there exists zC such that

F(z,y) +

ryz,zx ≥, ∀yC.

Further,define

Trx=

zC:F(z,y) +

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

for all r> and xH.Then the following hold:

(a) Tris single-valued;

(b) Tris firmly nonexpansive,i.e.,for anyx,yH,

TrxTry≤ TrxTry,xy;

(c) F(Tr) =EP(F);

(d) EP(F)is closed and convex.

Lemma .[] Let C be a nonempty closed convex subset of a Hilbert space H and S:

CC be an asymptotically strict pseudocontraction.Then IS is demi-closed,that is,if {xn}is a sequence in C with xnx and xnSxn→,then xF(S).

Lemma .[] Let H be a Hilbert space and <ptnq< for all n≥.Suppose that

{xn}and{yn}are sequences in H such that

lim sup n→∞

xnd, lim sup n→∞

ynd

and

lim

n→∞tnxn+ ( –tn)yn=d

hold for some d≥.Thenlimn→∞xnyn= .

Lemma .[] Let{an},{bn},and{cn}be three nonnegative sequences satisfying the

fol-lowing condition:

an+≤( +bn)an+cn, ∀n≥n,

where nis some nonnegative integer,

n=bn<∞ and

(5)

3 Main results

Theorem . 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).Let A:CH be anα -inverse-strongly monotone mapping,and let B:CH be aβ-inverse-strongly monotone mapping. Let S:CC be an asymptoticallyκ-strict pseudocontraction with the sequence{kn}such

thatn=(kn– ) <∞.Assume that=F(S)∩VI(C,B)∩EP(F,A)is not empty.Let{αn},

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

number sequences.Let{xn}be a sequence generated in the following process:

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

x∈C,

F(zn,z) +Axn,zzn+rnz–zn,znxn ≥, ∀z∈C,

yn=PC(znsnBzn),

xn+=αnxn+αn(βnyn+ ( –βn)Snyn) +αnen,

where{en}is a bounded sequence in C.Assume that the control sequences satisfy the

fol-lowing restrictions:

(a) αn+αn+αn= ; (b)  <pαnq< and

n=αn<∞; (c)  <κ<βnb< ;

(d)  <ssns< βand <rrnr< α,

where p,q,b,s,s,r,rare real constants.Then{xn}converges weakly to some point in.

Proof First, we show that the sequences{xn},{yn}, and{zn}are bounded. Letpbe

fixed arbitrarily. For anyx,yC, we see that

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

=(x–y) –rn(Ax–Ay)

=xy– rnxy,AxAy+rnAxAy

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

Using the restriction (d), we see that(I–rnA)x– (I–rnA)y ≤ xy. This implies that

IrnAis nonexpansive. In the same way, we find thatIsnBis also nonexpansive. Using

the restriction (c), we obtain that

βnyn+ ( –βn)Snynp

=βnynp+ ( –βn)SnynSnp

βn( –βn)(ynp) –

SnynSnp

βnynp+ ( –βn)

knynp+κ(ynp) –

SnynSnp

βn( –βn)(ynp) –

SnynSnp

=knynp– ( –βn)(βnκ)(ynp) –

SnynSnp

(6)

It follows that

xn+p≤αnxnp+αnβnyn+ ( –βn)Snynp

+αnenp

αnxnp+αnknynp+αnenp

=αnxnp+αnknPC(I–snB)znp+αnenp

αnxnp+αnknTrn(I–rnA)xnp

+αnenp

knxnp+αnenp.

This implies from Lemma . thatlimn→∞xn–pexists. This shows that{xn}is bounded,

so are{yn}and{zn}. From (.), we have

xn+p≤αnxnp+αnknynp+αnenp

αnxnp+αnkn(I–snB)znp+αnenp

αnxnp+αnkn

znp–sn(βsn)BznBp +αnenp

knxnp–snknαn(βsn)BznBp+αnenp.

It follows that

snknαn(βsn)BznBp≤knxnp–xn+p+αnenp.

With the aid of the restrictions (b) and (d), we find that

lim

n→∞BznBp= . (.)

SincePCis firmly nonexpansive, we have

ynp =PC(I–snB)znPC(I–snB)p

≤(I–snB)zn– (I–snB)p,ynp

= 

(I–snB)zn– (I–snB)p

+ynp

–(I–snB)zn– (I–snB)p– (ynp)

≤  

znp+ynp–znynsn(BznBp)

=  

znp+ynp–znyn

+ snznyn,BznBpsnBznBp

≤  

xnp+ynp–znyn

+ snznyn,BznBpsnBznBp

,

which implies that

(7)

Hence, we find from (.) that

xn+p≤αnxnp+αnknynp+αnenp

knxnp–αnknznyn+ αnsnknznynBznBp

+αnenp.

Therefore, we obtain that

αnknznyn≤knxnp–xn+p+ snknznynBznBp

+αnenp.

From the restrictions (b) and (d), we find from (.) that

lim

n→∞znyn= . (.)

It follows from (.) that

znp=Trn(I–rnA)xnp

≤ xnp–rn(αrn)AxnAp.

Hence, we have

xn+p≤αnxnp+αnknynp+αnenp

αnxnp+αnknznp+αnenp

knxnp–αnrn(αrn)knAxnAp+αnenp.

This implies that

αnrn(αrn)knAxnAp≤knxnp–xn+p+αnenp.

Using the restrictions (b) and (d), we obtain that

lim

n→∞AxnAp= . (.)

SinceTrnis firmly nonexpansive, we find that

znp=Trn(I–rnA)xnTrn(I–rnA)p

≤(I–rnA)xn– (I–rnA)p,znp

= 

(I–rnA)xn– (I–rnA)p

+znp

–(I–rnA)xn– (I–rnA)p– (znp)

≤  

(8)

=  

xnp+znp–

xnzn

– rnxnzn,AxnAprnAxnAp

,

which implies that

znp≤ xnp–xnzn+ rnxnznAxnAp.

It follows that

xn+p≤αnxnp+αnknynp+αnenp

αnxnp+αnknznp+αnenp

knxnp–αnknxnzn+ rnαnknxnznAxnAp

+αnenp,

which yields that

αnknxnzn≤knxnp–xn+p+ rnαnxnznAxnAp

+αnenp.

Using the restrictions (b) and (d), we find from (.) that

lim

n→∞xnzn= . (.)

It follows from (.) and (.) that

lim

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

Since{xn}is bounded, we see that there exists a subsequence{xni}of{xn}which converges

weakly toξ. LetTbe a maximal monotone mapping defined by

Tx=

⎧ ⎨ ⎩

Bx+NCx, xC,

∅, x∈/C.

For any given (x,y)∈Graph(T), we havey–BxNCx. SinceynC, by the definition ofNC,

we havexyn,y–Bx ≥. Sinceyn=PC(I–snB)zn, we see thatx–yn,yn– (I–snB)zn ≥

and hence

xyn,

ynzn

sn

+Bzn

≥.

It follows that

xyni,yxyni,Bx

xyni,Bx

xyni, ynizni

sni

+Bzni

(9)

=xyni,BxByni+xyni,ByniBzni

xyni, ynizni

sni

≥ x–yni,ByniBzni

xyni, ynizni

sni

.

Sinceyniconverges weakly toξandBis

β-Lipschitz continuous, we see thatxξ,y ≥. Notice thatTis maximal monotone and hence ∈. This shows thatξ∈VI(C,B). From (.), we see thatzniconverges weakly toξ. It follows that

F(zn,z) +Axn,zzn+

rnz

zn,znxn ≥, ∀z∈C.

From condition (A), we see that

Axn,zzn+

rnz

zn,znxnF(z,zn), ∀z∈C.

Replacingnbyni, we arrive at

Axni,zzni+

zzni,

znixni rni

F(z,zni), ∀zC. (.)

Fortwith  <t≤ andzC, letut=tz+ ( –t)ξ. SincezCandξC, we haveutC.

In view of (.), we find that

utzni,Aututzni,AutAxni,utzni

utzni,

znixni rni

+F(ut,zni)

=utzni,AutAzni+utzni,AzniAxni

utzni, znixni

rni

+F(ut,zni).

Using (.), we have limi→∞AzniAxni = . Since A is monotone, we see thatutzni,AutAzni ≥. It follows from condition (A) that

utξ,AutF(ut,ξ). (.)

Using conditions (A) and (A), we see from (.) that

 =F(ut,ut)≤tF(ut,z) + ( –t)F(ut,ξ)

tF(ut,z) + ( –t)utξ,Aut

=tF(ut,u) + ( –t)tzξ,Aut,

which yields that

(10)

Lettingt→, we find

F(ξ,z) +zξ, ≥,

which implies thatξ∈EP(F,A).

Now, we are in a position to showξF(S). Sincelimn→∞xnpexists, we may

as-sume thatlimn→∞xnp=d> . Putλn=βnyn+ ( –βn)Snyn. It follows from (.) that lim supn→∞xnp+αn(enλn) ≤dandlim supn→∞λnp+αn(enλn) ≤d. On the

other hand, we have

lim

n→∞xn+p=nlim→∞αn

(xnp) +αn(enλn) + ( –αn)

λnp+αn(enλn) =d.

Using Lemma ., we obtain thatlimn→∞λnxn= . Note that

Snynxn= λnxn

 –βn

+βn(xnyn)  –βn

.

Hence, we havelimn→∞Sny

nxn= . Note thatSnxnxnSnxnSnyn+Snyn

xn. SinceSis Lipschitz continuous, we havelimn→∞Snxnxn= . Further, we find that limn→∞Sxnxn= . Using Lemma ., we see thatξF(S). This proves thatη.

Finally, we show that the sequence{xn}converges weakly toξ. Assume that there exists

another subsequence{xnj}of{xn}such that{xnj}converges weakly toη. In the same way, we findη. Ifη=ξ, we see from the Opial condition [] that

lim

n→∞xnξ=lim infi→∞ xniξ<lim infi→∞ xniη

=lim inf

n→∞ xnη=lim infj→∞ xnjη <lim inf

j→∞ xnjξ= lim

n→∞xnξ.

This derives a contradiction. Hence, we haveη=ξ. This implies thatxn ξ. This

completes the proof.

Remark . The key of the weak convergence of the algorithm is due to the fact thatAis inverse-strongly monotone, which yields thatIrnAis nonexpansive. The nonexpansivity

of the mappingIrnAplays an important role in this theorem. Therefore, it is of interest

to relax the monotonicity ofAsuch that the algorithm is still weakly convergent.

Next, we give some subresults of Theorem .. IfSis asymptotically nonexpansive, we find the following result.

Corollary . 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).Let A:CH be anα -inverse-strongly monotone mapping,and let B:CH be aβ-inverse-strongly monotone mapping. Let S:CC be an asymptotically nonexpansive mapping with the sequence{kn}such that

(11)

and{αn}be real number sequences in(, ).Let{rn}and{sn}be two positive real number

sequences.Let{xn}be a sequence generated in the following process:

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

x∈C,

F(zn,z) +Axn,zzn+rnz–zn,znxn ≥, ∀z∈C,

yn=PC(znsnBzn),

xn+=αnxn+αnSnyn+αnen,

where{en}is a bounded sequence in C.Assume that the control sequences satisfy the

fol-lowing restrictions:

(a) αn+αn +αn= ;

(b)  <pαnp< andn=αn<∞; (c)  <ssns< βand <rrnr< α,

where p,q,s,s,r,rare real constants.Then{xn}converges weakly to some point in.

Further, ifSis an identity mapping, we have the following result.

Corollary . 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).Let A:CH be anα -inverse-strongly monotone mapping,and let B:CH be aβ-inverse-strongly monotone mapping. Assume that=VI(C,B)∩EP(F,A)is not empty.Let{αn},{αn},and{αn}be real number

sequences in(, ).Let{rn}and{sn}be two positive real number sequences.Let{xn}be a

sequence generated in the following process:

⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩

x∈C,

F(yn,z) +Axn,zyn+rnz–yn,ynxn ≥,

xn+=αnxn+αnPC(ynsnByn) +αnen,

where{en}is a bounded sequence in C.Assume that the control sequences satisfy the

fol-lowing restrictions:

(a) αn+αn +αn= ; (b)  <pαnq< and

n=αn<∞; (c)  <ssns< βand <rrnr< α,

where p,q,s,s,r,rare real constants.Then{xn}converges weakly to some point in.

Next, we give a result on variational inequality (.).

Corollary . Let C be a nonempty closed convex subset of a real Hilbert space H.Let

A:CH be anα-inverse-strongly monotone mapping,and let B:CH be aβ -inverse-strongly monotone mapping.Assume that=VI(C,B)∩VI(C,A)is not empty.Let{αn},

{αn},and{αn}be real number sequences in(, ).Let{rn} and{sn} be two positive real

number sequences.Let{xn}be a sequence generated in the following process:

⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩

x∈C,

zn=PC(xnsnAxn),

(12)

where{en}is a bounded sequence in C.Assume that the control sequences satisfy the

fol-lowing restrictions:

(a) αn+αn +αn= ; (b)  <pαnq< and

n=αn<∞; (c)  <ssns< βand <rrnr< α,

where p,q,s,s,r,rare real constants.Then{xn}converges weakly to some point in.

Proof PuttingF≡, we see that

Axn,zzn+

rn

z–zn,znxn ≥, ∀z∈C

is equivalent to

xnrnAxnzn,znz ≥, ∀zC.

This implies thatzn=PC(xnrnAxn). Letβn=  andSbe the identity. Then we can obtain

from Theorem . the desired results immediately.

Finally, we consider solving common fixed points of a pair of strict pseudocontractions.

Corollary . Let C be a nonempty closed convex subset of a real Hilbert space H.Let

T:CC be anα-strict pseudocontraction,and let T:CC be aβ-strict

pseudo-contraction.Assume that=F(T)∩F(T)is not empty.Let{αn},{αn},and{αn}be real

number sequences in(, ).Let{rn}and{sn}be two positive real number sequences.Let{xn}

be a sequence generated in the following process:

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

x∈C,

zn= ( –rn)xn+rnTxn,

yn= ( –sn)xn+snTxn,

xn+=αnxn+αnyn+αnen,

where{en}is a bounded sequence in C.Assume that the control sequences satisfy the

fol-lowing restrictions:

(a) αn+αn +αn= ; (b)  <pαnq< and

n=αn<∞;

(c)  <ssns<  –αand <rrnr<  –β,

where p,q,s,s,r,rare real constants.Then{xn}converges weakly to some point in.

Proof Put F≡ ,A=IT andB=IT. It follows that A is –α-inverse-strongly

monotone andBis –β-inverse-strongly monotone. We also have F(T) =VI(C,B) and

F(T) =VI(C,A). In view of Theorem ., we find the desired result immediately.

Competing interests

The author declares that they have no competing interests.

(13)

References

1. Facchinei, F, Pang, JS: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. I. Springer, New York (2003)

2. Facchinei, F, Pang, JS: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. II. Springer, New York (2003)

3. Fattorini, HO: Infinite-Dimensional Optimization and Control Theory. Cambridge University Press, Cambridge (1999) 4. Rockfellar, RT: Monotone operators and proximal point algorithm. SIAM J. Control Optim.14, 877-898 (1976) 5. Rockafellar, RT: Convex Analysis. Princeton University Press, Princeton (1970)

6. Rockafellar, RT: On the maximality of sums of nonlinear monotone operators. Trans. Am. Math. Soc.149, 75-88 (1970) 7. Tanaka, Y: A constructive version of Ky Fan’s coincidence theorem. J. Math. Comput. Sci.2, 926-936 (2012)

8. He, RH: Coincidence theorem and existence theorems of solutions for a system of Ky Fan type minimax inequalities in FC-spaces. Adv. Fixed Point Theory2, 47-57 (2012)

9. Byrne, C: A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl.20, 103-120 (2008)

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

11. Cho, SY, Qin, X, Kang, SM: Iterative processes for common fixed points of two different families of mappings with applications. J. Glob. Optim.57, 1429-1446 (2013)

12. Takahashi, W, Toyoda, M: Weak convergence theorems for nonexpansive mappings and monotone mappings. J. Optim. Theory Appl.118, 417-428 (2003)

13. Cho, YJ, Qin, X: Systems of generalized nonlinear variational inequalities and its projection methods. Nonlinear Anal.

69, 4443-4451 (2008)

14. Lv, S, Wu, C: Convergence of iterative algorithms for a generalized variational inequality and a nonexpansive mapping. Eng. Math. Lett.1, 44-57 (2012)

15. Chang, SS, Lee, HWJ, Chan, CK: A new hybrid method for solving a generalized equilibrium problem, solving a variational inequality problem and obtaining common fixed points in Banach spaces, with applications. Nonlinear Anal.73, 2260-2270 (2010)

16. Cho, SY, Kang, SM: Approximation of fixed points of pseudocontraction semigroups based on a viscosity iterative process. Appl. Math. Lett.24, 224-228 (2011)

17. Hao, Y: On variational inclusion and common fixed point problems in Hilbert spaces with applications. Appl. Math. Comput.217, 3000-3010 (2010)

18. Yuan, Q, Kim, JK: Weak convergence of algorithms for asymptotically strict pseudocontractions in the intermediate sense and equilibrium problems. Fixed Point Theory Appl.2012, 132 (2012)

19. Cho, SY, Kang, SM: Approximation of common solutions of variational inequalities via strict pseudocontractions. Acta Math. Sci.32, 1607-1618 (2012)

20. Luo, H, Wang, Y: Iterative approximation for the common solutions of a infinite variational inequality system for inverse-strongly accretive mappings. J. Math. Comput. Sci.2, 1660-1670 (2012)

21. Cho, SY, Li, W, Kang, SM: Convergence analysis of an iterative algorithm for monotone operators. J. Inequal. Appl.

2013, 199 (2013)

22. 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)

23. Browder, FE, Petryshyn, WV: Construction of fixed points of nonlinear mappings in Hilbert space. J. Math. Anal. Appl.

20, 197-228 (1967)

24. Qihou, L: Convergence theorems of the sequence of iterates for asymptotically demicontractive and hemicontractive mappings. Nonlinear Anal.26, 1835-1845 (1996)

25. Kim, KS, Kim, JK, Lim, WH: Convergence theorems for common solutions of various problems with nonlinear mapping. J. Inequal. Appl.2014, 2 (2014)

26. Qin, X, Chang, SS, Cho, YJ: Iterative methods for generalized equilibrium problems and fixed point problems with applications. Nonlinear Anal.11, 2963-2972 (2010)

27. Rodjanadid, B, Sompong, S: A new iterative method for solving a system of generalized equilibrium problems, generalized mixed equilibrium problems and common fixed point problems in Hilbert spaces. Adv. Fixed Point Theory3, 675-705 (2013)

28. Kang, SM, Cho, SY, Liu, Z: Convergence of iterative sequences for generalized equilibrium problems involving inverse-strongly monotone mappings. J. Inequal. Appl.2010, Article ID 827082 (2010)

29. Chang, SS, Zuo, P: Shrinking projection method of common solutions for generalized equilibrium

quasi-φ-nonexpansive mapping and relatively nonexpansive mapping. J. Inequal. Appl.2010, Article ID 101690 (2010)

30. Zhang, Q, Wu, H: Hybrid algorithms for equilibrium and common fixed point problems with applications. J. Inequal. Appl.2014, 221 (2014)

31. Cho, SY, Qin, X: On the strong convergence of an iterative process for asymptotically strict pseudocontractions and equilibrium problems. Appl. Math. Comput.235, 430-438 (2014)

32. Blum, E, Oettli, W: From optimization and variational inequalities to equilibrium problems. Math. Stud.63, 123-145 (1994)

33. Schu, J: Weak and strong convergence to fixed points of asymptotically nonexpansive mappings. Bull. Aust. Math. Soc.43, 153-159 (1991)

34. Tan, KK, Xu, HK: Approximating fixed points of nonexpansive mappings by the Ishikawa iterative process. J. Math. Anal. Appl.178, 301-308 (1993)

35. Opial, Z: Weak convergence of the sequence of successive approximation for nonexpansive mappings. Bull. Am. Math. Soc.73, 591-597 (1967)

10.1186/1029-242X-2014-378

References

Related documents

5 , We introduce two iterative sequence for finding a common element of the set of solutions of an equilibrium problems and the set of fixed points of a countable family of

Keywords: iterative method; extragradient method; weak convergence; variational inequality; monotone mapping; equilibrium problem; constrained convex.. minimization problem;

In this paper, we investigate the common solution problem of a monotone variational inequality, a system of equilibrium problems, and nonexpansive mappings based on an

In this paper, we introduce a new algorithm for finding a common element of the set of fixed points of N strict pseudocontractions and the set of solutions of equilibrium problems with

Kim, JK: Strong convergence theorems by hybrid projection methods for equilibrium problems and fixed point problems of the asymptotically quasi- φ -nonexpansive mappings.. Fixed

() For several iterative schemes based on hybrid steepest-descent method for general- ized mixed equilibrium problems, variational inequality problems, and fixed point prob- lems

Colaoa, V, Acedob, GL, Marinoa, G: An implicit method for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of infinite family

Kumam, P, Katchang, P: The hybrid algorithm for system of mixed equilibrium problems, general system of finite variational inequalities and common fixed points for nonexpansive