• No results found

Inertial algorithm for approximating a common fixed point for a countable family of relatively nonexpansive maps

N/A
N/A
Protected

Academic year: 2020

Share "Inertial algorithm for approximating a common fixed point for a countable family of relatively nonexpansive maps"

Copied!
9
0
0

Loading.... (view fulltext now)

Full text

(1)

R E S E A R C H

Open Access

Inertial algorithm for approximating

a common fixed point for a countable

family of relatively nonexpansive maps

C.E. Chidume

*

, S.I. Ikechukwu and A. Adamu

*Correspondence:

[email protected] African University of Science and Technology, Abuja, Nigeria

Abstract

In this paper, we study an inertial algorithm for approximating a common fixed point for a countable family of relatively nonexpansive maps in a uniformly convex and uniformly smooth real Banach space. We prove a strong convergence theorem. This theorem is an improvement of the result of Matsushita and Takahashi (J. Approx. Theory 134:257–266, 2005) and the result of Donget al.(Optim. Lett. 12:87–102, 2018). Finally, we give some applications of our theorem.

MSC: 47H09; 47H05; 47J25; 47J05

Keywords: Inertial algorithm; Relatively nonexpansive maps; Generalised projection; Strong convergence

1 Introduction

An inertial-type algorithm was first proposed by Polyak [3] as an acceleration process in solving a smooth convex minimisation problem. An inertial-type algorithm is a two-step iterative method in which the next iterate is defined by making use of the previous two iterates. It is well known that incorporating an inertial term in an algorithm speeds up or accelerates the rate of convergence of the sequence generated by the algorithm. Conse-quently, a lot of research interest is now devoted to the inertial-type algorithm (see e.g. [2, 4, 5] and the references contained in them).

LetEbe a real Banach space andE∗be its dual space. LetCbe a nonempty, closed and convex subset ofE, and letTbe a map fromCinto itself. The fixed point set ofTis defined as follows:F(T) :={xC:Tx=x}. The normalised duality mapJfromEto 2Eis defined

byJx={x∗∈E∗:x,x∗=x2=x∗2,∀xE}, where·,·denotes the duality pairing. The following properties of the normalised duality map will be needed in the sequel (see e.g. Ibaraki and Takahashi [6]):

1. IfEis a reflexive, strictly convex and smooth real Banach space, thenJis surjective, injective and single-valued. IfEis uniformly smooth, thenJis uniformly continuous on bounded sets.

2. In a real Hilbert spaceH, the duality mapJis the identity map onH.

The Lyapunov functionalψ:E×E→[0,∞) is defined byψ(x,y) =x2– 2x,Jy+y2, ∀x,yE, whereJis the normalised duality map fromEtoE∗. It was first introduced by

(2)

Alber and has been extensively studied by many authors (see e.g. Alber [7], Chidumeet al. [8, 9], Kamimura and Takahashi [10], Reich [11, 12], Takahashi and Zembayashi [13], Zegeye [14] and a host of other authors). It is easy to see from the definition ofψthat, in a real Hilbert spaceH,ψ(x,y) =xy2,∀x,yH. Furthermore, for anyx,y,zEand α∈(0, 1), we have the following properties:

(N0) (xy)2≤ψ(x,y)≤(x+y)2,

(N1) ψ(x,y) =ψ(x,z) +ψ(z,y) + 2zx,JyJz,

(N2) ψ(x,J–1(αJy+ (1 –α)Jz))≤αψ(x,y) + (1 –α)ψ(x,z),

(N3) ψ(x,y)≤ xJxJy+yxy.

Let E be a smooth, strictly convex and reflexive real Banach space, and let CE be nonempty, closed and convex. The mapC:ECdefined byCx:=u0∈Csuch that

ψ(u0,x) =arg infy(y,x) is called thegeneralised projection, wherearg infy(y,x) is

the set of all the minimisers ofψ. We remark that in a real Hilbert spaceH, the gener-alised projectionCcoincides with the metric projectionPCfromHontoC.

A pointx∗∈Cis called anasymptotic fixed pointofTif there exists a sequence{un} ⊆C

such thatunx∗andunTun →0, asn→ ∞(see e.g. Changet al. [15]). Here we shall denote the set of asymptotic fixed points ofTbyF(T).

A real Banach spaceEis called anOpialspace (see e.g. Chidume [16]) if whenever{un}

is a sequence inEsuch thatunxE, then

lim inf

n→∞ u

nx<lim inf n→∞ u

ny, yE,y=x.

Definition 1.1 A mapT:CCis said to berelatively nonexpansiveif:

(i) F(T) =F(T)=∅, and

(ii) ψ(p,Tx)≤ψ(p,x),∀xC,pF(T).

Remark1 Every real Hilbert space is an Opial space, and so if{un}is a sequence inHsuch

thatunxandunTun0, it is well known that ifTis nonexpansive, thenTx=x∗ andF(T) =F(T). Moreover, sinceψ(x,y) =xy2,∀x,yH, it follows thatTis relatively nonexpansive.

LetB:={xE:x= 1}be the unit sphere ofE. A Banach spaceEis said to bestrictly convex if, for all x,yB, x=yx+2y < 1. The space E is said to have the Kadec– Kleeproperty if whenever{un} is a sequence inE that converges weakly tou0∈Eand unu0, asn→ ∞, then{un}converges strongly tou0. A spaceEis said to be

uni-formly convexif, for each∈(0, 2], there existsδ> 0 such thatxyx+2y< 1 –δ, ∀x,yB. It is well known that a uniformly convex real Banach space is reflexive, strictly convex and has the Kadec–Klee property [17, 18].

A functionδ: (0, 2]→[0, 1] called themodulus of convexityofEis defined as follows: δ() :=inf{1 –x2+y:x,yE,x=y= 1,xy}. It follows thatE is uniformly convex ifδ() > 0,∀∈(0, 2]. A real Banach spaceEis said to besmoothif the limit

lim

t→0

x+tyx

t exists for allx,yB. (1.1)

It is said to beuniformly smoothif the limit in (1.1) above is attained uniformly, for all

(3)

In 2003, Nakajo and Takahashi [19] studied the following CQiterative algorithm for approximating a fixed point of a nonexpansive map in a real Hilbert space:u0Cand

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

vn=α

nun+ (1 –αn)Tun,

Cn={zC:vnzunz},

Qn={zC:unz,unu0 ≤0},

un+1=P

Cn∩Qnu

0, n1,

(1.2)

whereαn∈[0, 1],Cis a nonempty, closed and convex subset of a real Hilbert space,Tis

a nonexpansive map fromCinto itself andPCn∩Qn is the metric projection fromConto

CnQn. They proved that the sequence generated by algorithm (1.2) converges strongly

to a fixed point ofT.

In 2005, Matsushita and Takahashi [1] studied the following iterative algorithm for ap-proximating a fixed point of a relatively nonexpansive map in a uniformly convex and uniformly smooth real Banach space:u0Cand

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

vn=J–1(α

nJun+ (1 –αn)JTun),

Cn={zC:ψ(z,vn)≤ψ(z,un)},

Qn={zC:unz,JunJu0 ≤0},

un+1=Cn∩Qnu0, n≥1.

(1.3)

They proved that the sequence{un}generated by algorithm (1.3) converges strongly to a

fixed point ofT.

Recently, Donget al. [2] studied the followinginertialCQ algorithm for nonexpansive maps in areal Hilbert space. They proved the following theorem:

Theorem 1.2(Donget al., [2, Theorem 4.1]) Let T:HH be a nonexpansive map such that F(T)=∅.Let{αn} ⊂[α1,α2],α1∈(–∞, 0],α2∈[0,∞),{βn} ⊂[β, 1],β∈(0, 1].Set

u0,u1H arbitrarily.Define a sequence{un}by the following algorithm:

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

wn=un+α

n(unun–1),

vn= (1 –βn)wn+βnT(wn),

Cn={zH:vnzwnz},

Qn={zH:unz,unu0 ≤0},

un+1=P

Cn∩Qnu0, n≥0.

(1.4)

(4)

2 Preliminaries

Lemma 2.1(Alber [7]) Let C be a nonempty closed and convex subset of a strictly convex and reflexive real Banach space E.If xE and u0∈C,then

u0=Cx ⇐⇒

u0–y,Ju0–Jx ≤0, ∀yC, and

ψ(y,Cx) +ψ(Cx,x)≤ψ(y,x), ∀yC,xE.

(2.1)

Lemma 2.2(Kamimura and Takahashi [10]) Let E be a smooth and uniformly convex real Banach space,and let{un}and{vn}be two sequences of E.If either{un}or{vn}is bounded

andψ(un,vn)→0,as n→ ∞,thenunvn →0,as n→ ∞.

Remark2 Using (N3), it is easy to see that the converse of Lemma 2.2 is also true whenever {un}and{vn}are both bounded.

Lemma 2.3(Matsushita and Takahashi [1]) Let E be a smooth and strictly convex real Banach space,and let C be a nonempty,closed and convex subset of E.Let T be a map from C into itself such that F(T)=∅andψ(y,Tx)≤ψ(y,x),∀(y,x)∈F(TC.Then F(T)

is closed and convex.

Lemma 2.4(Kohsaka and Takahashi [20, Theorem 3.3]) Let C be a nonempty,closed and convex subset of a uniformly convex and uniformly smooth real Banach space E,and let Ti:CE,i= 1, 2, 3, . . . ,be a countable family of relatively nonexpansive maps such that

i=1F(Ti)=∅.Suppose{αi} ⊂(0, 1)and{βi} ⊂(0, 1)are sequences such that

i=1αi= 1

and T:CE is defined by

Tx=J–1

i=1 αi

βiJx+ (1 –βi)JTix

for each xC.

Then T is relatively nonexpansive and F(T) =∞i=1F(Ti).

3 Main results

We first prove the following lemma which will be central for the proof of our main theo-rem.

Lemma 3.1 Let E be a uniformly convex and uniformly smooth real Banach space.Let T:E−→E be a relatively nonexpansive map such that F(T)=∅.Let{un}be generated by the following algorithm:u0,u1E and

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

C0=E,

wn=un+α

n(unun–1),

vn=J–1[(1 –β)Jwn+βJTwn],

Cn+1={zCn:ψ(z,vn)≤ψ(z,wn)},

un+1=

Cn+1u0, n≥1,

(3.1)

(5)

Proof We partition our proof into four steps.

Step 1. We show that{un}is well defined andF(T)⊆Cn,∀n≥0.

LetzCn+1, then ψz,vnψz,wn

z2– 2z,Jvn +vn2≤ z2– 2z,Jwn +wn2

⇔ 2z,JwnJvnwn2–vn2. (3.2) Using (3.2) above, we observe thatCnis closed and convex,∀n≥0. We now show that

F(T)⊆Cn,∀n≥0. For n=0,F(T)⊆C0=E. AssumeF(T)⊆Cn, letpF(T). Then, by

(N2) and the fact thatT is relatively nonexpansive, we have that ψp,vn=ψ(p,J–1(1 –β)Jwn+βJTwn

≤(1 –β)ψp,wn+βψp,Twn

≤(1 –β)ψp,wn+βψp,wn=ψp,wn, (3.3)

which implies thatpCn+1. So, by induction,F(T)⊆Cnfor alln≥0. Thus,{un}is well

defined.

Step 2. We show that{un},{vn}and{wn}are bounded.

We observe thatun=

Cnu0andCn+1⊆Cnfor alln≥0. So, employing Lemma 2.1, we have thatψ(un,u0)ψ(un+1,u0). Hence,{ψ(un,u0)}is nondecreasing. Furthermore, we obtain thatψ(un,u0) =ψ(Cnu0,u0)≤ψ(p,u0) –ψ(p,un)≤ψ(p,u0), which implies that {ψ(un,u0)}is bounded; and hence by (N

0),{un}is bounded; and consequently,{ψ(un,u0)} is convergent. From Lemma 2.1, we have that

ψum,un=ψum,Cnu

0ψum,u0ψun,u00, asn,m→ ∞. Hence,{un}is Cauchy and this implies thatun+1un0, asn→ ∞.

Using the definition ofwn, we have thatunwn=α

n(un–1–un) ≤ un–1–un →0, as

n→ ∞. Since{wn}is bounded, by Remark 2, we have thatψ(un,wn)0, asn→ ∞. Since

un+1C

n, it follows that 0≤ψ(un+1,vn)≤ψ(un+1,wn)→0, asn→ ∞, which implies that

unvn →0, asn→ ∞; and consequently,{vn}is bounded.

Step 3. We show thatwnTwn0, asn→ ∞.

Using Remark 2, we deduce thatψ(un,vn)0, asn→ ∞. By (N1) and the uniform

continuity ofJon bounded sets, we have that

ψwn,vn=ψwn,un+ψun,vn+ 2unwn,JvnJun

ψwn,un+ψun,vn+ 2unwnJunJvn→0, asn→ ∞. (3.4) Next, from the definition ofvn, we observe that

JvnJwn=βJTwnJwn.

(6)

Step 4. We show thatun F(T)u0.

Since{wn}is bounded, there exists{wnk}, a subsequence of{wn}, such thatwnk x, ask→ ∞. Using Step 3, we obtain thatwnkTwnk0, ask→ ∞. Since our map is relatively nonexpansive, we have thatx∗∈F(T). Thus, it follows from Step 2 that there exists{unk}, a subsequence of {un}, such thatunk x, ask→ ∞. We now show that

x∗=F(T)u0. Setv=F(T)u0. Fromun=

Cnu0andF(T)⊆Cn,∀n≥1, we haveψ(un,u0)≤ψ(v,u0). Employing the

weak lower semi-continuity of norm, we obtain

ψx∗,u0=x∗2– 2x∗,Ju0 +u02

≤lim infunk2– 2unk,Ju0 +u02

=lim infψunk,u0≤lim supψunk,u0≤ψv,u0. (3.5) However,

ψv,u0≤ψz,u0, for allzF(T) ⇒ ψv,u0≤ψx∗,u0≤ψv,u0

ψv,u0=ψx∗,u0. (3.6)

By the uniqueness ofF(T)u0,v=x∗. So, we deduce that x∗=F(T)u0. Next, we show that unkx, ask→ ∞. Using (3.5) and (3.6), we obtain thatψ(unk,u0)ψ(x,u0), ask→ ∞. As a result of this, we obtain thatunkx∗, ask→ ∞. By the Kadec– Klee property ofE, we conclude thatunkx, ask→ ∞. Consequently, since{un}is convergent, we obtain thatunx, asn→ ∞. Therefore,un

F(T)u0. This completes

the proof.

Using Lemma 3.1, we now prove our main theorem of this paper.

Theorem 3.2 Let E be a uniformly convex and uniformly smooth real Banach space.Let Ti:EE,i= 1, 2, 3, . . . ,be a countable family of relatively nonexpansive maps such that

i=1F(Ti)=∅.Suppose{αi} ⊂(0, 1)and{βi} ⊂(0, 1)are sequences such that

i=1αi= 1

and T:EE is defined by Tx=J–1(∞i=1αi(βiJx+ (1 –βi)JTix))for each xE.Let{un}be

generated by the following algorithm:u0,u1E and

⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩

C0=E,

wn=un+α

n(unun–1),

vn=J–1[(1 –β)Jwn+βJTwn],

Cn+1={zCn:ψ(z,vn)≤ψ(z,wn)},

un+1=

Cn+1u0, n≥0,

(3.7)

whereαn∈(0, 1),β∈(0, 1),then{un}converges strongly to a point p=F(T)u0.

Proof From Lemma 2.4,Tis relatively nonexpansive andF(T) =∞i=1F(Ti). The

(7)

Corollary 3.3 Let E be uniformly convex and uniformly smooth real Banach spaces Lp(or

lpor Wpm( )), 1 <p<∞.Let Ti:EE,i= 1, 2, 3, . . . ,be a countable family of relatively

nonexpansive maps such thati=1F(Ti)=∅.Suppose that{αi} ⊂(0, 1)and{βi} ⊂(0, 1)

are sequences such thati=1αi= 1and T:EE is defined by Tx=J–1(

i=1αi(βiJx+

(1 –βi)JTix))for each xE.Let{un}be generated by the following algorithm:u0,u1∈E

and

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

C0=E,

wn=un+α

n(unun–1),

vn=J–1[(1 –β)Jwn+βJTwn],

Cn+1={zCn:ψ(z,vn)≤ψ(z,wn)},

un+1=Cn+1u

0, n1,

(3.8)

whereαn∈(0, 1),β∈(0, 1).Then{un}converges strongly toF(T)u0.

Corollary 3.4 Let H be a real Hilbert space.Let Ti:HH,i= 1, 2, 3, . . . ,be a countable

family of nonexpansive maps such thati=1F(Ti)=∅. Suppose{αi} ⊂(0, 1)and{βi} ⊂

(0, 1)are sequences such thati=1αi= 1and T:HH is defined by Tx= (

i=1αi(βix+

(1 –βi)Tix))for each xH.Let{un}be generated by the following algorithm:u0,u1∈H

and

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

C0=H,

wn=un+αn(unun–1),

vn= (1 –β)wn+βTwn,

Cn+1={zCn:zvnzwn},

un+1=

Cn+1u0, n≥1,

(3.9)

whereαn∈(0, 1),β∈(0, 1).Then{un}converges strongly toF(T)u0.

Proof Using Remark 1, we have thatTiis relatively nonexpansive for eachi≥1. Thus, the

conclusion follows from Theorem 3.2.

4 Conclusion

Theorem 3.2 is an improvement of the result of Matsushita and Takahashi [1] and the result of Donget al. [2] in the following sense:

• The algorithms studied in Matsushita and Takahashi [1] and Donget al. [2] require at

each step of the iteration processthe computation of two subsetsCnandQnofC; their

intersectionCnQn, and the projection of the initial vector onto this intersection. In our iteration process, the subsetQnhas been dispensed with. Furthermore, the sequences{αn}and{βn}used in the algorithms of Matsushita and Takahashi [1] and

Donget al. [2], which are also to be computed at each step of the iteration process,

(8)

• In Matsushita and Takahashi [1], the authors proved a strong convergence theorem for a relatively nonexpansive mapT:CC. In our Theorem 3.2, a strong

convergence theorem is proved for acountable family of relatively nonexpansive maps

Ti:EE,i∈N. Furthermore, unlike the algorithm of Matsushita and Takahashi, our algorithm has aninertial termwhich is known to improve the speed of convergence over algorithms without an inertial term (see e.g. [2–5, 21] and the references contained in them).

• In Donget al. [2, Theorem 4.1], the authors proved a strong convergence theorem in a real Hilbert space for one nonexpansive map. Our theorem is proved in the much more general uniformly convex and uniformly smooth real Banach spaces and for a countable family of relatively nonexpansive maps.

Acknowledgements

The authors thank the African Capacity Building Foundation (ACBF) for sponsoring this research work.

Funding

Research supported from ACBF Research Grant Funds to AUST.

Competing interests

The authors declare that they have no conflict of interest.

Authors’ contributions

CEC formulated the problem and suggested the method of proof of the Theorem to SII and AA. The computations using the method suggested by CEC were carried out by SII and AA. The analysis of the computations to arrive at the proof of the Theorem was done jointly by CEC, SII, and AA. All authors read and approved the final manuscript.

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Received: 9 November 2017 Accepted: 16 February 2018 References

1. Matsushita, S., Takahashi, W.: A strong convergence theorem for relatively nonexpansive mappings in a Banach space. J. Approx. Theory134, 257–266 (2005)

2. Dong, Q.L., Yuan, H.B., Je, C.Y., Rassias, Th.M.: Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings. Optim. Lett.12, 87–102 (2018). https://doi.org/10.1007/s11590-016-1102-9

3. Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys.

4(5), 1–17 (1964)

4. Bot, R.I., Csetnek, E.R., Hendrich, C.: Inertial Douglas–Rachford splitting for monotone inclusion problems. Appl. Math. Comput.256, 472–487 (2015)

5. Lorenz, D.A., Pock, T.: An inertial forward–backward algorithm for monotone inclusions. J. Math. Imaging Vis.51, 311–325 (2015)

6. Ibaraki, T., Takahashi, W.: A new projection and convergence theorems for projections in Banach spaces. J. Approx. Theory149(1), 1–14 (2007)

7. Alber, Ya.: Metric and generalized projection operators in Banach spaces: properties and applications. In: Kartsatos, A.G. (ed.) Theory and Applications of Nonlinear Operators of Accretive and Monotone Type. Lecture Notes in Pure and Applied Mathematics, vol. 178, pp. 15–50. Dekker, New York (1996)

8. Chidume, C.E., Bello, A.U., Usman, B.: Krasnoselskii-type algorithm for zeros of strongly monotone Lipschitz maps in classical Banach spaces. SpringerPlus4, Article ID 297 (2015). https://doi.org/10.1186/s40064-015-1044-1

9. Chidume, C.E., Nnyaba, U.V., Romanus, O.M., Ezea, C.G.: Convergence theorems for strictly J-pseudocontractions with application to zeros of Gamma-inverse strongly monotone maps. Panam. Math. J.26(4), 57–76 (2016)

10. Kamimura, S., Takahashi, W.: Strong convergence of a proximal-type algorithm in a Banach space. SIAM J. Optim.13, 938–945 (2002)

11. Reich, S.: A weak convergence theorem for the alternating methods with Bergman distance. In: Kartsatos, A.G. (ed.) Theory and Applications of Nonlinear Operators of Accretive and Monotone Type. Lecture Notes in Pure and Applied Mathematics, vol. 178, pp. 313–318. Dekker, New York (1996)

12. Reich, S.: Strong convergence theorems for resolvents of accretive operators in Banach spaces. J. Math. Anal. Appl.

75(1), 287–292 (1980)

13. Takahashi, W., Zembayashi, K.: Strong and weak convergence theorems for equilibrium problems and relatively nonexpansive mappings in Banach spaces. Nonlinear Anal.70, 45–57 (2009)

14. Zegeye, H.: Strong convergence theorems for maximal monotone maps in Banach spaces. J. Math. Anal. Appl.343, 663–671 (2008)

(9)

16. Chidume, C.E.: Geometric Properties of Banach Spaces and Nonlinear Iterations. Lectures Notes in Mathematics, vol. 1965. Springer, London (2009). https://doi.org/10.1007/978-1-84882-190-3

17. Takahashi, W.: Convex Analysis and Approximation of Fixed Points. Yokohama Publishers, Yokohama (2000) (Japanese)

18. Takahashi, W.: Nonlinear Functional Analysis. Yokohama Publishers, Yokohama (2000)

19. Nakajo, K., Takahashi, W.: Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups. J. Math. Anal. Appl.279, 372–379 (2003)

20. Kohsaka, F., Takahashi, W.: The set of common fixed points of an infinite family of relatively nonexpansive mappings. In: Banach and Function Spaces II, pp. 361–373. Yokohama Publishers, Yokohama (2008)

References

Related documents

We investigated the relationship between different assem- blies of Aβ — freshly prepared, oligomeric, and fibrillar — and tau seeding using several cell-culture models,

3 Quantification of the CD3-positive T cells as percentage of cases presenting T cells in the blood vessels and/or the parenchyma in the grey and white matter, in the controls

In the bacteriome, gene expression analysis shows the overexpression of one antibacterial peptide from the coleoptericin family and, intriguingly, homologs to genes described as

The aim of the study was to inform diabetes prevention policies by exploring how individual perceptions and wider socio-cultural influences shape individual health behaviours

The highest proportion of patients who achieved the composite outcome of HbA1c reduction ≥ 0.5%, body weight loss ≥ 2.0 kg and treatment persistence for 18 months was observed in

When this domain in human GMAP-210 is replaced with a mitochondrial targeting signal, the mitochondrial GMAP-210 captures vesicles containing Golgi resident membrane proteins, and

Longitudinal weight gain in women identified with polycystic ovary syndrome: results of an observational study in young women. Ollila MM, Piltonen T, Puukka K, Ruokonen A, Jarvelin

The fact that AP-2 α silencing in GN-11 neurons or in HeLa cells [23] or AP-2 α ablation in MEFs led to decreased cell movement demon- strates that motility is depending on AP-2 α