It is known that strictly pseudocontractive mappings have more powerful applications than nonexpansive mappings in solving inverse problems. In this paper, we devote to study computing the fixed points of strictly pseudocontractive mappings by the iterations. Two iterative methods (one implicit and another explicit) for finding the fixed point of strictly pseudocontractive mappings have been constructed in Hilbert spaces. As special cases, we can use these two methods to find the minimum norm fixed point of strictly pseudocontractive mappings.
1. Introduction
In this paper, we devote to study computing the fixed points of strictly pseudocontractive mappings by the iterations. Our motivations are mainly in two respects.
Motivation 1
Iterative methods for finding fixed points of nonexpansive mappings have received vast investigations due to its extensive applications in a variety of applied areas of inverse problem, partial differential equations, image recovery, and signal processing; see [1–35] and the references therein. It is known [36] that strictly pseudocontractive mappings have more powerful applications than nonexpansive mappings in solving inverse problems. Therefore it is interesting to develop the algorithms for strictly pseudocontractive mappings.
Motivation 2
In many problems, it is needed to find a solution with minimum norm. In an abstract way, we may formulate such problems as finding a point x† with the property
(1.1)x†∈C,‖x†‖=minx∈C‖x‖,
where C is a nonempty closed convex subset of a real Hilbert space H. A typical example is the least-squares solution to the constrained linear inverse problem [37]. Some related works for finding the minimum-norm solution (or fixed point of nonexpansive mappings) have been considered by some authors. The reader can refer to [38–41].
In the present paper, we present two iterative methods (one implicit and another explicit) for finding the fixed point of strictly pseudocontractive mappings in Hilbert spaces. As special cases, we can use these two methods to find the minimum norm fixed point of strictly pseudocontractive mappings.
2. Preliminaries
Let H be a real Hilbert space with inner product 〈·,·〉 and norm ∥·∥, respectively. Let C be a nonempty closed convex subset of H.
2.1. Some Concepts
Recall that a mapping T:C→C is called nonexpansive, if
(2.1)‖Tx-Ty‖≤‖x-y‖,
for all x,y∈C. And a mapping T:C→C is said to be strictly pseudocontractive if there exists a constant 0≤λ<1 such that
(2.2)‖Tx-Ty‖2≤‖x-y‖2+λ‖(I-T)x-(I-T)y‖2,
for all x,y∈C. For such a case, we also say that T is a λ-strictly pseudocontractive mapping. It is clear that, in a real Hilbert space H, (2.2) is equivalent to
(2.3)〈Tx-Ty,x-y〉≤‖x-y‖2-1-λ2‖(I-T)x-(I-T)y‖2,
for all x,y∈C. It is clear that the class of strictly pseudocontractive mappings strictly includes the class of nonexpansive mappings.
Recall that the nearest point (or metric) projection from H onto C is defined as follows: for each point x∈H, PC[x] is the unique point in C with the property:
(2.4)‖x-PCx‖≤‖x-y‖,y∈C.
Note that PC is characterized by the inequality:
(2.5)PCx∈C,〈x-PCx,y-PCx〉≤0,y∈C.
Consequently, PC is nonexpansive.
2.2. Several Useful LemmasLemma 2.1 (see [42]).
Let H be a real Hilbert space. There holds the following identity:
(2.6)‖x+y‖2=‖x‖2+2〈x,y〉+‖y‖2,
for all x,y∈H.
Lemma 2.2 (see [43]).
Let C be a nonempty closed convex subset of a real Hilbert space H. Let T:C→C be a λ-strict pseudocontraction. Then,
F(T) is closed convex so that the projection PF(T) is well defined;
κI+(1-κ)T for κ∈[λ,1), is nonexpansive.
Lemma 2.3 2.3 (see [42]).
Let C be a nonempty closed convex of a real Hilbert space H. Let T:C→C be a λ-strictly pseudocontractive mapping. Then I-T is demiclosed at 0 that is if xn⇀x∈C and xn-Txn→0, then x=Tx.
Lemma 2.4 (see [44]).
Let {xn} and {yn} be bounded sequences in a Banach space X and let {βn} be a sequence in [0,1] with 0<liminfn→∞βn≤limsupn→∞βn<1. Suppose that
(2.7)xn+1=(1-βn)yn+βnxn
for all n≥0 and
(2.8)limsupn→∞(‖yn+1-yn‖-‖xn+1-xn‖)≤0.
Then limn→∞∥yn-xn∥=0.
Lemma 2.5 (see [45]).
Let {an}n=0∞ be a sequence of nonnegative real numbers satisfying
(2.9)an+1≤(1-γn)an+γnσn,n≥0,
where {γn}n=0∞⊂(0,1) and {σn}n=0∞ satisfy
∑n=0∞γn=∞,
either limsupn→∞σn≤0 or ∑n=0∞|γnσn|<∞.
Then {an}n=0∞ converges to 0.
We use the following notation:
Fix(T) stands for the set of fixed points of T;
xn⇀x stands for the weak convergence of (xn) to x;
xn→x stands for the strong convergence of (xn) to x.
3. Iterations and Convergence AnalysisTheorem 3.1.
Let C be a nonempty closed convex subset of a real Hilbert space H. Let T:C→C a λ-strictly pseudocontractive mapping with Fix(T)≠∅. Let κ∈(0,1) be a constant. For u∈H and any x0∈C, let {xn} be the sequence defined by the following implicit manner:
(3.1)xn=κTxn+(1-κ)PC[αnu+(1-αn)xn],n≥0.
Then the sequence {xn} converges strongly to PFix(T)(u).
Proof.
Step 1. The sequence {xn} is well defined.
Set β=κ/(1-(1-κ)λ). It is easily to check that β∈(0,1). Then, we can rewrite (3.1) as
(3.2)xn=β(1-λ)1-βλTxn+1-β1-βλPC[αnu+(1-αn)xn],n≥0,
which is equivalent to the following:
(3.3)xn=β(λxn+(1-λ)Txn)+(1-β)PC[αnu+(1-αn)xn],n≥0.
Note that λI+(1-λ)T is nonexpansive (see Lemma 2.2). For fix n, we define a mapping Sn:C→C by
(3.4)Snx=β(λx+(1-λ)Tx)+(1-β)PC[αnu+(1-αn)x],x∈C.
For x,y∈C, we have
(3.5)‖Snx-Sny‖=‖β(λI+(1-λ)T)x+(1-β)PC[αnu+(1-αn)x]=-β(λI+(1-λ)T)y-(1-β)PC[αnu+(1-αn)y]‖≤β‖x-y‖+(1-β)(1-αn)‖x-y‖=[1-(1-β)αn]‖x-y‖,
which implies that Sn is a self-contraction of C for every n. Hence Sn has a unique fixed point xn∈C which is the unique solution of the fixed point equation (3.3).
Step 2. The sequence {xn} is bounded.
Pick up any x*∈Fix(T). From (3.3), we have
(3.6)‖xn-x*‖=‖β(λxn+(1-λ)Txn)+(1-β)PC[αnu+(1-αn)xn]-x*‖≤β‖λxn+(1-λ)Txn-x*‖+(1-β)‖PC[αnu+(1-αn)xn]-x*‖≤β‖xn-x*‖+(1-β)‖αn(u-x*)+(1-αn)(xn-x*)‖≤β‖xn-x*‖+(1-β)[(1-αn)‖xn-x*‖+αn‖u-x*‖].
It follows that
(3.7)‖xn-x*‖≤‖u-x*‖.
Hence, {xn} is bounded and so is {Txn}.
Step 3. limn→∞∥xn-Txn∥=0.
From (3.3), we have
(3.8)‖xn-Txn‖≤βλ‖xn-Txn‖+(1-β)‖PC[αnu+(1-αn)xn]-PC[Txn]‖≤βλ‖xn-Txn‖+(1-β)(αn‖u-Txn‖+(1-αn)‖xn-Txn‖)=[1-(1-αn-λ)β]‖xn-Txn‖+(1-β)αn‖u-Txn‖.
It follows that
(3.9)‖xn-Txn‖≤1-β(1-αn-λ)βαn‖u-Txn‖⟶0.
Step 4. xn→x-∈PFix(T)(u).
Since {xn} is bounded, there exists a subsequence {xni} of {xn}, which converges weakly to a point x-∈C. Noticing (3.9) we can use Lemma 2.3 to get x-∈Fix(T).
By using the convexity of the norm and Lemma 2.1, for any x~∈Fix(T), we have
(3.10)‖xn-x~‖2=‖β(λxn+(1-λ)Txn-x~)+(1-β)(PC[αnu+(1-αn)xn]-x~)‖2≤β‖λxn+(1-λ)Txn-x~‖2+(1-β)‖PC[αnu+(1-αn)xn]-x~‖2≤β‖xn-x~‖2+(1-β)‖αn(u-x~)+(1-αn)(xn-x~)‖2=β‖xn-x~‖2+(1-β)[(1-αn)2‖xn-x~‖2+2αn(1-αn)〈u-x~,xn-x~〉+αn2‖u-x~‖2]=β‖xn-x~‖2+(1-β)[‖xn-x~‖2-2αn‖xn-x~‖2+2αn〈u-x~,xn-x~〉=β‖xn-x~‖2+(1-β)+αn2(‖u-x~‖2+‖xn-x~‖2-2〈u-x~,xn-x~〉)].
It turns out that
(3.11)‖xn-x~‖2≤〈u-x~,xn-x~〉+αn2(‖u-x~‖2+‖xn-x~‖2+2‖u-x~‖‖xn-x~‖)≤〈u-x~,xn-x~〉+αnM,
where M>0 is some constant such that
(3.12)sup12{‖u-x~‖2+‖xn-x~‖2+2‖u-x~‖‖xn-x~‖}≤M.
Therefore we can substitute x~ for x- in (3.11) to get
(3.13)‖xn-x-‖2≤〈u-x-,xn-x-〉+αnM.
However, xn⇀x-. This together with (3.13) guarantees that xn→x-. It is clear that x-=PFix(T)(u). As a matter of fact, in (3.11), if we let n→∞, then we get
(3.14)〈u-x~,x--x~〉≥0,∀x~∈Fix(T).
This is equivalent to
(3.15)〈u-x-,x--x~〉≥0,∀x~∈Fix(T).
Hence, x-=PFix(T)(u). Therefore, xn→x-=PFix(T)(u). This completes the proof.
Corollary 3.2.
Let C be a nonempty closed convex subset of a real Hilbert space H. Let T:C→C a nonexpansive mapping with Fix(T)≠∅. Let κ∈(0,1) be a constant. For u∈H and any x0∈C, let {xn} be the sequence defined by the following implicit manner:
(3.16)xn=κTxn+(1-κ)PC[αnu+(1-αn)xn],n≥0.
Then the sequence {xn} converges strongly to PFix(T)(u).
Corollary 3.3.
Let C be a nonempty closed convex subset of a real Hilbert space H. Let T:C→C a λ-strictly pseudocontractive mapping with Fix(T)≠∅. Let κ∈(0,1) be a constant. For any x0∈C, let {xn} be the sequence defined by the following implicit manner:
(3.17)xn=κTxn+(1-κ)PC[(1-αn)xn],n≥0.
Then the sequence {xn} converges strongly to PFix(T)(0) which is the minimum norm fixed point of T.
Corollary 3.4.
Let C be a nonempty closed convex subset of a real Hilbert space H. Let T:C→C a nonexpansive mapping with Fix(T)≠∅. Let κ∈(0,1) be a constant. For any x0∈C, let {xn} be the sequence defined by the following implicit manner:
(3.18)xn=κTxn+(1-κ)PC[(1-αn)xn],n≥0.
Then the sequence {xn} converges strongly to PFix(T)(0) which is the minimum norm fixed point of T.
Next, we introduce an explicit algorithm for finding the fixed point of T.
Theorem 3.5.
Let C be a nonempty closed convex subset of a real Hilbert space H. Let T:C→C a λ-strictly pseudocontractive mapping with Fix(T)≠∅. Let β and δ be two constants in (0,1) satisfying β+δ<1. For u∈H and any x0∈C, let {xn} be the sequence defined by the following explicit manner:
(3.19)xn+1=(βλ+δ)xn+β(1-λ)Txn+(1-β-δ)PC[αnu+(1-αn)xn],n≥0,
where αn∈(0,1) satisfies the following conditions:
limn→∞αn=0,
∑n=0∞αn=∞.
Then the sequence {xn} converges strongly to PFix(T)(u).
Proof.
Step 1. The sequence {xn} is bounded.
First, we can rewrite (3.19) as
(3.20)xn+1=β(λxn+(1-λ)Txn)+δxn+(1-β-δ)PC[αnu+(1-αn)xn],n≥0.
Take x*∈Fix(T). From (3.20), we have
(3.21)‖xn+1-x*‖=‖β(λxn+(1-λ)Txn-x*)+δ(xn-x*)+(1-β-δ)(PC[αnu+(1-αn)xn]-x*)‖≤β‖λxn+(1-λ)Txn-x*‖+δ‖xn-x*‖22β+(1-β-δ)‖PC[αnu+(1-αn)xn]-x*‖≤β‖xn-p‖+δ‖xn-x*‖+(1-β-δ)(αn‖u-x*‖+(1-αn)‖xn-x*‖)=[1-(1-β-δ)αn]‖xn-x*‖+(1-β-δ)αn‖u-x*‖≤max{‖xn-x*‖,‖u-x*‖}.
By induction,
(3.22)‖xn+1-x*‖≤max{‖xn-x*‖,‖u-x*‖}.
Hence, the sequence {xn} is bounded and {Txn} is also bounded.
Step 2. limn→∞∥xn-Txn∥=0.
We can rewrite (3.20) as
(3.23)xn+1=δxn+(1-δ)yn,
where
(3.24)yn=β1-δ(λxn+(1-λ)Txn)+1-β-δ1-δPC[αnu+(1-αn)xn],n≥0.
It follows that
(3.25)‖yn+1-yn‖≤β1-δ‖(λxn+1+(1-λ)Txn+1)-(λxn+(1-λ)Txn)‖+1-β-δ1-δ‖PC[αn+1u+(1-αn+1)xn+1]-PC[αnu+(1-αn)xn]‖≤β1-δ‖xn+1-xn‖+1-β-δ1-δ|αn+1-αn|(‖u‖+‖xn‖)+1-β-δ(1-δ)(1-αn+1)‖xn+1-xn‖≤‖xn+1-xn‖+1-β-δ1-δ|αn+1-αn|(‖u‖+‖xn‖).
Thus,
(3.26)limsupn→∞(‖yn+1-yn‖-‖xn+1-xn‖)≤limsupn→∞1-β-δ1-δ|αn+1-αn|(‖u‖+‖xn‖)=0.
This together with Lemma 2.4 implies that
(3.27)limn→∞‖yn-xn‖=0.
Note that
(3.28)‖xn-Txn‖≤‖xn-yn‖+‖yn-Txn‖=‖xn-yn‖+‖β1-δ(λxn+(1-λ)Txn)+1-β-δ1-δPC[αnu+(1-αn)xn]-Txn‖≤‖xn-yn‖+β1-δλ‖xn-Txn‖+1-β-δ1-δ‖PC[αnu+(1-αn)xn]-Txn‖≤‖xn-yn‖+β1-δλ‖xn-Txn‖+1-β-δ1-δαn‖u-Txn‖+1-β-δ1-δ(1-αn)‖xn-Txn‖.
It follows that
(3.29)‖xn-Txn‖≤1-δβ(1-λ)‖xn-yn‖+1-β-δβ(1-λ)αn‖u-Txn‖.
Thus,
(3.30)limn→∞‖xn-Txn‖=0.
Step 3. limsupn→∞〈u-x~,xn-x~〉≤0, where x~=PFix(T)(u).
To see this, we can take a subsequence {xnk} of {xn} satisfying the properties
(3.31)limsupn→∞〈u-x~,xn-x~〉=limk→∞〈u-x~,xnk-x~〉,(3.32)xnk⇀x*ask⟶∞.
By the demiclosed principle (see Lemma 2.3) and (3.30), we have that x*∈Fix(T). So,
(3.33)limsupn→∞〈u-x~,xn-x~〉=〈u-x~,x*-x~〉≤0.Step 4. xn→x~.
From (3.20), we get
(3.34)‖xn+1-x~‖2≤β‖λxn+(1-λ)Txn-x~‖2+δ‖xn-x~‖2+(1-β-δ)‖PC[αnu+(1-αn)xn]-x~‖2≤(β+δ)‖xn-x~‖2+(1-β-δ)‖αn(u-x~)+(1-αn)(xn-x~)‖2=(β+δ)‖xn-x~‖2+(1-β-δ)[(1-2αn)‖xn-x~‖2+2αn〈u-x~,xn-x~〉(1-2αn)‖xn-x~‖2+(1-β-δ)+αn2(‖u-x~‖2+‖xn-x~‖2-2〈u-x~,xn-x~〉)]=[1-2(1-β-δ)αn]‖xn-x~‖2+2(1-β-δ)αn(〈u-x~,xn-x~〉+αn2(‖u-x~‖2+‖xn-x~‖2-2〈u-x~,xn-x~〉))=(1-δn)‖xn-x~‖2+δnθn,
where δn=2(1-β-δ)αn and
(3.35)θn=〈u-x~,xn-x~〉+αn2(‖u-x~‖2+‖xn-x~‖2-2〈u-x~,xn-x~〉).
It is easy to see that limn→∞δn=0 and limsupn→∞θn≤0. We can therefore apply Lemma 2.5 to (3.34) and conclude that xn+1→x~ as n→∞. This completes the proof.
Corollary 3.6.
Let C be a nonempty closed convex subset of a real Hilbert space H. Let T:C→C a nonexpansive mapping with Fix(T)≠∅. Let β and δ be two constants in (0,1) satisfying β+δ<1. For u∈H and any x0∈C, let {xn} be the sequence defined by the following explicit manner:
(3.36)xn+1=(βλ+δ)xn+β(1-λ)Txn+(1-β-δ)PC[αnu+(1-αn)xn],n≥0,
where αn∈(0,1) satisfies the following conditions:
limn→∞αn=0,
∑n=0∞αn=∞.
Then the sequence {xn} converges strongly to PFix(T)(u).
Corollary 3.7.
Let C be a nonempty closed convex subset of a real Hilbert space H. Let T:C→C a λ-strictly pseudocontractive mapping with Fix(T)≠∅. Let β and δ be two constants in (0,1) satisfying β+δ<1. For any x0∈C, let {xn} be the sequence defined by the following explicit manner:
(3.37)xn+1=(βλ+δ)xn+β(1-λ)Txn+(1-β-δ)PC[(1-αn)xn],n≥0,
where αn∈(0,1) satisfies the following conditions:
limn→∞αn=0,
∑n=0∞αn=∞.
Then the sequence {xn} converges strongly to PFix(T)(0) which is the minimum norm fixed point of T.
Corollary 3.8.
Let C be a nonempty closed convex subset of a real Hilbert space H. Let T:C→C a nonexpansive mapping with Fix(T)≠∅. Let β and δ be two constants in (0,1) satisfying β+δ<1. For any x0∈C, let {xn} be the sequence defined by the following explicit manner:
(3.38)xn+1=(βλ+δ)xn+β(1-λ)Txn+(1-β-δ)PC[(1-αn)xn],n≥0,
where αn∈(0,1) satisfies the following conditions:
limn→∞αn=0;
∑n=0∞αn=∞.
Then the sequence {xn} converges strongly to PFix(T)(0) which is the minimum norm fixed point of T.
4. Conclusion
Finding fixed points of nonlinear mappings (especially, nonexpansive mappings) has received vast investigations due to its extensive applications in a variety of applied areas of inverse problem, partial differential equations, image recovery and signal processing. It is wellknown that strictly pseudocontractive mappings have more powerful applications than nonexpansive mappings in solving inverse problems. In this paper, we devote to construct the methods for computing the fixed points of strictly pseudocontractive mappings. Two iterative methods have been presented. Especially, we can use these two methods to find the minimum norm fixed point of strictly pseudocontractive mappings. The ideas contained in the present paper can help us to solve the minimum norm problems in the applied science.
Acknowledgment
The author was supported in part by NSC 100-2221-E-230-012.
BrowderF. E.Convergence of approximants to fixed points of nonexpansive non-linear mappings in Banach spaces19672482900206765HalpernB.Fixed points of nonexpanding maps196773957961021893810.1090/S0002-9904-1967-11864-0ZBL0177.19101OpialZ.Weak convergence of the sequence of successive approximations for nonexpansive mappings196773591597021130110.1090/S0002-9904-1967-11761-0ZBL0179.19902LionsP. L.Approximation de points fixes de contractions197728421A1357A13590470770ZBL0349.47046GoebelK.KirkW. A.199028Cambridge, UKCambridge University Pressviii+244Cambridge Studies in Advanced Mathematics10.1017/CBO97805115261521074005WittmannR.Approximation of fixed points of nonexpansive mappings199258548649110.1007/BF011901191156581ZBL0797.47036ReichS.ZaslavskiA. J.Convergence of Krasnoselskii-Mann iterations of nonexpansive operators20003211–131423143110.1016/S0895-7177(00)00214-41800665ZBL0977.47046LauA. T. M.TakahashiW.Fixed point properties for semigroup of nonexpansive mappings on Fréchet spaces200970113837384110.1016/j.na.2008.07.0412515303ZBL1219.47082CombettesP. L.PennanenT.Generalized Mann iterates for constructing fixed points in Hilbert spaces2002275252153610.1016/S0022-247X(02)00221-41943763ZBL1032.47034BauschkeH. H.The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space1996202115015910.1006/jmaa.1996.03081402593ZBL0956.47024MoudafiA.Viscosity approximation methods for fixed-points problems20002411465510.1006/jmaa.1999.66151738332ZBL0957.47039XuH. K.Viscosity approximation methods for nonexpansive mappings2004298127929110.1016/j.jmaa.2004.04.0592086546ZBL1061.47060HirstoagaS. A.Iterative selection methods for common fixed point problems200632421020103510.1016/j.jmaa.2005.12.0642265098ZBL1106.47057PetruşelA.YaoJ.-C.Viscosity approximation to common fixed points of families of nonexpansive mappings with generalized contractions mappings20086941100111110.1016/j.na.2007.06.0162426676ZBL1142.47329YaoY.ChenR.LiouY. C.A unified implicit algorithm for solving the triplehierarchical constrained optimization problem2012553-41506151510.1016/j.mcm.2011.10.041YaoY.ShahzadN.Strong convergence of a proximal point algorithm with general errors20126462162810.1007/s11590-011-0286-2YaoY.ShahzadN.New methods with perturbations for non-expansive mappings in Hilbert spaces2011 2011, article 7910.1186/1687-1812-2011-79ReichS.XuH. K.An iterative approach to a constrained least squares problem2003850351210.1155/S10853375032120821983077ZBL1053.65041YaoY.LiouY. C.MarinoG.Strong convergence of two iterative algorithms for nonexpansive mappings in Hilbert spaces200920097279058255726210.1155/2009/279058ZBL1186.47080ShahzadN.Approximating fixed points of non-self nonexpansive mappings in Banach spaces20056161031103910.1016/j.na.2005.01.0922131792ZBL1089.47058ZegeyeH.ShahzadN.Viscosity approximation methods for a common fixed point of finite family of nonexpansive mappings2007191115516310.1016/j.amc.2007.02.0722385513ZBL1194.47089ShimojiK.TakahashiW.Strong convergence to common fixed points of infinite nonexpansive mappings and applications2001523874041832176ZBL0993.47037ShiojiN.TakahashiW.Strong convergence of approximated sequences for nonexpansive mappings in Banach spaces1997125123641364510.1090/S0002-9939-97-04033-11415370ZBL0888.47034TakahashiW.ShimojiK.Convergence theorems for nonexpansive mappings and feasibility problems20003211–131463147110.1016/S0895-7177(00)00218-11800669ZBL0971.47040MaingéP.-E.Approximation methods for common fixed points of nonexpansive mappings in Hilbert spaces2007325146947910.1016/j.jmaa.2005.12.0662273538ZBL1111.47058MarinoG.XuH.-K.A general iterative method for nonexpansive mappings in Hilbert spaces20063181435210.1016/j.jmaa.2005.05.0282210870ZBL1095.47038YaoY.ChenR.YaoJ.-C.Strong convergence and certain control conditions for modified Mann iteration20086861687169310.1016/j.na.2007.01.0092388842ZBL1189.47071CengL. C.CubiottiP.YaoJ. C.Strong convergence theorems for finitely many nonexpansive mappings and applications20076751464147310.1016/j.na.2006.06.0552323294ZBL1123.47044ChangS. S.Viscosity approximation methods for a finite family of nonexpansive mappings in Banach spaces200632321402141610.1016/j.jmaa.2005.11.0572260191ZBL1111.47057YaoY.LiouY. C.MarinoG.Strong convergence of some algorithms for λ-strict pseudo-contractions in Hilbert spaces2012852232240 10.1017/S000497271100311XYaoY.YaoJ.-C.On modified iterative method for nonexpansive mappings and monotone mappings200718621551155810.1016/j.amc.2006.08.0622316950ZBL1121.65064CianciarusoF.MarinoG.MugliaL.YaoY.On a two-step algorithm for hierarchical fixed point problems and variational inequalities200920091320869210.1155/2009/2086922551747ZBL1180.47040NoorM. A.Some developments in general variational inequalities2004152119927710.1016/S0096-3003(03)00558-72050063ZBL1134.49304NoorM. A.Extended general variational inequalities200922218218510.1016/j.aml.2008.03.0072482273ZBL1163.49303NoorM. A.Some aspects of extended general variational inequalities201220121610.1155/2012/303569303569ScherzerO.Convergence criteria of iterative methods based on Landweber iteration for solving nonlinear problems1995194391193310.1006/jmaa.1995.13351350202ZBL0842.65036SabharwalA.PotterL. C.Convexly constrained linear inverse problems: iterative least-squares and regularization19984692345235210.1109/78.7095181665252YaoY.ChenR.XuH.-K.Schemes for finding minimum-norm solutions of variational inequalities2010727-83447345610.1016/j.na.2009.12.0292587377CuiY. L.LiuX.Notes on Browder's and Halpern's methods for nonexpansive mappings200910189982524150LiuX.CuiY.The common minimal-norm fixed point of a finite family of nonexpansive mappings2010731768310.1016/j.na.2010.02.0412645832YaoY.XuH. K.Iterative methods for finding minimum-norm fixed points of nonexpansive mappings with applications201160664565810.1080/023319309035821402826133MarinoG.XuH.-K.Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces2007329133634610.1016/j.jmaa.2006.06.0552306805ZBL1116.47053ZhouH.Convergence theorems of fixed points for λ-strict pseudo-contractions in Hilbert spaces200869245646210.1016/j.na.2007.05.0322426262SuzukiT.Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces200511031232172156ZBL1123.47308XuH. K.Iterative algorithms for nonlinear operators200266124025610.1112/S00246107020033321911872ZBL1013.47032