Skip to main content
SpringerPlus logoLink to SpringerPlus
. 2016 Feb 1;5:103. doi: 10.1186/s40064-016-1723-6

On synchronal algorithm for fixed point and variational inequality problems in hilbert spaces

L M Bulama 1, A Kılıçman 1,
PMCID: PMC4735104  PMID: 26877901

Abstract

The aim of this article is to expand and generalize some approximation methods proposed by Tian and Di (J Fixed Point Appl, 2011. doi:10.1186/1687-1812-21) to the class of (k,{μn},{ξn},ϕ)-total asymptotically strict pseudocontraction to solve the fixed point problem as well as variational inequality problem in the frame work of Hilbert space. Further, the results presented in this paper extend, improve and also generalize several known results in the literature .

Keywords: Synchronal algorithm, Total strict asymptotically pseudocontraction, K-strict pseudo-contraction, Nonexpansive mapping, Fixed point and variational inequality problem

Background

Let .,. be an inner product, . be the corresponding norm and H be a Hilbert space. The mapping T:HH is said to be; nonexpansive, if Tx-Tyx-y,x,yH, quasi-nonexpansive, if Tx-qx-q,xH and qFix(T), η-strongly monotone, if there exists a positive constant η>0 such that Tx-Ty,x-yηx-y2,x,yH, uniformly L-Lipschitzian, if there exists L>0 such that Tnx-TnyLx-y, x,yH and T is said to be strongly positive bounded linear operator, if there is a constant γ>0 such that Tx,xγx2,xH, and also T is said to be; contraction if there exists a constant β[0,1) such that Tx-Tyβx-y,x,yH, strictly pseudocontraction if there exists a constant k[0,1) such that

Tx-Ty2x-y2+k(I-T)x-(I-T)y2,x,yH.

The mapping T is said to be; asymptotically strict pseudocontraction if there exists a constant k[0,1) and a sequence {kn}[1,) with kn1 as n such that

Tnx-Tny2knx-y2+k(I-Tn)x-(I-Tn)y2,n1andx,yH,

(k,{μn},{ξn},ϕ)-total asymptotically strict pseudocontraction, if there exists a constant k[0,1), μn[0,), ξn[0,) with μn0 and ξn0 as n, and continuous strictly increasing function ϕ:[0,)[0,) with ϕ(0)=0 such that Tnx-Tny2x-y2+k(I-Tn)x-(I-Tn)y2+μnϕ(x-y)+ξn,x,yH.

We now give an example of (k,{μn},{ξn},ϕ)-total asymptotically strict pseudocontraction mappings .

Example 1

Let B be a unit ball in a real Hilbert space l2 and T:BB be a mapping define by

T:(x1,x2,x3,)0,x12,a2x2,a3x3,,(x1,x2,x3,)B

where {ai} is a sequence in (0,1) such that i=2(ai)=12.

It was proved by Goebel and Kirk (1972) that

  • (i)

    Tx-Ty2x-y;

  • (ii)

    Tnx-Tny2i=2n(ai)x-yx,yBandn2.

Now if we let k112=2 such that kn12=2i=2n(ai),forn2, then

limnkn=limn2i=2nai=1.

Similarly, if we let μn=kn-1, n1, ϕ(t)=t2,t0,k[0,1) and ξn be a non-negative real sequence such that ξn0, then x,yB, n1, we have

Tnx-Tny2x-y2+kx-y-Tnx-Tny+μnϕ(x-y)+ξn.

Remark 2

Note that, every nonexpansive mapping is k-strict pseudocontraction, k-strict pseudocontraction is asymptotically strict pseudocontraction mapping, asymptotically strict pseudocontraction mapping is (k,{μn},{ξn},ϕ)-total asymptotically strict pseudocontraction mapping.

Throughout this paper, we adopt the notations; I is the identity operator, Fix(T) is the fixed point set of T, VIP(C,F) is the solution set of variational inequality problem [see Eq.  (1)], “” and “” denote the strong and weak convergence respectively, and ωω(xn) denote the set of the cluster point of {xn} in the weak topology i.e., {xnj of {xn} such that xnjx}.

Let C be a nonempty closed convex subset of H and F:CH be a map. The variational inequality problem with respect to C and F is defined as search for xC, such that

Fx,x-x0,xC. 1

The problem of solving a variational inequality problem of the form (1) has been intensively studied by numerous authors due to its various applications in several physical problems such as; in operational research, economics, engineering design etc., see for example Jianghua (2008), Noor (2007), Kinderlehrer and Stampacchia (1980) and the references therein.

It was Yamada (2001) proposed a hybrid steepest decent method for solving variational inequality problem, which generate a sequence {xn} by the following iterative algorithm:

x0Hisarbitrarily;xn+1=Txn-μnλnF(Txn),n0, 2

where T is nonexpansive mapping, F is L-Lipschitzian and η-strongly monotone with L>0,η>0,0<μ<2ηL2 and λn(0,1) satisfying the following conditions:

(i)limnλn=0,λn=;(ii)either|λn+1-λn|<orlimnλn+1λn=1. 3

They showed that, the sequence {xn} generated by algorithm (2) converged strongly to the unique solution of variational inequality problem

Fx,x-x0,xFix(T). 4

Besides, he also proposed cyclic algorithm whose generate a sequence {xn} by

xx+1=Tλnxn=I-μnλnFT[n]xn,n0, 5

where T[n]=Tn(modN), he also got strong convergence results.

Marino and Xu (2006) introduced another algorithm for solving variational inequality problem, which generate a sequence {xn} by

x0Hisarbitrarily;xn+1=αnγf(xn)+I-αnATxn, 6

where f is a contraction, A is strongly positive bounded linear operator, T is a nonexpansive, {αn} is a sequence in (0, 1) satisfying the conditions in Eq. (3), then they showed that, the sequence {xn} generated by algorithm (6), converged strongly to a common fixed point x of T which solve the variational inequality problem

(γf-A)x,x-x0,xFix(T). 7

Tain (2010) combined algorithm (2) and (5), and he considered the following general iterative algorithm, which generate a sequence {xn} by:

x0Hisarbitrarily;xn+1=αnγf(xn)+(I-μαnF)Txn, 8

where T is a nonexpansive, f is a contraction, F is k -Lipschitzian and η- strongly monotone with k>0, η>0, 0<μ<2ηk2 and {αn} is a sequence in (0, 1) satisfying the conditions in Eq. (3), then the sequence {xn} generated by algorithm (8), converged to a common fixed point x of T which solves the variational inequality

(γf-μF)x,x-x0,xFix(T). 9

Tian and Di (2011) designed synchronal and cyclic algorithm based on the general iterative algorithm proposed by Tain (2010) for finding the common fixed point x of finite family of strict pseudocontraction mapping, which is the solution of the variational inequality problem

(γf-μG)x,x-x0,xi=1NFix(Ti), 10

and they obtained the strong convergent results as shown below:

Theorem 3

(Synchronal Algorithm). LetHbe a real Hilbert space andTi:HHbe aki-strict pseudocontraction, for someki(0,1), (i=1,2,3,,N)such thati=1NFix(Ti), let f be a contraction with coefficientβ(0,1)andλibe a positive constant such thati=1Nλi=1. LetG:HHbe aη-strongly monotone andL-Lipschitzian operator withL>0andη>0.Assume that0<μ<2ηL2,0<γ<μ(η-μL22)/β=τβ. Given the initial guessx0Hchosen arbitrarily and given sequences{αn}and{βn}in (0, 1) satisfying the following conditions:

(i)limnαn=0,αn=;(ii)|αn+1-αn|<,|βn+1-βn|<;(iii)0maxikiβn<a<1,n0. 11

Let{xn}be the sequence defined by

Tβn=βnI+(1-βn)i=1NλiTi;xn+1=αnγf(xn)+I-αnμGTβnxn. 12

Then{xn}converged strongly to a common point of{Ti}i=1Nwhich solves the variational inequality problem (10).

Theorem 4

(Cyclic Algorithm) LetHbe a real Hilbert space andTi:HHbe aki-strict pseudo-contraction for someki(0,1)(i=1,2,3,,N)such thati=1NFix(Ti)and let f be a contraction with coefficientβ(0,1). LetG:HHbe aη-strongly monotone andL-Lipschitzian operator withL>0andη>0.Assume that0<γ<μη-μL22/β=τβ. Given the initial guessx0Hchosen arbitrarily and given sequences{αn}and{βn}in (0, 1) satisfying the following conditions:

(i)limnαn=0,αn=;(ii)|αn+1-αn|<,orlimnαnαn+1=1;(iii)β[n][k,1),wherek=max{ki:1iN}, 13

let{xn}be the sequence defined by

A[n]=β[n]I+(1-β[n])T[n];xn+1=αnγf(xn)+(I-αnμG)A[n+1]xn, 14

whereT[n]=Ti, with i=n(mod N),1iN, namelyT[n]is one ofT1,T2,T3,,TNcircularly. Then{xn}converged strongly to a common point of{Ti}i=1Nwhich solve the variational inequality problem (10).

And also Auwalu et al. (2013) proved the following results in real Banach space which is the generalization of Tian and Di (2011).

Theorem 5

(Synchronal Algorithm) LetEbe a realq-uniformly smooth Banach space, andCbe a nonempty closed convex subset ofE. LetTi:CCbe aki-strict pseudocontractions for someki(0,1), (i=1,2,3,,N)such thati=1NFix(Ti). Letfbe a contraction with coefficientβ(0,1)and{λi}i=1Nbe a sequence of positive number such thati=1Nλi=1. LetG:CCbe anη-strongly accretive andL-Lipschitzian operator withL>0 and η>0.Assume that0<μ<(qη/dqLq)1/q-1, 0<γ<μ(η-dqμq-1Lq/q)/β=τβ. Let{αn}and{βn}be sequences in (0,1) satisfying the following conditions:

(k1)limnαn=0,αn=;(k2)|αn+1-αn|<,|βn+1-βn|<;(k3)0<kβn<a<1,n0,wherek=min{ki:1iN};(k4)αn,βn[μ,1),whereμ[max{0,1-λqdq1q-1},1). 15

Let{xn}be a sequence defined by algorithm (12), then{xn}converged strongly to a common fixed point of{Ti}i=1Nwhich solve the variational inequality problem (10).

Motivated by these two results, in this paper, we modified the algorithms of Tian and Di (2011) to the class of total asymptotically strict pseudocontraction mapping to solve the fixed-point problem as well variational inequality problem, this will be done in the frame work of real Hilbert space. By imposing some conditions, we obtained new strong convergence results. The results presented in this paper, not only extend and improve the results of Tian and Di (2011) but also extend, improve and generalize the results of; Yamada (2001), Marino and Xu (2006), Tain (2010) and Mainge (2009).

Preliminaries

In the sequel we shall make use of the following lemmas in proving our main results.

Lemma 6

( Marino and Xu 2007) LetHbe a Hilbert space, there hold the following identities;

  • (i)

    x-y2=x2-y2-2x-y,y,x,yH;

  • (ii)

    tx+(1-t)y2=tx2+(1-t)y2-t(1-t)x-y2,t[0,1]andx,yH;

  • (iii)
    if {xn} is a sequence in H such that xnz, then
    lim supnxn-y2=lim supnxn-z2+z-y2,yH.

Lemma 7

(Chang et al. 2013) LetCbe a nonempty closed convex subset of a real Hilbert spaceHand letT:CCbe a (k,{μn},{ξn},ϕ)-total asymptotically strict pseudocontraction mapping and uniformly L-Lipschitzian. ThenI-Tis demiclosed at zero in the sense that if{xn}is a sequence inCsuch thatxnx, andlim supn(Tn-I)xn=0, then(T-I)x=0.

Lemma 8

(Xu 2002) Assume that{an}is a sequence of nonnegative real number such that

an+1(1-γn)an+σn,n0,

whereγnis a sequence in (0, 1) andσnis a sequence of real number such that;

  • (i)

    limnγn=0andγn=;

  • (ii)

    limnσnγn0 or |σn|<. Then limnan=0.

Lemma 9

(Tian and Di 2011) LetF:HHbe aη-strongly monotone andL-Lipschitzian operator withL>0andη>0. Assume that0<μ<2ηL2, τ=μη-2L2μ2and0<t<1. Then

(I-μtF)x-(I-μtF)y(I-τt)x-y.

Lemma 10

LetS:CHbe a uniformlyL-Lipschitzian mapping withL(0,1]. DefineT:CHbyTβnx=βnx+(1-βn)Snxwithβn(0,1)andxC. ThenTβnis nonexpansive andFix(Tβn)=Fix(Sn).

Proof

Let x,yC, from Lemma [6(ii)], we have

Tβnx-Tβny2=βn(x-y)+(1-βn)(Snx-Sny)2=βnx-y2+(1-βn)Snx-Sny2-βn(1-βn)(x-y)-Snx-Sny2βnx-y2+(1-βn)Snx-Sny2βn+1-βnL2x-y2,

since L(0,1] and βn(0,1), it follow that, Tβn is nonexpansive, and it is not difficult to see that Fix(Tβn)=Fix(Sn).

Lemma 11

(Tain 2010) LetHbe a real Hilbert space,f:HHbe a contraction with coefficient0<α<1andF:HHbe aL-Lipschitzian continuous operator andη-strongly monotone operator withL>0andη>0. Then for0<γ<μηα,

x-y,(μF-γf)x-(μF-γf)y(μη-γα)x-y2.

Main results

In this section, we prove the following theorem which is the extension of the theorems (3) and (4).

Theorem 12

LetT:HHbe a(k,{μn},{ξn},ϕ)-total asymptotically strict pseudocontraction mapping and uniformly M-Lipschitzian withϕ(t)=t2,t0andM(0,1]. Assume thatFix(Tn),and letfbe a contraction with coefficientβ(0,1), G:HHbe aη-strongly monotone andL-Lipschitzian operator withL>0andη>0respectively. Assume that0<γ<μ(η-μL22)/β=τβand letx0Hbe chosen arbitrarily,{αn}and{βn}be two sequences in (0,1) satisfying the following conditions:

(i)limnαn=0andαn=;(ii)αn+1-αn<,βn+1-βn<and1-βn<;(iii)0kβn<a<1,n0. 16

Let{xn}be a sequence defined by

Tβn=βnI+(1-βn)Tn;xn+1=αnγf(xn)+I-αnμGTβnxn, 17

then{xn}converges strongly to a common fixed ofTnwhich solve the variational inequality problem

(γf-μG)x,x-x0,xFixTn. 18

Proof

The proof is divided into five steps as follows.

Step 1. In this step, we show that

TβnisnonexpansiveandFix(Tβn)=FixTn. 19

The proof follows directly from Lemma (10).

Step 2. In this step, we show that

{xn},{Tnxn},{f(xn)}and{GTnxn}areallbounded. 20

Let xFix(Tn), from (17) and Lemma (9), and the fact that f is a contraction, we have

xn+1-x=αnγf(xn)+(I-αnμG)Tβnxn-x=αn(γf(xn)-μGx)+(I-αnμG)Tβnxn-(I-αnμG)x(1-αnτ)xn-x+αnγ(f(xn)-f(x))+γf(x)-μGx)1-αn(τ-γβ)xn-x+αnγf(x)-μGx)maxxn-x,γf(x)-μGx)(τ-γβ).

By using induction, we have

xn+1-xmaxx0-x,γf(x)-μGx)(τ-γβ). 21

Hence {xn} is bounded, and also

Tnxn-x2xn-x2+kxn-x-Tnxn-x2+μnϕxn-x+ξn=xn-x2+kxn-x2+kTnxn-x2+2kxn-xTnxn-x+μnxn-x2+ξn(1+k+μn)xn-x2+2kxn-xTnxn-x+kTnxn-x2+ξn. 22

From (22), we deduce that

(1-k)Tnxn-x2-2kxn-xTnxn-x-(1+k+μn)xn-x2-ξn0.

This implies that

Tnxn-xkxn-x(1-k)+4k2xn-x2+4(1-k){(1+k+μn)xn-x2+ξn}2(1-k)=kxn-x+(1+(1-k)μn)xn-x2+(1-k)ξn(1-k)kxn-x+(1+(1-k)μn)xn-x2+(1-k)ξn(1-k)Tnxn-xM, 23

where M is chosen arbitrarily such that

supkxn-x+(1+(1-k)μn))xn-x2+(1-k)ξn(1-k)M.

It follows from (23) that {Tnxn} is bounded. Since G is L-Lipschitzian, f is contraction and the fact that {xn},{Tnxn} are bounded, it is easy to see that {GTnxn} and {f(xn)} are also bounded.

Step 3. In this step, we show that

limnxn+1-xn=0. 24

Now,

xn+2-xn+1=(αn+1γf(xn+1)+(I-αn+1μG)Tβn+1xn+1)-(αnγf(xn)+(I-αnμG)Tβnxn)=αn+1γ(f(xn+1)-f(xn))+(αn+1-αn)γf(xn)+(I-αn+1μG)Tβn+1xn+1-(I-αn+1μG)Tβnxn+(αn-αn+1)μGTβnxn,

this turn to implies that

xn+2-xn+1αn+1γβxn+1-xn+(1-αn+1τ)Tβn+1xn+1-Tβnxn+αn+1-αn(γf(xn)+μGTβnxn)αn+1γβxn+1-xn+(1-αn+1τ)Tβn+1xn+1-Tβnxn+αn+1-αnN1, 25

where N1 is chosen arbitrarily so that supn1(γf(xn)+μGTβnxn)N1.

On the other hand,

Tβn+1xn+1-TβnxnTβn+1xn+1-Tβn+1xn+Tβn+1xn-Tβnxnxn+1-xn+βn+1-βnxn+1-βn+1Tn+1xn+(1-βn)Tnxnxn+1-xn+βn+1-βnN2+1-βn+1N3+1-βnN4, 26

where N2,3,4 satisfy the following relations:

N2supn1xn,N3supn1Tn+1xnandN4supn1Tnxn

respectively.

Now substituting (26) into (25), yields

xn+2-xn+1αn+1γβxn+1-xn+(1-αn+1τ)(xn+1-xn+βn+1-βnN2+1-βn+1N3+1-βnN4)+αn+1-αnN1=(1+αn+1(γβ-τ))xn+1-xn+αn+1-αnN1+(1-αn+1τ)(βn+1-βnN2+1-βn+1N3+1-βnN4)(1-αn+1(τ-γβ)xn+1-xn+(1-αn+1τ)(βn+1-βn+1-βn+1+1-βn+αn+1-αn)N5,

where N5 choosing appropriately such that N5max{N1,N2,N3,N4}.

By Lemma (8) and (ii), it follows that

limnxn+1-xn=0.

From Eq. (17), we have,

xn+1-Tβnxn=αnγf(xn)+(I-αnμG)Tβnxn-Tβnxnαnγf(xn)-μGTβnxn0.

On the other hand,

xn+1-Tβnxn=xn+1-(βn+(1-βn)Tn)xn=(xn+1-xn)+(1-βn)(xn-Tnxn)(1-βn)xn-Tnxn-xn+1-xn,

this implies that

xn-Tnxnxn+1-Tβnxn+xn+1-xn(1-βn)xn+1-Tβnxn+xn+1-xn(1-a)0.

From the boundedness of {xn}, we deduce that {xn} converges weakly. Now assume that xnp, by Lemma (7) and the fact that xn-Tnxn0, we obtain pFixTn. So, we have

ωω(xn)FixTn. 27

By Lemma (11) it follows that (γf-μG) is strongly monotone, so the variational inequality (18) has a unique solution xFix(Tn).

Step 4. In this step, we show that

lim supn(γf-μG)x,xn-x0. 28

The fact that {xn} is bounded, we have {xni}{xn} such that

lim supn(γf-μG)x,xn-x=lim supi(γf-μG)x,xni-x0.

Suppose without loss of generality that xnix, from (27), it follows that xFix(Tn). Since x is the unique solution of (17), implies that

lim supn(γf-μG)x,xn-x=lim supi(γf-μG)x,xni-x.=(γf-μG)x,x-x0.

Step 5. In this step, we show that

limnxn-x=0. 29

By Lemma (9) and the fact that f is a contraction, we have

xn+1-x2=αn(γf(xn)-μGx)+(I-αnμG)Tβnxn-(I-αnμG)x2(I-αnμG)Tβnxn-(I-αnμG)x2+2αnγf(xn)-μGx,xn+1-x(1-αnτ)2xn-x2+2αnγf(xn)-f(x),xn+1-x+2αnγf(x)-μGx,xn+1-x(1-αnτ)2xn-x2+2αnβγxn-xxn+1-x+2αnγf(x)-μGx,xn+1-x(1-αnτ)2xn-x2+αnβγ(xn-x2+xn+1-x2)+2αnγf(x)-μGx,xn+1-x,

this implies that

xn+1-x2((1-αnτ)2+αnβγ)xn-x2(1-αnγβ)+2αnγf(x)-μGx,xn+1-x(1-αnγβ)(1-(2τ-γβ)αn)xn-x2+(αnτ)2(1-αnγβ)xn-x2+2αnγf(x)-μGx,xn+1-x(1-αnγβ),

this implies that

xn+1-x2(1-γn)xn-x2+σn,

where

γn:=(2τ-γβ)αnandσn:=αn(1-αnγβ)(αnτ2xn-x2+2γf(x)-μGx,xn+1-x).

From [12(i)], it follows that

limnγn=0,γn=,σnγn=1(2τ-γβ)(1-αnγβ)(αnτ2xn-x2+2γf(x)-μGx,xn+1-x).

Thus limnσnγn0.

Hence by Lemma (8), it follows that xnx as n.

Corollary 13

LetBbe a unit ball in a real Hilbert spacel2, and let the mappingT:BBbe defined by

T:x1,x2,x3,0,x12,a2x2,a3x3,,x1,x2,x3,B,

where{ai}is a sequence in (0, 1) such thati=2(ai)=12. Let,f,G,γ,{αn},{βn}be as in theorem (12). Then the sequence{xn}define by algorithm (17), converges strongly to a common fixed point ofTnwhich solve the variational inequality problem (18).

Proof

By example (1), it follows that T is (k,{μ},{ξn},ϕ)-total asymptotically strict pseudocontraction mapping and uniformly M-Lipschitzian with M=2i=2n(ai). Hence, the conclusion of this corollary, follows directly from theorem (12).

Corollary 14

LetHbe a real Hilbert space andT:HHbe a(k,{kn})- asymptotically strict pseudocontraction mapping and uniformlyM-Lipschitzian withM(0,1]. Assume thatFix(Tn), and Letf,G,γ{αn}and{βn}be as in theorem (12). Then, the sequence{xn}generated by algorithm (17), converges strongly to a common fixed point ofTnwhich solve the variational inequality problem (18).

Corollary 15

(Tain 2010) Let the sequence{xn}be generated by the mapping

xn+1=αnγf(xn)+(I-μαnF)Txn,

whereTis nonexpansive,αnis a sequence in (0,1) satisfying the conditions in Eq. (11). It was proved in Tain (2010) that{xn}converged strongly to the common fixed pointxofT, which is the solution of variational inequality problem

(γf-μF)x,x-x0,xFix(T). 30

Proof

Take n=1, k=μn=ξn=0 and F=G in theorem (12). Therefore all the conditions in theorem (12) are satisfied. Hence the conclusion of this corollary follows directly from theorem (12).

Corollary 16

(Marino and Xu 2006) Let the sequence{xn}be generated by

xn+1=αnγf(xn)+(I-αnA)Txn,

whereTis nonexpansive and the sequenceαn(0,1)satisfy the conditions in Eq. (16). Then it was proved in Marino and Xu (2006) that{xn}converged strongly toxwhich solve the variational inequality

(γf-A)x,x-x0,xFix(T). 31

Proof

Take n=1, μn=ξn=0 and μ=1 and G=A in theorem (12). Therefore all the conditions in theorem (12) are satisfied. Hence the conclusion of this corollary follows directly from theorem (12).

Corollary 17

(Yamada 2001) Let the sequence{xn}be generated by

xn+1=Txn-μλnF(Txn),

whereTis nonexpansive mapping onH, Fis L-Lipschitzian andη-strongly monotone withL>0,η>0and0<μ<2ηL2, if the sequenceλn(0,1)satisfies the conditions in (3). Then, it was proved by Yamada (2001) that{xn}converged strongly to the unique solution of the variational inequality

Fx,x-x0,xFix(T). 32

Proof

Take n=1, k=μn=ξn=0 and also take γ=0, βn=0 and G=F. Therefore all the conditions in theorem (12) are satisfied. Hence the result follows directly from theorem (12).

Conclusion

In this paper, we modified the algorithms by Tian and Di (2011) in order to include the class of total asymptotically strict pseudocontraction mapping to solve the fixed-point problem as well variational inequality problem, this was done in the frame work of real Hilbert spaces. By imposing some conditions, we also obtained some new strong convergence results. Further we state that the results which were presented in this paper, not only extend and improve the results (Tian and Di 2011) but also extend, improve and generalize the results of; Yamada (2001), Marino and Xu (2006), Tain (2010) and Mainge (2009).

Authors’ contributions

Both authors jointly worked on deriving the results. Both authors read and approved the final manuscrip t.

Acknowledgements

The authors would like to thank the referees for valuable suggestions and comments, which helped the authors to improve this article substantially. The authors also gratefully acknowledge that this research was partially supported by the Universiti Putra Malaysia under the GP-IBT Grant Scheme having Project Number GP-IBT/2013/9420100.

Competing interests

The authors declare that they have no competing interests.

Contributor Information

L. M. Bulama, Email: lawanbulama@gmail.com

A. Kılıçman, Email: akilic@upm.edu.my

References

  1. Auwalu A, Mohammed LB, Saliu A. Synchronal and cyclic algorithms for fixed point problems and variational inequality problems in Banach spaces. J Fixed Point Appl. 2013;2013:1–24. doi: 10.1186/1687-1812-2013-1. [DOI] [Google Scholar]
  2. Chang SS, Lee HWJ, Chan CK, Wang L, Qin LJ. Split feasibility problem for quasi-nonexpansive multi-valued mappings and total asymptotically strict pseudo-contractive mapping. Appl Math Comput. 2013;219(20):10416–10424. doi: 10.1016/j.amc.2013.04.020. [DOI] [Google Scholar]
  3. Goebel K, Kirk WA. A fixed point theory for asymptotically nonexpansive mapping. Proc Am Math Soc. 1972;35:171–174. doi: 10.1090/S0002-9939-1972-0298500-3. [DOI] [Google Scholar]
  4. Jianghua F. A Mann type iterative scheme for variational inequalities in noncompact subsets of Banach spaces. J Math Anal Appl. 2008;337:1041–1047. doi: 10.1016/j.jmaa.2007.04.025. [DOI] [Google Scholar]
  5. Kinderlehrer D, Stampacchia G. An introduction to variational inequalities and their applications. Philadelphia: Siam; 1980. [Google Scholar]
  6. Mainge PE. The viscosity approximation process for quasi-nonexpansive mapping in Hilbert space. Comput Math Appl. 2009;59:74–79. doi: 10.1016/j.camwa.2009.09.003. [DOI] [Google Scholar]
  7. Marino G, Xu HK. A general iterative method for nonexpansive mapping in Hilbert space. J Math Anal Appl. 2006;318:43–52. doi: 10.1016/j.jmaa.2005.05.028. [DOI] [Google Scholar]
  8. Marino G, Xu HK. Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces. J Math Anal Appl. 2007;329(1):336–346. doi: 10.1016/j.jmaa.2006.06.055. [DOI] [Google Scholar]
  9. Noor MA. General variational inequalities and nonexpansive mappings. J Math Anal Appl. 2007;331:810–822. doi: 10.1016/j.jmaa.2006.09.039. [DOI] [Google Scholar]
  10. Tain M. A general iterative algorithm for nonexpansive mapping in Hilbert space. J Nonlinear Anal. 2010;73:689–694. doi: 10.1016/j.na.2010.03.058. [DOI] [Google Scholar]
  11. Tian M, Di L. Synchronal algorithm and cyclic algorithm for fixed point problems and variational inequality problems in Hilbert space. J Fixed Point Appl. 2011 [Google Scholar]
  12. Xu HK. Iterative algorithms for nonlinear operators. J Lond Math Soc. 2002;66(01):240–256. doi: 10.1112/S0024610702003332. [DOI] [Google Scholar]
  13. Yamada I. The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings. Stud Comput Math. 2001;8:473–504. doi: 10.1016/S1570-579X(01)80028-8. [DOI] [Google Scholar]

Articles from SpringerPlus are provided here courtesy of Springer-Verlag

RESOURCES