• No results found

A new iteration method for variational inequalities on the set of common fixed points for a finite family of quasi pseudocontractions in Hilbert spaces

N/A
N/A
Protected

Academic year: 2020

Share "A new iteration method for variational inequalities on the set of common fixed points for a finite family of quasi pseudocontractions in Hilbert spaces"

Copied!
12
0
0

Loading.... (view fulltext now)

Full text

(1)

R E S E A R C H

Open Access

A new iteration method for variational

inequalities on the set of common fixed

points for a finite family of

quasi-pseudocontractions in Hilbert spaces

Haiyun Zhou

1,2

and Peiyuan Wang

1*

*Correspondence:

[email protected] 1Department of Mathematics,

Shijiazhuang Mechanical Engineering College, Shijiazhuang, 050003, China

Full list of author information is available at the end of the article

Abstract

In this paper, we propose a new iteration method based on the hybrid steepest descent method and Ishikawa-type method for seeking a solution of a variational inequality involving a Lipschitz continuous and strongly monotone mapping on the set of common fixed points for a finite family of Lipschitz continuous and

quasi-pseudocontractive mappings in a real Hilbert space.

MSC: Primary 41A65; 47H17; secondary 47J20

Keywords: variational inequalities; hybrid steepest descent method; quasi-pseudocontractions; strongly monotone mappings

1 Introduction and preliminaries

LetCbe a nonempty closed and convex subset of a real Hilbert spaceHwith the inner product and induced norm · . A mappingFofCintoHis said to be monotone if

FxFy,xy ≥ (.)

for allx,yC.

The variational inequality problem with respect toFandCis to find a pointzCsuch that

Fz,yz ≥ for allyC. (.)

Variational inequalities were initially investigated by Kinderlehrer and Stampacchia in [], and have been widely studied by many authors ever since, due to the fact that they cover as diverse disciplines as partial differential equations, optimization, optimal control, mathematical programming, mechanics and finance (see [–]).

We know that ifFis ak-Lipschitz continuous andη-strongly monotone mapping,i.e.,

Fenjoys the following properties:

FxFykxy and FxFy,xyηxy

(2)

for allx,yC, wherekandηare fixed positive numbers, then (.) has a unique solution. It is well known that (.) is equivalent to the fixed point equation

z=PC(IμF)z, (.)

where PC stands for the metric projection fromH onto Candμis an arbitrarily pos-itive number. Consequently, the well-known iterative procedure, the projected gradient method (PGM) [–], can be used to solve (.). PGM generates an iterative sequence by the recursion

xC and xn+=PC(IμF)xn, n≥. (.)

WhenFis ak-Lipschitz continuous andη-strongly monotone mapping, asμ∈(,kη), the sequence{xn}generated by (.) converges strongly to a unique solution of (.).

The projected gradient method (.) involves the metric projection PC. In order to reduce the complexity caused by PC, Yamada [] introduced a hybrid steepest descent method (HSDM) for solving (.). By assuming thatC=Ni=Fix(Ti)=∅, whereFix(Ti) = {xH:x=Tix}andTiis a nonexpansive mapping onH,i.e.,

TxTyxy

for allx,yH, Yamada proposed the following iterative algorithm:

xH, xn+= (IλnμF)T[n]xn, (.)

whereT[n]=TnmodN, taking values in{, , . . . ,N},μ∈(,kη) and{λn}is a sequence of real

numbers in (, ), and proved that, under the following conditions:

(L) limn→∞λn= ,

(L) ∞n=λn=∞,

(L) ∞n=|λnλn+N|<∞, and

(L) C=Fix(TT· · ·TN–TN) =Fix(TNT· · ·TN–TN–) =· · ·=Fix(TT· · ·TNT),

the sequence{xn}generated by (.) converges strongly to a unique solution of (.). The

algorithms and convergence results of Yamada in [] have been improved and extended to a finite or an infinite family of nonexpansive mappings; see, for example, Xu and Kim [], Zeng [], Liu and Cai [], and Iemoto and Takahashi []. However, all such improvements and extensions are confined to a finite or an infinite family of nonexpansive mappings.

In this paper, we propose a new iterative algorithm based on a combination of the pro-jected gradient method for variational inequalities with the Ishikawa-type method for fixed point problems to solve (.) withC=Ni=Fix(Ti), where{Ti}Ni=is a finite family of Li-Lipschitz continuous and quasi-pseudocontractive mappings on, whereis a nonempty closed and convex subset ofH, whileF:H is ak-Lipschitz continuous andη-strongly monotone mapping.

Given a stating pointx, the iteration is generated by

⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩

x,

yni= ( –αni)xn+αniTixn, i= , , . . . ,N, xn+=P[(IλnμF)(βnxn+

N

i=βniTiyni)], n≥,

(3)

where{βni:i= , , , . . . ,N} ⊂(a,b)⊂(, ),{λn} ⊂(, ) satisfy the following conditions:

(i) Ni=βni= ;

(ii) limn→∞λn= ,

n=λn=∞;

(iii) Ni=βni≤min{αni:i= , , . . . ,N} ≤max{αni:i= , } ≤α<√+L+,∀n≥, whereL:=max{Li:i= , , . . . ,N}, whileμis a fixed constant satisfyingμ∈(,kη).

By virtue of new analysis techniques, we prove that the sequence generated by (.) con-verges strongly to a unique solution of (.) withC=Ni=Fix(Ti).

In order to reach our goal, we need the following conceptions and facts.

LetDbe a nonempty subset of a real Hilbert spaceH. A mappingT:DHis called

κ-strictly pseudocontractive if and only if there exists a constantκ∈[, ) such that TxTy≤ xy+κ(IT)x– (IT)y (.)

for allx,yD. Whenκ= ,Tis said to be pseudocontractive.

T is said to be quasi-pseudocontractive if and only ifFix(T)=∅and

Txy≤ xy+(IT)x (.)

for allxDbuty∈Fix(T).

We remark that inequalities (.) and (.) are equivalent to the inequalities

TxTy,xyxy– –κ

 (IT)x– (IT)y

for allx,yD (.)

and

Txy,xyxy (.)

for allxDbuty∈Fix(T), respectively.

We note that if T isκ-strictly pseudocontractive, then it is Lipschitz continuous and pseudocontractive; if T is a pseudocontraction with a fixed point, then T is a quasi-pseudocontraction; however, the converse may be not true.

Recall that the metric (nearest point) projection fromHonto a nonempty closed convex subsetEofHis defined as follows: for each pointxH, there exists a unique pointPExE

with the property

xPExxy for allyE,

that is, for any pointxH,x=PExif and only ifxEandxx=inf{xy:yE}.

Lemma .[, ] Let PE:HE be a metric projection from H on a nonempty closed convex subset E of H.Then the following conclusions hold true:

(p) GivenxHandzE.Thenz=PExif and only if there holds the inequality

(4)

(p)

PExPEy,xyPExPEy, ∀x,yH, (.)

in particular,one has

PExPEyxy, ∀x,yH. (.)

Lemma .[, ]

(i) x±y=x±x,y+yfor allx,yH;

(ii) ( –t)x+ty= ( –t)x+ty–t( –t)xyfor allx,yHandt∈R; (iii) for allxiHandαi∈[, ](i= , , . . . ,n)such that

n

i=αi= ,the following equality holds:

n

i=

αixi

=

n

i=

αixi–

≤i<jn

αiαjxixj.

Lemma .[] Letbe a nonempty subset of H and F:H be a k-Lipschitz con-tinuous and η-strongly monotone mapping. For each λ∈(, ] and μ∈ (,kη), write

:= (IλμF)andτ:=  – –μ(ημk)(, ).Then we have TλxTλy≤( –λτ)xy

for all x,y.

Lemma .[] Let E be a nonempty closed convex subset of a real Hilbert space H and T:

EE be L-Lipschitz continuous and quasi-pseudocontractive.ThenFix(T)is a nonempty closed convex subset of E,and therefore PFix(T)x is well defined for each x∈H.

Lemma .[] Let E be a nonempty closed convex subset of a real Hilbert space H and T:EE be a demicontinuous pseudocontraction from E into itself.ThenFix(T)is a closed convex subset of E and IT is demiclosed at zero.

Lemma .[] Let{an}be a sequence of real numbers such that there exists a subsequence

{ni}of{n}such that ani<ani+for all i∈N.Then there exists a nondecreasing sequence

{mk} ⊂Nsuch that mk→ ∞and the following properties are fulfilled:

amkamk+ and akamk+

for all sufficiently large numbers k∈N.

Lemma .[] Let{sn}be a sequence of nonnegative real numbers satisfying the following relation:

sn+≤( –tn)sn+tnσn, nn,

where{tn} ⊂(, )and{σn} ⊂R satisfy the following conditions:limn→∞tn= ,

n=tn=

(5)

2 Main results

Theorem . Letbe a nonempty,closed and convex subset of a real Hilbert space H.

Let T,T, . . . ,TN :be Li-Lipschitz continuous and quasi-pseudocontractive with Lipschitz constants L,L, . . . ,LN,respectively.Let F:H be a k-Lipschitz continuous andη-strongly monotone mapping.Assume thatF=Ni=Fix(Ti)=∅and ITiare demi-closed at zero for i= , , . . . ,N.Let{xn}be defined by(.).Then{xn}converges strongly to a unique solution xof(.),where x∗=PF(IμF)x∗.

Proof First of all, we show thatPFxis well defined for each xH. Indeed, in view of Lemma ., we know thatFix(Ti) are closed convex fori= , , . . . ,N, and henceFis also nonempty, closed and convex; consequently,PFxis well defined for anyxH. Secondly, we show that there exists a uniquex∗∈Fsuch that

x∗=PF(IμF)x∗. (.)

Indeed, in view of Lemma ., we know thatIμF:His a contraction, and hence

PF(IμF) :is also a contraction on. Then we use the Banach contraction map-ping principle to deduce (.).

Writeun=βnxn+i=N βniTiyni. Then,∀pF, by virtue of Lemma ., (.) and (.), we have that

ynip

=( –αni)(xnp) +αni(Tixnp)

= ( –αni)xnp+αniTixnp–αni( –αni)xnTixn

≤( –αni)xnp+αni

xnp+xnTixn

αni( –αni)xnTixn

=xnp+αnixnTixn (.)

fori= , , . . . ,Nand alln≥.

Furthermore, from (.) and Lemma ., we get that

yniTiyni

=( –αni)(xnTiyni) +αni(TixnTiyni) 

= ( –αni)xnTiyni+αniTixnTiyni–αni( –αni)xnTixn

≤( –αni)xnTiyni+αniLxnyni–αni( –αni)xnTixn

= ( –αni)xnTiyni+αniLxnTixn–αni( –αni)xnTixn

= ( –αni)xnTiyni–αni

 –αniLαni

xnTixn (.)

(6)

At this point, we can estimateunp. In fact, from Lemma ., (.), (.) and

con-ditions (i) and (iii) in (.), we have

unp

=

βn(xnp) + N

i=

βni(Tiynip) 

=βnxnp+ N

i=

βni(Tiynip)– N

i=

βnβnixnTiyni

≤i<jN

βniβnjTiyniTjynj

βnxnp+ N

i=

βni

ynip+yniTiyni

N

i=

βnβnixnTiyni–

≤i<jN

βniβnjTiyniTjynj

βnxnp+ N

i=

βnixnp+ N

i=

βni( –αni)xnTiyni

N

i=

βniαni

 –αniLαni

xnTixn–

N

i=

βnβnixnTiyni

=xnp–

N

i=

βniαni

 –αniLαni

xnTixn

+

N

i=

βni( –αniβn)xnTiyni

xnp–

N

i=

βniαni

 –αniLαni

xnTixn

xnp–

N i= βni

 –αLαxnTixn

xnp– (Na) –αLαxnTixn (.)

for alli= , , . . . ,Nand alln≥.

Note that  –αLα> , it follows from (.) that

unpxnp for alln≥. (.)

In particular, forx∗=PF(IμF)x∗∈F, we have

(7)

From Lemmas ., . and (.), we can prove that{xn}is bounded. Indeed, we have

xn+x∗=P

(IλnμF)un

x∗=P

(IλnμF)un

Px

≤(IλnμF)unx

=(IλnμF)un– (IλnμF)x∗–λnμFx

=(IλnμF)un– (IλnμF)x∗+λnμFx

≤( –τ λn)unx∗+μλnFx

≤( –τ λn)unx∗+τ λn

μFx

τ

≤( –τ λn)xnx∗+τ λn

μFx

τ

≤maxxx∗,μFx

τ

:=M

for all n≥, and therefore {xn}is bounded; consequently, {yni}, {un}and{Fun} are all bounded.

We next show thatxnx∗(n→ ∞).

By virtue of Lemmas .-., (.) and (.), we have that

xn+x∗

=P

(IλnμF)un

x∗≤(IλnμF)unx∗ 

=(IλnμF)un– (IλnμF)x∗–λnμFx∗ 

=(IλnμF)un– (IλnμF)x∗ 

+λnμFx∗

+ μλn

Fx∗, (IλnμF)un– (IλnμF)x

≤( –τ λn)unx∗+λFx∗ 

+ μλn

Fx∗,x∗–un+ μλnFx∗,FunFx

= ( –τ λn)xnx∗– (Na)

 –αLαxnTixn

+ μλn

Fx∗,x∗–un+ μλnFx∗,FunλnμFx∗

≤( –τ λn)xnx∗ 

– ( –τ λn)CxnTixn

+ μλn

Fx∗,x∗–un+ μFxλnFun

≤( –τ λn)xnx∗ 

– ( –τ λn)CxnTixn

+ μλn

Fx∗,x∗–un

+Cλn (.)

for i= , , . . . ,N and all n≥, whereC= (Na)( –αLα) and C = μFx∗ ×

sup{Fun:n≥}are fixed positive constants. Setsn=xnx∗. Then (.) reduces to

sn+sn+τ λnsn+ ( –τ λn)CxnTixn≤μλn

Fx∗,x∗–un+Cλn (.) fori= , , . . . ,Nand alln≥.

(8)

Case .{sn}is decreasing eventually, that is, there exists some integern≥ such that

sn+sn for allnn.

In this case, we havelimn→∞snexists.

Taking the limit in (.), noting thatλn→ asn→ ∞, we get that

xnTixn→ asn→ ∞ (.)

fori= , , . . . ,N. It follows from (.) that

xnyni→ asn→ ∞ (.)

fori= , , . . . ,N. SinceTiisLi-Lipschitz continuous, we have that

TixnTiyniLixnyni (.)

fori= , , . . . ,N. Consequently, from (.)∼(.) we get that

unxn=

N

i=

βni(xnTiyni)

N

i=

βnixnTiyni

N

i=

βnixnTixn+ N

i=

βniTixnTiyni

b N

i=

xnTixn+Lb N

i=

xnyni →

asn→ ∞, which derives that

lim

n→∞

Fx∗,x∗–un= lim

n→∞

Fx∗,x∗–xn. (.)

Assume that

lim

n→∞

Fx∗,x∗–xn= lim

k→∞

Fx∗,x∗–xnk. (.)

Without loss of generality, we can assume thatxnk → ˆxweakly ask→ ∞; thenxˆ=Tixˆ

fori= , , . . . ,N, by virtue of (.) and our assumption, and hencexˆ∈F. It follows from (.) and (.) that

lim

n→∞

Fx∗,x∗–un=Fx∗,x∗–xˆ≤. (.)

Settn=τ λnandσn=τμFx∗,x∗–un+ C

τ λn. Then (.) reduces to sn+≤( –tn)sn+tnσn,

(9)

Case .{sn}is not decreasing eventually, that is, there exists a subsequence{ni}of{n}

such thatsnisni+ for all i∈N. By virtue of Lemma ., we know that there exists a nondecreasing sequence{mk} ⊂Nsuch thatmk→ ∞,smksmk+andsksmk+ for all

sufficiently largek∈N. In this case, we havesmk+smk ≥ for large enoughk∈N. It

follows from (.) that

lim

k→∞(smk+smk) = , (.)

lim

k→∞(xmkTixmk) =  fori= , , . . . ,N, (.)

and

lim

k→∞smk≤μklim→∞

Fx∗,x∗–umk. (.)

By using a reasoning similar to case , we can obtain that limk→∞Fx∗,x∗–umk ≤,

and hencelimk→∞smk ≤ by (.),i.e.,smk → ask→ ∞, which derivessmk+→

ask→ ∞; consequently,sk→ ask→ ∞, sincesksmk+for sufficiently largek∈N.

This completes the proof.

Remark . When=H,Pin (.) can be dropped.

Corollary . Letbe a nonempty,closed and convex subset of a real Hilbert space H.

Let T,T, . . . ,TN : be N Li-Lipschitz continuous and strongly pseudocontractive with Lipschitz constants L,L, . . . ,LN,respectively.Let F,F and{xn} be the same as in Theorem..Then{xn}converges strongly to a unique solution xof(.),where x∗=PF(I

μF)x∗.

Proof By virtue of Lemma ., we know thatFix(Ti) are closed convex fori= , , . . . ,N

and henceF=Ni=Fix(Ti) is nonempty, closed and convex. Lemma . also ensures that

ITiare demiclosed at zero fori= , , . . . ,Nand hence the conclusion of Corollary .

follows exactly from Theorem ..

Corollary . Letbe a nonempty,closed and convex subset of a real Hilbert space H.

Let T,T, . . . ,TN:be N strict pseudocontractions,respectively.Let F,Fand{xn} be the same as in Theorem..Then{xn}converges strongly to a unique solution xof(.),

where x∗=PF(IμF)x∗.

Proof Since every strictly pseudocontractive mapping is Lipschitz continuous and

pseu-docontractive, we have the desired conclusion.

Corollary . Letbe a nonempty,closed and convex subset of a real Hilbert space H.

Let T,T, . . . ,TN:be N nonexpansive mappings,respectively.Let F,Fand{xn}be the same as in Theorem..Then{xn}converges strongly to a unique solution xof(.),

where x∗=PF(IμF)x∗.

Proof Since any nonexpansive mapping is -Lipschitz continuous and pseudocontractive,

(10)
[image:10.595.162.429.96.134.2]

Table 1 The results of the algorithm in [20]

n 0 500 1,000 5,000 10,000 12,000 14,000 17,000

x1 2 1.8602 1.8441 1.8074 1.7919 1.7878 1.7843 1.7800 x2 3 2.7902 2.7662 2.7112 2.6878 2.6817 2.6765 2.6700

Table 2 The results of algorithm (1.6)

n 0 500 1,000 5,000 10,000 12,000 14,000 17,000

x1 2 1.4957 1.4490 1.3332 1.2878 1.2761 1.2663 1.2541 x2 3 2.2435 2.1673 1.9998 1.9317 1.9142 1.8995 1.8812

Remark . WhenF=I, we have the following strong convergence theorem.

Corollary . Letbe a nonempty,closed and convex subset of a real Hilbert space H.

Let T,T, . . . ,TN:be N Li-Lipschitz continuous and quasi-pseudocontractive with Lipschitz constants L,L, . . . ,LN,respectively. LetF and ITi be the same as in The-orem .. Let {xn} be defined by (.) with F =I. Then {xn} converges strongly to the minimum-norm fixed point of the family{Ti}N

i=.

3 Numerical example

Example .[] Consider the following optimization problem: find an element

x∗∈C:ϕx∗=min

x(x), (.)

whereϕ(x) =  x

,x= (x

,x)∈R, a Euclid space, andC=C∩C, defined by

C=

(x,x)∈R:x– x+ ≤

,

C=(x,x)∈R: xx– ≥

(.) has a unique solution x∗= (, ) and F=∇ϕ=I is -Lipschitz continuous and  -strongly monotone. Starting with the point x= (x,x) = (, ),μ=

 ∈(, ) andλn= 

n+, setαni=  +

n+,βn=βn =

αni,βn=  –αnifori= , , Table  shows the results

of algorithm in [], we obtained the results of algorithm (.) in Table . Obviously, the results in Table  are better.

Example .[] LetH=Rwith absolute value norm. Let= [–, ] andT,T:

be defined by

Tx=

⎧ ⎨ ⎩

x+x, x[–, ],

x, x∈(, ],

and

Tx:=

⎧ ⎨ ⎩

x, x∈[–,],

[image:10.595.161.430.173.210.2]
(11)
[image:11.595.169.424.96.134.2]

Table 3 Values of{xn}with initial valuesx0= –1 andx0= 0.8

n 0 500 1,000 5,000 10,000 12,000 14,000 17,000

xn –1 –0.0739 –0.0447 –0.0127 –0.0071 –0.0060 –0.0053 –0.0045

xn 0.8 0.1130 0.0803 0.0361 0.0255 0.0233 0.0216 0.0196

ThenF=Fix(T)∩Fix(T) = [, ]∩[–,] = [,],T:is -Lipschitz continuous

and pseudocontractive andT:is -Lipschitz continuous and pseudocontractive.

We find the pointx∗∈Fwith the minimum-norm. To do so, setF=I. Now, takingλn=n+ ,αni= +n+ ,βn=βn=

αni,βn=  –αnifori= , , andμ= 

 ∈(, η

k) = (, ), we see that the conditions of Corollary . are fulfilled and algorithm (.) provides the data in Table . Our result is better.

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions All the authors contributed equally.

Author details

1Department of Mathematics, Shijiazhuang Mechanical Engineering College, Shijiazhuang, 050003, China.2Department

of Mathematics and Information, Hebei Normal University, Shijiazhuang, 050016, China.

Acknowledgements

This research was supported by the National Natural Science Foundation of China (11071053).

Received: 14 November 2013 Accepted: 8 May 2014 Published:30 May 2014

References

1. Kinderlehrer, D, Stampacchia, G: An Introduction to Variational Inequalities and Their Applications. Academic Press, New York (1980)

2. Glowinski, R: Numerical Methods for Nonlinear Variational Problems. Springer, New York (1984) 3. Zeidler, E: Nonlinear Functional Analysis Its Applications. Springer, New York (1985)

4. Goldstein, AA: Convex programming in Hilbert space. Bull. Am. Math. Soc.70, 709-710 (1964)

5. Kassay, G, Reich, S, Sabach, S: Iterative methods for solving systems of variational inequalities in reflexive Banach spaces. SIAM J. Optim.21, 1319-1344 (2011)

6. Censor, Y, Gibali, A, Reich, S, Sabach, S: Common solutions to variational inequalities. Set-Valued Var. Anal.20, 229-247 (2012)

7. Yamada, Y: The hybrid steepest-descent method for variational inequality problems over the intersection of the fixed point sets of nonexpansive mappings. In: Butnariu, D, Censor, Y, Reich, S (eds.) Inherently Parallel Algorithms in Feasibility and Optimization and Their Application, pp. 473-504. North-Holland, Amsterdam (2001)

8. Xu, HK, Kim, TH: Convergence of hybrid steepest-descent methods for variational inequalities. J. Optim. Theory Appl.

119, 185-201 (2003)

9. Zeng, LC, Wong, NC, Yao, JC: Convergence analysis of modified hybrid steepest-descent methods with variable parameters for variational inequalities. J. Optim. Theory Appl.132, 51-69 (2007)

10. Liu, X, Cui, Y: The common minimal-norm fixed point of a finite family of nonexpansive mappings. Nonlinear Anal. TMA73, 76-83 (2010)

11. Iemoto, S, Takahashi, W: Strong convergence theorems by a hybrid steepest descent method for countable nonexpansive mappings in Hilbert spaces. Sci. Math. Jpn.21, 557-570 (2008)

12. Albert, Y: Metric and generalized projection operators in Banach spaces: properties and applications. In: Kartsatos, AG (ed.) Theory and Applications of Nonlinear Operators of Accretive and Monotone Type. Lecture Notes in Pure and Appl. Math., vol. 178, pp. 15-50. Dekker, Amsterdam (1996)

13. Goebel, K, Reich, S: Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings. Dekker, New York (1984) 14. Marino, G, Xu, HK: Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces. J. Math.

Anal. Appl.329, 336-346 (2007)

15. Zegeye, H, Shahzad, N: Convergence of Mann’s type iteration method for generalized asymptotically nonexpansive mappings. Comput. Math. Appl.62, 4007-4014 (2011)

16. Zhou, HY, Su, YF: Strong convergence theorems for a family of quasi-pseudo-contractions in Hilbert spaces. Nonlinear Anal.71, 120-125 (2009)

17. Zhou, HY: Convergence theorems of fixed points for Lipschitz pseudo-contractions in Hilbert spaces. J. Math. Anal. Appl.343, 546-556 (2008)

18. Maingé, PE: Strong convergence of projected subgradient methods for nonsmooth and non-strictly convex minimization. Set-Valued Anal.16, 899-912 (2008)

(12)

20. Kim, JK, Buong, N: A new explicit iteration method for variational inequalities on the set of common fixed points for a finite family of nonexpansive mappings. J. Inequal. Appl.2013, 419 (2013)

21. Zegeye, H, Shahzad, N: An algorithm for a common fixed point of a family of pseudocontractive mappings. Fixed Point Theory Appl.2013, 234 (2013)

10.1186/1029-242X-2014-218

Figure

Table 2 The results of algorithm (1.6)
Table 3 Values of {xn} with initial values x0 = –1 and x0 = 0.8

References

Related documents

The pre- dicted key breaching parameters (i.e., final breach size, fail- ure time, and peak outflow rate) considering the variations in the soil erodibility along depth agree well

The aim of this study was to find methods which can be used to measure early damage to kidney function and find out how colic affect horses' kidneys by investigating the release

This prospective study aimed to evaluate the effect of HFD on anemia, and the potential of soluble transferrin receptor (sTfR) as a marker of iron status and erythropoiesis in

Abstract The purpose of the study is to estimate the curie-temperature depth and heat flow in the southern Bida basin, which is deduced from spectral analysis of aeromagnetic

The stage design strength ratios obtained at a stage period of 10 years according to Caltrans, AASHTO, and AI methods are only about 10, 12, and 16%, respectively, which represent

Notably, when 40 human colorectal tumors were classified into different clinically relevant molecular subtypes, high eNOS expression was found in the poor relapse-free and

Immunohistochemistry to assess the reactivity of a β Co- mAb GW-23B7 was performed on old 3 × Tg mice (&gt;19 months old) with extensive A β and tau pathology or on

Taking these limitations into account, the following con- clusions can be drawn: a 2-week exercise program with multiple short-bout exercise sessions per day is an innova- tive