• No results found

Iterative Algorithms for Finding Common Solutions to Variational Inclusion Equilibrium and Fixed Point Problems

N/A
N/A
Protected

Academic year: 2020

Share "Iterative Algorithms for Finding Common Solutions to Variational Inclusion Equilibrium and Fixed Point Problems"

Copied!
17
0
0

Loading.... (view fulltext now)

Full text

(1)

Volume 2011, Article ID 915629,17pages doi:10.1155/2011/915629

Research Article

Iterative Algorithms for Finding Common

Solutions to Variational Inclusion Equilibrium and

Fixed Point Problems

J. F. Tan and S. S. Chang

Department of Mathematics, Yibin University, Yibin, Sichuan 644007, China

Correspondence should be addressed to S. S. Chang,[email protected]

Received 30 October 2010; Accepted 9 November 2010

Academic Editor: Qamrul Hasan Ansari

Copyrightq2011 J. F. Tan and S. S. Chang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

The main purpose of this paper is to introduce an explicit iterative algorithm to study the existence problem and the approximation problem of solution to the quadratic minimization problem. Under suitable conditions, some strong convergence theorems for a family of nonexpansive mappings are proved. The results presented in the paper improve and extend the corresponding results announced by some authors.

1. Introduction

Throughout this paper, we assume thatHis a real Hilbert space with inner product·,·and norm · ,Cis a nonempty closed convex subset ofH, andFT {xH :Tx x}is the set of fixed points of mappingT.

A mappingS:CCis called nonexpansive if

SxSyxy, x, yC. 1.1

Let A : HH be a single-valued nonlenear mapping andM : H → 2H be a multivalued mapping. The so-called quasivariational inclusion problemsee1–3is to find

uHsuch that

θAu Mu. 1.2

(2)

Special Cases

IIfM∂φ:H → 2H, whereφ:H → Ê∪{∞}is a proper convex lower semi-continuous

function and∂φis the subdifferential ofφ, then the quasivariational inclusion problem1.2 is equivalent to findinguHsuch that

Au, yuφyφu≥0,yH, 1.3

which is called the mixed quasivariational inequalitysee4.

IIIfM ∂δC, whereCis a nonempty closed convex subset of H andδC : H

0,∞is the indicator function ofC, that is,

δCx

⎧ ⎨ ⎩

0, xC,

, x /C, 1.4

then the quasivariational inclusion problem1.2is equivalent to findinguCsuch that

Au, vu ≥0,vC. 1.5

This problem is called the Hartman-Stampacchia variational inequalitysee5. The set of solutions to variational inequality1.5is denoted by VIA, C.

LetB : CH be a nonlinear mapping andF : C×C → Ê be a bifunction. The

so-called generalized equilibrium problem is to find a pointuCsuch that

Fu, yBu, yu ≥0,yC. 1.6

The set of solutions to1.6is denoted by GEPsee5,6. IfB0, then1.6reduces to the following equilibrium problem: to finduCsuch that

Fu, y≥0,yC. 1.7

The set of solutions to1.7is denoted by EP.

Iterative methods for nonexpansive mappings and equilibrium problems have been applied to solve convex minimization problemssee7–9. A typical problem is to minimize a quadratic function over the set of the fixed points of a nonexpansive mapping on a real Hilbert spaceH:

min x∈F

1 2x

2, 1.8

whereFis the fixed point set of a nonexpansive mappingTonH.

In 2010, Zhang et al.see10proposed the following iteration method for variational inclusion problem1.5and equilibrium problem1.6in a Hilbert spaceH:

(3)

Under suitable conditions, they proved the sequence {xn} generated by 1.9 converges strongly to the fixed pointx∗, which solves the quadratic minimization problem1.8.

Motivated and inspired by the researches going on in this direction, especially inspired by Zhang et al.10, the purpose of this paper is to introduce an explicit iterative algorithm to studying the existence problem and the approximation problem of the solution to the quadratic minimization problem 1.8 and prove some strong convergence theorems for a family of nonexpansive mappings in the setting of Hilbert spaces.

2. Preliminaries

LetHbe a real Hilbert space, andCbe a nonempty closed convex subset ofH. For anyxH, there exists a unique nearest point inC, denoted byPCx, such that

xPCxxy,yC. 2.1

Such a mappingPC fromHontoCis called the metric projection. It is well-known that the metric projectionPC :HCis nonexpansive.

In the sequel, we usexn xandxnxto denote the weak convergence and the strong convergence of the sequence{xn}, respectively.

Definition 2.1. A mappingA:HHis calledα-inverse strongly monotone if there exists anα >0 such that

AxAy, xyαAxAy2, x, yH. 2.2

A multivalued mappingM:H → 2His called monotone if∀x, yH, uMx, vMy,

uv, xy ≥0. 2.3

A multivalued mappingM:H → 2His called maximal monotone if it is monotone and for anyx, uH×H, when

uv, xy ≥0 for everyy, v∈GraphM, 2.4

thenuMx.

Proposition 2.2see11. LetA: HHbe anα-inverse strongly monotone mapping. Then, the following statements hold:

iAis an1/α-Lipschitz continuous and monotone mapping;

(4)

Lemma 2.3see12. LetXbe a strictly convex Banach space,Cbe a closed convex subset ofX, and{Tn :CC}be a sequence of nonexpansive mappings. Supposen1FTn/. Let{λn}be a

sequence of positive numbers withΣ∞n1λn1. Then the mappingS:CCdefined by

Sx Σ∞

n1λnTnx, xC 2.5

is well defined. And it is nonexpansive and

FS

n1

FTn. 2.6

Definition 2.4. Let H be a Hilbert space and M : H → 2H be a multivalued maximal monotone mapping. Then, the single-valued mappingJM,λ:HHdefined by

JM,λu IλM−1u, uH 2.7

is called theresolvent operator associated withM, whereλis any positive number andIis the identity mapping.

Proposition 2.5see11. iThe resolvent operatorJM,λassociated withMis single-valued and

nonexpansive for allλ >0, that is,

JM,λxJM,λ

yxy,x, yH,λ >0. 2.8

iiThe resolvent operatorJM,λis 1-inverse strongly monotone, that is,

JM,λxJM,λy2xy, J

M,λxJM,λy ,x, yH. 2.9

Definition 2.6. A single-valued mappingA:HHis said to be hemicontinuous if for any

x, y, zH, functiontAxty, zis continuous at 0.

It is well-known that every continuous mapping must be hemicontinuous.

Lemma 2.7see13. Let{xn}and{yn}be bounded sequences in a Banach spaceX. Let{βn}be a

sequence in0,1with

0<lim inf

n→ ∞ βn ≤lim supn→ ∞ βn<1. 2.10

Suppose that

xn1

1−βnynβnxn,n≥0,

lim sup n→ ∞

yn1ynxn1xn

(5)

Then,

lim

n→ ∞ynxn0. 2.12

Lemma 2.8see14. LetXbe a real Banach space,Xbe the dual space ofX,T :X → 2Xbe a maximal monotone mapping, andP :XXbe a hemicontinuous bound monotone mapping with

DP X. Then, the mappingSTP :X → 2Xis a maximal monotone mapping.

Lemma 2.9see15. LetXbe a uniformly convex Banach space, letCbe a nonempty closed convex subset ofX, andT :CCbe a nonexpansive mapping with a fixed point. Then,ITis demiclosed in the sense that if{xn}is a sequence inCsatisfying

xn x, ITn−→0, 2.13

then

ITx0. 2.14

Throughout this paper, we assume that the bifunction F : C×C → Ê satisfies the

following conditions:

H1Fx, x 0 for allxC;

H2Fis monotone, that is,

Fx, yFy, x≤0,x, yC, 2.15

H3for eachx, y, zC,

lim t↓0 F

tz 1−tx, yFx, y, 2.16

H4for eachxC,yFx, yis convex and lower semi-continuous.

Lemma 2.10see16. LetHbe a real Hilbert space,Cbe a nonempty closed convex subset ofH, andF:C×C → Êbe a bifunction satisfying the conditions (H1)–(H4). Letμ >0andxH. Then,

there exists a pointzCsuch that

Fz, y 1

μ

yz, zx ≥0,yC. 2.17

Moreover, ifTμ:HCis a mapping defined by

Tμx

zC:Fz, y1

μ

yz, zx ≥0,yC

, xH, 2.18

(6)

iTμis single-valued and firmly nonexpansive, that is, for anyx, yH,

TμxTμy2T

μxTμy, xy , 2.19

iiEPis closed and convex, andEPFTμ.

Lemma 2.11. i see11uHis a solution of variational inclusion1.2if and only if

uJM,λuλAu,λ >0, 2.20

that is,

VIH, A, M FJM,λuλAu,λ >0. 2.21

ii see10uCis a solution of generalized equilibrium problem1.6if and only if

uTμuμBu,μ >0, 2.22

that is,

GEPFTμuμBu,μ >0. 2.23

iii see10LetA:HHbe anα-inverse strongly monotone mapping andB:CH

be aβ-inverse strongly monotone mapping. Ifλ ∈ 0,2αandμ ∈ 0,2β, thenVIH, A, Mis a closed convex subset inHand GEP is a closed convex subset inC.

Lemma 2.12see17. Assume that{an}is a sequence of nonnegative real numbers such that

an1≤1−γnanδn,n≥1, 2.24

where{γn}is a sequence in0,1and{δn}is a sequence such that:

i∞n1γn;

iilim supn→ ∞δnn≤0orn1|δn|<.

Then,limn→ ∞an0.

3. Main Results

Theorem 3.1. LetHbe a real Hilbert space,Cbe a nonempty closed convex subset ofH,A:HH

(7)

mapping. LetM : H → 2H be a maximal monotone mapping,{Tn : CC}be a sequence of

nonexpansive mappings withn1FTn/,S : CCbe the nonexpansive mapping defined by

2.5, andF:C×C → Êbe a bifunction satisfying conditions (H1)–(H4). Let{xn}be the sequence

defined by

xn1αnxn 1−αn

SPC1−tnJM,λIλATμIμBxn, 3.1

where the mappingTμ:HCis defined by2.18, andλ, μare two constants withλ∈0,2α, μ

0,2β, and

tn∈0,1, tn−→0n−→ ∞,

n1

tn, 0< a < αn< b <1. 3.2

If

Ω:FS∩VIH, A, M∩GEP/, 3.3

whereVIH, A, Mand GEP is the set of solutions of variational inclusion1.2and generalized equilibrium problem1.6, respectively, then the sequence{xn}defined by3.1converges strongly to

xΩ, which is the unique solution of the following quadratic minimization problem:

x2min

x∈Ωx 2.

3.4

Proof. We divide the proof ofTheorem 3.1into four steps.

Step 1The sequence{xn}is bounded. Set

unTμIμBxn, ynJM,λIλAun, znSPC1−tnyn. 3.5

Takingz∈Ω, then it follows fromLemma 2.11that

zTμzμBzJM,λzλAz SPCz. 3.6

(8)

unz2 TμIμBxnTμzμBz2

IμBxnzμBz2

xnz2μμ−2βBxnBz2,

3.7

ynz2 J

M,λIλAunJM,λzλAz2

IλAunzλAz2

unz2λλ−2αAunAz2

xnz2λλ−2αAunAz2μμ−2βBxnBz2.

3.8

This implies that

ynzunzxnz. 3.9

It follows from3.1and3.9that

xn1−zαnxn 1−αnSPC1−tnynz

αnxnz 1−αnSPC1−tnynSPCz

αnxnz 1−αnSPC1−tnynSPCz

αnxnz 1−αn1−tnynz

αnxnz 1−αn1−tnynztnz

αnxnz 1−αn1−tnxnztnz

≤1−tn1−αnxnztn1−αnz

≤max{xnz,z}

≤max{xn−1−z,z}

≤ · · · ≤max{x1z,z}M,

3.10

whereMmax{x1z,z}. This shows that{xn}is bounded. Hence, it follows from3.9 that the sequence{un}and{yn}are also bounded.

It follows from3.5,3.6, and3.9that

znzSPC1−tnynSPCz≤1−tnynz

≤1−tnynztnz ≤1−tnxnztnzM.

3.11

(9)

Step 2. Now, we prove that

lim

n→ ∞xnunnlim→ ∞unynnlim→ ∞xnyn0, lim

n→ ∞xnSxn0.

3.12

SinceSPCis nonexpansive, from3.5and3.9, we have that

yn1ynun1unxn1xn, 3.13

zn1−znSPC1−tn1yn1

SPC1−tnyn

≤1−tn1yn1−1−tnyn

1−tn1

yn1−yn 1−tn1−1−tnyn

≤1−tn1yn1−yn|tn1−tn|yn

yn1−yn|tn1−tn|yn

un1−un|tn1−tn|yn

xn1−xn|tn1−tn|yn.

3.14

Letn → ∞in3.14, in view of conditiontn → 0n → ∞, we have

lim

n→ ∞zn1−znxn1−xn 0. 3.15

By virtue ofLemma 2.7, we have

lim

n→ ∞xnzn0. 3.16

This implies that

lim

(10)

We derive from3.17that

lim n→ ∞

xnz2− xn1−z2

lim n→ ∞

xnxn122xnxn1, xn1−z

≤ lim n→ ∞

xnxn122xnxn1 · xn1−z

0.

3.18

From3.1and3.8, we have

xn1−z2≤

αnxnz 1−αn1−tnynz2

αnxnz2 1−αn1−tnynztnz2

αnxnz2 1−αn

1−tn2ynz2−2tn1−tnz, ynz t2nz2

αnxnz2 1−αnynz2tnM1

αnxnz2 1−αn

×xnz2λλ−2αAunAz2μμ−2βBxnBz2tnM1

xnz2 1−αn

λλ−2αAunAz2μμ−2βBxnBz2tnM1

,

3.19

where

M1sup n

z22λu

nynμxnyn<, 3.20

that is,

1−αn

λ2αλAunAz2μ2βμBxnBz2

xnz2− xn1−z2 1−αntnM1.

3.21

Letn → ∞, noting the assumptions thatλ ∈ 0,2α,μ ∈ 0,2β, from3.2and 3.18, we have

lim

(11)

By virtue ofLemma 2.10iand3.1, we have

unz2TμxnμBxnTμzμBz2

xnμBxnzμBz, unz

1

2

xnμBxnzμBz2unz2

xnzμBxnBzunz2

≤ 1

2

xnz2unz2−xnunμBxnBz2

1

2

xnz2unz2− xnun2

2μxnun, BxnBzμ2BxnBz2

.

3.23

Simplifying it, we have

unz2≤ xnz2− xnun22μxnun, BxnBzμ2BxnBz2

xnz2− xnun22μxnun · BxnBz

xnz2− xnun2M1BxnBz.

3.24

Similarly, in view ofProposition 2.5iiand3.1, we have

ynz2J

M,λunλAunJM,λzλAz2

unλAunzλAz, ynz

1

2

unλAunzλAz2ynz2

unλAunzλAzynz2

≤ 1

2

unz2ynz2−unynλAunAz2

1

2

unz2ynz2−unyn2

2λunyn, AunAzλ2AunAz2

.

(12)

Simplifying it, from3.24, we have

ynz2u

nz2−unyn22λunyn, AunAzλ2AunAz2

unz2−unyn22λunyn· AunAz

xnz2− xnun2M1BxnBzunyn2

M1AunAz.

3.26

From3.19and3.26, we have

xn1−z2≤αnxnz2 1−αnynz2tnM1

αnxnz2 1−αn

×xnz2− xnun2−unyn2M1BxnBzAunAztn

xnz2 1−αn

×M1BxnBzAunAztnxnun2−unyn2

.

3.27

Letn → ∞nd in view of3.18and3.22, we have

lim n→ ∞

xnun2unyn2

0. 3.28

This shows that

lim

n→ ∞xnunnlim→ ∞unyn0, lim

n→ ∞xnyn0.

3.29

Then, we have

xn1−Sxn1xn1−SxnSxnSxn1 ≤ xn1−SxnSxnSxn1

SPC1−tnynSPCxnSxnSxn1 ≤1−tnynxntnxnxnxn1 −→0n−→ ∞.

(13)

Step 3sequence{xn}converges strongly tox∗ ∈Ω. Because{xn}is bounded, without loss of generality, we can assume thatxn x∗ ∈H. In view of3.12, it yields thatun x∗and

yn x∗. FromLemma 2.9and3.30, we know thatx∗ ∈FS. Next, we prove thatx∗∈GEP∩VIH, A, M.

SinceunTμxnμBxn, we have

Fun, y 1μyun, unxnμBxn ≥0,yC. 3.31

It follows from conditionH2that

1

μ

yun, unxnμBxnFy, un,yC. 3.32

Therefore,

yun,unμxn Bxn

Fy, un,yC. 3.33

For anyt∈0,1andyC, thenytty 1−tx∗∈C. From3.33, we have

ytun, Bytytun, Byt

ytun, unμxn Bxn

Fyt, un

ytum, BytBum ytun, BunBxn

ytun,unμxn

Fyt, un.

3.34

SinceBisβ-inverse strongly monotone, fromProposition 2.2iand3.12, we have

BunBxnβ1unxn −→0 n−→ ∞,

ytun, BytBunβBytBun2≥0.

3.35

Letn → ∞in3.34, in view of conditionH4andun x∗, we have

ytx, BytFyt, x. 3.36

It follows from conditionsH1,H4and3.36that

0Fyt, yttFyt, y 1−tFyt, x

tFyt, y 1−tytx, Byt

tFyt, y 1−ttyx, Byt ,

(14)

that is,

0≤Fyt, y 1−tyx, Byt . 3.38

Lettto 0 in3.38, we have

Fx, yyx, Bx0, yC. 3.39

This shows thatx∗∈GEP.

Step 4now, we prove thatx∗ ∈VIH, A, M. SinceAisα-inverse strongly monotone, from Proposition 2.2i, we know thatAis an 1-Lipschitz continuous and monotone mapping andDA H, whereDAis the domain ofA. It follows fromLemma 2.8thatMAis maximal monotone. Letv, f∈GraphMA, that is,fAvMv. SinceynJM,λun

λAun, we haveunλAunIλMyn, that is, 1/λunynλAunMyn. By virtue of the maximal monotonicity ofM, we have

vyn, fAv−1λunynλAun≥0. 3.40

Therefore we have

vyn, f

vyn, Avλ1unynλAun

vyn, AvAynAynAun 1λunyn.

3.41

SinceAis monotone, this implies that

vyn, f ≥0vyn, AynAun

vyn,λ1unyn.

3.42

Since

unyn−→0, AunAyn−→0, yn x, n−→ ∞, 3.43

from3.42, we have

lim

n→ ∞vyn, f

vx, f 0. 3.44

(15)

Summing up the above arguments, we have proved that

xΩ:FSVIH, M, AGEP. 3.45

On the other hand, for anyz∈Ω, we have

znz2SPC1−tnynSPCz2

≤1−tnynz2ynztnyn2

ynz2−2tnyn, ynzt2nyn2

ynz2−2tnynz, ynz −2tnz, ynzt2nyn2

1−2tnynz22tnz, zynt2nyn2

≤1−2tnxnz22tnz, zynt2nyn2,

3.46

and so we have

xn1−z2αnxnz 1−αnznz2

αnxnz2 1−αn

1−2tnxnz22tnz, zyn t2nyn2

1−2tn1−αnxnz221−αntnz, zyn t2nyn2

≤1−2tn1−bxnz221−αntnz, zyn t2nyn2.

3.47

Putzx∗in3.47, we have

xn1−x∗2≤

1−γnxnx∗2δn, 3.48

whereγn 2tn1−bandδn 21−αntnx, x∗−yntn2yn2. Sinceyn x∗, it is easy to see thatn1γn∞and limn→ ∞δn/γn 0. ByLemma 2.12, we conclude thatxnx∗as

n → ∞, wherex∗is the unique solution of the following quadratic minimization problem:

x2min

x∈Ωx 2.

3.49

This completes the proof ofTheorem 3.1.

In Theorem 3.1, if T Tnn ≥ 1, then the following corollary can be obtained immediately.

Corollary 3.2. LetHbe a real Hilbert space,Cbe a nonempty closed convex subset ofH,A:H

(16)

mappings withFT/. LetF : C×C → Ê be a bifunction satisfying conditions (H1)–(H4). Let

{xn}be the sequence defined by

xn1 αnxn 1−αn

TPC1−tnJM,λIλATμIμBxn 3.50

where the mappingTμ:HCis defined by2.18, andλ, μare two constants withλ∈0,2α, μ

0,2β, and

tn∈0,1, tn−→0n−→ ∞,

n1

tn, 0< a < αn< b <1. 3.51

If

Ω1:FT∩VIH, A, M∩GEP/, 3.52

whereVIH, A, Mand GEP are the sets of solutions of variational inclusion1.2and generalized equilibrium problem1.6, then the sequence{xn}defined by3.50converges strongly tox∗ ∈Ω1,

which is the unique solution of the following quadratic minimization problem:

x2min

x∈Ω1 x2.

3.53

InTheorem 3.1, ifM ∂δC : H → 2H, whereδC : H → 0,∞is the indicator function of C, then the variational inclusion problem 1.2 is equivalent to variational inequality 1.5, that is, to find uC such that Au, vu ≥ 0, for all vC. Since

M∂δC, JM,λPC. Consequently, we have the following corollary.

Corollary 3.3. LetHbe a real Hilbert space,Cbe a nonempty closed convex subset ofH,A:H

Hbe anα-inverse strongly monotone mapping andB: CHbe aβ-inverse strongly monotone mapping. LetM∂δC :H → 2Hand{T :CC}be a nonexpansive mappings withFT/.

LetF:C×C → Êbe a bifunction satisfying conditions (H1)–(H4). Let{xn}be the sequence defined

by

xn1 αnxn 1−αn

T1−tnPCIλATμIμBxn, 3.54

where the mappingTμ:HCis defined by2.18, andλ, μare two constants withλ∈0,2α, μ

0,2β, and

tn∈0,1, tn−→0n−→ ∞,

n1

tn, 0< a < αn< b <1. 3.55

If

(17)

whereVIA, C and GEP are the sets of solutions of variational inclusion 1.5 and generalized equilibrium problem1.6, then the sequence{xn}defined by3.54converges strongly tox∗ ∈Ω2,

which is the unique solution of the following quadratic minimization problem:

x2min

x∈Ω2 x2.

3.57

References

1 M. A. Noor and K. I. Noor, “Sensitivity analysis for quasi-variational inclusions,” Journal of Mathematical Analysis and Applications, vol. 236, no. 2, pp. 290–299, 1999.

2 S. S. Chang, “Set-valued variational inclusions in Banach spaces,”Journal of Mathematical Analysis and Applications, vol. 248, no. 2, pp. 438–454, 2000.

3 S.-S. Chang, “Existence and approximation of solutions for set-valued variational inclusions in Banach space,”Nonlinear Analysis. Theory, Methods & Applications, vol. 47, no. 1, pp. 583–594, 2001. 4 M. A. Noor, “Generalized set-valued variational inclusions and resolvent equations,” Journal of

Mathematical Analysis and Applications, vol. 228, no. 1, pp. 206–220, 1998.

5 E. Blum and W. Oettli, “From optimization and variational inequalities to equilibrium problems,”The Mathematics Student, vol. 63, no. 1–4, pp. 123–145, 1994.

6 F. Tang, “Strong convergence theorem for a generalized equilibrium problems and a family of infinitely relatively nonexpansive mappings in a Banach space,”Acta Analysis Functionalis Applicata, vol. 12, no. 3, pp. 259–265, 2010.

7 L.-C. Ceng and J.-C. Yao, “A hybrid iterative scheme for mixed equilibrium problems and fixed point problems,”Journal of Computational and Applied Mathematics, vol. 214, no. 1, pp. 186–201, 2008. 8 S. Li, L. Li, and Y. Su, “General iterative methods for a one-parameter nonexpansive semigroup in

Hilbert space,”Nonlinear Analysis. Theory, Methods & Applications, vol. 70, no. 9, pp. 3065–3071, 2009. 9 V. Colao, G. Marino, and H.-K. Xu, “An iterative method for finding common solutions of equilibrium

and fixed point problems,”Journal of Mathematical Analysis and Applications, vol. 344, no. 1, pp. 340– 352, 2008.

10 S.-S. Zhang, H.-W. Lee, and C.-K. Chan, “Quadratic minimization for equilibrium problem variational inclusion and fixed point problem,”Applied Mathematics and Mechanics, vol. 31, no. 7, pp. 917–928, 2010.

11 S.-S. Zhang, J. H. W. Lee, and C. K. Chan, “Algorithms of common solutions to quasi variational inclusion and fixed point problems,”Applied Mathematics and Mechanics, vol. 29, no. 5, pp. 571–581, 2008.

12 R. E. Bruck Jr., “Properties of fixed-point sets of nonexpansive mappings in Banach spaces,”

Transactions of the American Mathematical Society, vol. 179, pp. 251–262, 1973.

13 T. Suzuki, “Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces,”Fixed Point Theory and Applications, no. 1, pp. 103–123, 2005.

14 D. Pascali,Nonlinear Mappings of Monotone Type, Sijthoffand NoordhoffInternational Publishers, The Netherlands, 1978.

15 K. Goebel and W. A. Kirk,Topics in Metric Fixed Point Theory, vol. 28, Cambridge University Press, Cambridge, UK, 1990.

16 P. L. Combettes and S. A. Hirstoaga, “Equilibrium programming in Hilbert spaces,” Journal of Nonlinear and Convex Analysis, vol. 6, no. 1, pp. 117–136, 2005.

References

Related documents

Table A-5: Mortality hazard ratios (ages 18–64) for first- and second-generation immigrant subgroups by region of origin, France, 1999–2010; native- born individuals with ‘one

II lists these datasets with their number of attributes, number of records, number of discovered FDs, and number of exemplars selected according to the three selection strategies

To the extent real information processes are inconsistent, 4 is required, and if the description is a logical one (in the extended sense of logic of Logic in Reality,

As life sci- ence research develops into the &#34;Post-genome&#34; era, a broad variety of Omics research repre- sented by Genomics was carried out, new large

Results: We compared homoeolog (genes duplicated by polyploidy) contributions to the transcriptome of a natural allopolyploid and a synthetic interspecific F 1 hybrid, both

There is a striking correlation in the specificity and expression levels of a set of up-regulated SAGE tags (120 tags, Fig. 4B) specific for the Day-6 post-sporozoite populations

This preliminary clinical study aimed to examine whether next‑generation sequencing (NGS) targeting 16S rDNA, which was PCR‑ amplified directly from the tip of a central

Studies 3000 and 3001 were multicenter, randomized, double-blind, placebo-controlled, 18-month clinical trials in which investigators evaluated the efficacy and safety of