 Research
 Open access
 Published:
Viscosity iterative algorithm for the zero point of monotone mappings in Banach spaces
Journal of Inequalities and Applications volume 2018, Article number: 254 (2018)
Abstract
Inspired by the work of Zegeye (J. Math. Anal. Appl. 343:663–671, 2008) and the recent papers of Chidume et al. (Fixed Point Theory Appl. 2016:97, 2016; Br. J. Math. Comput. Sci. 18:1–14, 2016), we devise a viscosity iterative algorithm without involving the resolvent operator for approximating the zero of a monotone mapping in the setting of uniformly convex Banach spaces. Under concise parameter conditions we establish strong convergence of the proposed algorithm. Moreover, applications to constrained convex minimization problems and solution of Hammerstein integral equations are included. Finally, the performances and computational examples and a comparison with related algorithms are presented to illustrate the efficiency and applicability of our new algorithm.
1 Introduction
Let H be a real inner product space. A map \(A:D(A)\subset H\rightarrow2^{H}\) is called monotone if, for each \(x, y\in D(A)\), the following inequality holds:
Interest in monotone mappings derives mainly from their significant numerous applications. For example, the classical convex optimization problem: let \(h:H\rightarrow\mathbb{R}\cup\{\infty \}\) be a proper convex, lower semicontinuous (l.s.c.) function. The subdifferential of h at \(x\in H\) is defined by \(\partial h:H\rightarrow2^{H}\)
Clearly, ∂h is a monotone operator on H, and \(0\in\partial h(x_{0})\) if and only if \(x_{0}\) is a minimizer of h. In the case of setting \(\partial h\equiv A\), solving the inclusion \(0\in Au\), one obtains a minimizer of h.
In addition, the inclusion \(0\in Au\) when A is a monotone map from a real Hilbert space to itself also appears in several systems, in particular, evolution systems:
where A is a monotone map. At an equilibrium state, \(\frac {du}{dt}=0\), so that \(Au=0\), the solution coincides with the equilibrium state of the dynamical system (see, e.g., Zarantonello [4], Minty [5], Kac̆urovskii [6], Chidume [7], Berinde [8], and others).
For solving the original problem of finding a solution of the inclusion \(0\in Au\), Martinet [9] introduced the wellknown iteration method as follows: for \(n\in\mathbb{N}\), \(\forall\lambda_{n}>0\), \(x_{1} \in E\) and
where \(J_{\lambda_{n}}=(I+\lambda_{n}A)^{1}\) is the wellknown Yosida resolvent operator, A is a monotone operator in Hilbert spaces.
This is a successful and powerful algorithm in finding a solution of the equation \(0\in Au\) and after that, it was extended by many authors (see, e.g., Rockafellar [10], Chidume [11], Xu [12], Tang [13], Qin et al. [14]).
On the other hand, Browder [15] introduced an operator \(T:H\rightarrow H\) by \(T=IA\) where I is the identity mapping on a Hilbert space H. The operator T is called pseudocontractive and the zeros of monotone operator A, if they exist, correspond to the fixed points of T. Therefore the approximation of the solutions of \(Au=0\) reduces to the approximation of the fixed points of a pseudocontractive mapping.
Gradually, the notion of monotone mapping has been extended to real normed spaces. Let E be a real normed space with dual \(E^{*}\). A map \(J:E\rightarrow 2^{E^{*}}\), defined by
is called the normalized duality map on E. Some properties of the normalized duality map can be obtained from Alber [16] and the references therein.
Since the normalized duality map J is the identity map I in Hilbert spaces, and so, under the idea of Browder [15], the approximating to solution of \(0\in Au\) has been extended to normed spaces by numerous authors (see, for instance, Chidume [17, 18], Agarwal et al. [19], Reich [20], Diop [21], and the references therein), where A is a monotone mapping from E to itself.
Although the above results have better theoretical properties, such as, but not only, weak and strong convergence to a solution of the equation \(0\in Au\), there are still some difficulties to overcome. For instance, the generalized technique of converting the zero of A into the fixed point of T in Browder [15] is not applicable since, in this case when A is monotone, A maps E into \(E^{*}\). In addition, the resolvent technique in Martinet [9] is not convenient to use because one has to compute the inverse of \((I+\lambda A)\) at each step of the iteration process.
Hence, it is only natural to ask the following question.
Question 1.1
Can we construct an algorithm without involving the resolvent operator to approximate a zero point of A in Banach spaces?
Motivated and inspired by the work of Martinet [9], Rockafellar [10], Zegeye [1], and Chidume et al. [2, 3], as well as Ibaraki and Takahashi [22], we wish to provide an affirmative answer to the question. Our contribution in the present work is a new viscosity iterative method for the solutions of the equation \(0 \in AJu\), that is, \(Ju\in A^{1}(0)\), where \(A: E^{*} \rightarrow{E}\) is a monotone operator defined on the dual of a Banach space E and \(J:E\rightarrow E^{*}\) is the normalized duality map.
The outline of the paper is as follows. In Sect. 2, we collect definitions and results which are needed for our further analysis. In Sect. 3, our implicit and explicit algorithms without involving a resolvent operator are introduced and analyzed, the strong convergence to a zero of the composed mapping AJ under concise parameters conditions is obtained. In addition, the main result is applied to the convex optimization problems and the solution of Hammerstein equation. Finally, some numerical experiments and a comparison with related algorithms are given to illustrate the performances of our new algorithms.
2 Preliminaries
In the sequel, we shall need the following definitions and results.
Let E be a uniformly convex Banach space and \(E^{*}\) be its dual space, let the normalized duality map J on E be defined as (1.2). Then the following properties of the normalized duality map hold (see, e.g., Alber [16], Cioranescu [23], Xu and Roach [24], Xu [25], Zălinescu [26]):

(i)
J is a monotone operator;

(ii)
if E is smooth, then J is singlevalued;

(iii)
if E is reflexive, then J is onto;

(iv)
if E is uniformly smooth, then J is uniformly continuous on bounded subsets of E.
The space E is said to be smooth if \(\rho_{E}(\tau)>0\) for all \(\tau >0\), and the space E is said to be uniformly smooth if \(\lim_{\tau\rightarrow0^{+}}\frac{\rho_{E}(\tau)}{\tau}=0\), where \(\rho _{E}(\tau)\) is defined by
Let \(p>1\), the space E is said to be puniformly smooth if there exists a constant \(c>0\) such that \(\rho_{E}(\tau) \leq c \tau^{p}\), \(\tau>0\). It is well known that every puniformly smooth Banach space is uniformly smooth. Furthermore, from Alber [16], we can get that if E is 2uniformly smooth, then there exists a constant \(L_{*}>0\) such that
A mapping \(A:D(A)\subset E\rightarrow E^{*}\) is said to be monotone on a Banach space E if, for each \(x,y\in D(A)\), the following inequality holds:
A mapping \(A:D(A)\subset E\rightarrow E^{*}\) is said to be Lipschitz continuous if there exists \(L>0\) such that, for each \(x, y\in D(A)\), the following inequality holds:
A mapping \(f: E\rightarrow E\) is called contractive if there exists a constant \(\rho\in(0,1)\) such that
Let C be a nonempty closed convex subset of a uniformly convex Banach space E. A Banach limit μ is a bounded linear functional on \(l^{\infty}\) such that
and \(\mu(x_{n})=\mu(x_{n+1})\) for all \(\{x_{n}\} \in l^{\infty}\). Suppose that \(\{x_{n}\}\) is a bounded sequence in E, then the real valued function φ on E defined by
is convex and continuous, and \(\varphi(y)\rightarrow\infty\) as \(\y\\rightarrow\infty\). If E is reflexive, there exists \(z\in C\) such that \(\varphi(z)=\min_{y\in C}\varphi(y)\) (see, e.g., Kamimura and Takahashi [27], Tan and Xu [28]), so we can define the set \(C_{\min}\) by
It is easy to verify that \(C_{\min}\) is a nonempty, bounded, closed, and convex subset of E. The following lemma was proved in Takahashi [29].
Lemma 2.1
Let α be a real number, and \((x_{0},x_{1},\ldots)\in l^{\infty}\) such that \(\mu(x_{n})\leq\alpha\) for all Banach limits. If \(\limsup_{n\rightarrow\infty}(x_{n+1}x_{n})\leq0\), then \(\limsup_{n\rightarrow\infty}x_{n}\leq\alpha\).
Lemma 2.2
(see, e.g., Tan and Xu [28], Osilike and Aniagbosor [30])
Let \(\{a_{n}\}\) be a sequence of nonnegative real numbers satisfying the following relation:
where \(\{\theta_{n}\}\) and \(\{\sigma_{n}\}\) are real sequences such that

(i)
\(\lim_{n\rightarrow\infty}\theta_{n}=0\), \(\sum_{n=1}^{\infty}\theta_{n}=\infty\);

(ii)
\(\lim_{n\rightarrow\infty}\frac{\sigma_{n}}{\theta_{n}}\leq0\) or \(\sum_{n=0}^{\infty}\sigma_{n}<\infty\).
Then the sequence \(\{a_{n}\}\) converges to 0.
Lemma 2.3
(see, e.g., Xu [12])
Let E be a real Banach space with dual \(E^{*}\). Let \(J:E\rightarrow E^{*}\) be the normalized duality map, then for all \(x,y\in{E}\),
Lemma 2.4
(Zegeye [1])
Let E be a uniformly convex and uniformly smooth Banach space. Assume that \(A:E^{*}\rightarrow E\) is a maximal monotone mapping such that \((AJ)^{1}(0)\neq\emptyset\). Then, for any \(u\in E\) and \(t\in(0,1)\), the path \(t\rightarrow x_{t} \in E\) defined by
converges strongly to an element \(z\in(AJ)^{1}(0)\) as \(t\rightarrow0\).
3 Main results
We now show the strong convergence of our implicit and explicit algorithms.
Theorem 3.1
Let E be a uniformly convex and 2uniformly smooth Banach space. Assume that \(A:E^{*}\rightarrow E\) is an LLipschitz continuous monotone mapping such that \((AJ)^{1}(0) \neq\emptyset\) and \(f:E\rightarrow E\) is a contraction with coefficient \(\rho\in(0,1)\). Then the path \(t\rightarrow x_{t} \in E\), defined by
converges strongly to an element \(z\in(AJ)^{1}(0)\) provided that \(\lim_{t\rightarrow0}\frac{\omega(t)}{t}=0\).
Proof
Since E is 2uniformly smooth, from Alber [16, 31], we have that J is \(L_{*}\)Lipschitz continuous, noticing that A is LLipschitz continuous, therefore \(IAJ\) is Lipschitz continuous with constant \(1+LL_{*}\).
First, we show that \(x_{t}\) is welldefined. Since \(\lim_{t\rightarrow0}\frac{\omega(t)}{t}=0\), for \(\forall \varepsilon>0\), there exists \(\delta>0\) such that, for all \(t\in(0,\delta)\), the inequality \(\frac{\omega (t)}{t}<\varepsilon\) holds.
Without loss of generality, we take \(\varepsilon>0\) such that \(\rho +\varepsilon LL_{*}=b<1\), where b is a positive constant. Define an operator \(T_{t}\) as \(T_{t}x=f(x)(1t)\frac{\omega(t)}{t}AJx\), for \(\forall x, y\in E\), we can get
which means that \(T_{t}\) is a contraction. Therefore, by the Banach contraction principle, there exists a unique fixed point of \(T_{t}\) denoted by \(x_{t}\). That is, \(x_{t}=tf(x_{t})+(1t)(I\omega(t)AJ)x_{t}\), so \(x_{t}\) is welldefined.
Next we shall show that \(x_{t}\) is bounded as \(\lim_{t\rightarrow0}\frac {\omega(t)}{t}=0\). For \(x^{*}\in(AJ)^{1}(0)\), we have the following estimation:
hence,
which means that \(x_{t}\) is bounded as \(t\rightarrow0\), therefore is \(f(x_{t})\).
On the other hand, for arbitrary \(u\in E\), (3.1) can be rewritten as
hence,
which means that \(x_{t}\) converges strongly to an element \(z\in (AJ)^{1}(0)\) as \(\lim_{t\rightarrow0}\frac{\omega(t)}{t}=0\) according to Lemma 2.4. The proof is complete. □
For the rest of the paper, \(\{\alpha_{n}\}\) and \(\{\omega_{n}\}\) are real sequences in \((0,1)\) satisfying the following conditions:
 (C1):

\(\lim_{n\rightarrow\infty}\alpha_{n}=0\), \(\sum_{n=1}^{\infty}\alpha_{n}=\infty\); \(\lim_{n\rightarrow\infty}\frac{\omega_{n}}{\alpha_{n}}=0\) and \(\sum_{n=0}^{\infty}\omega_{n}<\infty\);
 (C2):

f is a piecewise function: \(f(x^{*})=x^{*}\) if \(x^{*}\in(AJ)^{1}(0)\); otherwise \(f(x^{*})\) is a contractive function with coefficient ρ.
Theorem 3.2
Let E be a uniformly convex and 2uniformly smooth Banach space. Assume that \(A:E^{*}\rightarrow E\) is an LLipschitz continuous monotone mapping such that \(C_{\min}\cap (AJ)^{1}(0) \neq\emptyset\) and \(f:E\rightarrow E\) is a piecewise function defined as (C2). Then, for any \(x_{0}\in E\), the sequence \(\{x_{n}\}\), defined by
converges strongly to an element \(z\in(AJ)^{1}(0)\).
Proof
According to the definition of f, it is obvious that if \(x_{n}\in (AJ)^{1}(0) \) then we stop the iteration. Otherwise, we set \(n:=n+1\) and return to iterative step (3.2).
The proof includes three steps.
Step 1: First we prove that \(\{x_{n}\}\) is bounded. Since \(\alpha _{n}\rightarrow0\) and \(\lim_{n\rightarrow\infty}\frac{\omega_{n}}{\alpha _{n}}=0\) as \(n\rightarrow\infty\), there exists \(N_{0}>0\) such that \(\alpha _{n}\leq\frac{1}{6}\), \(\frac{\omega_{n}}{\alpha_{n}}\leq\frac{1}{6LL_{*}}\), \(\forall n>N_{0}\). We take \(x^{*}\in(AJ)^{1}(0)\) or \(Jx^{*}\in A^{1}(0)\). Let \(r>0\) be sufficiently large such that \(x_{N_{0}}\in B_{r}(x^{*})\) and \(f(x_{N_{0}})\in B_{\frac{r}{6}}(x^{*})\).
We show that \(\{x_{n}\}\) belongs to \(B:=\overline{B_{r}(x^{*})}\) for all integers \(n\geq N_{0}\). First, it is clear by construction that \(x_{N_{0}}\in B\). Assuming now that, for an arbitrary \(n>N_{0}\), \(x_{n}\in B\), we prove that \(x_{n+1} \in B\).
If \(x_{n+1}\) does not belong to B, then we have \(\x_{n+1}x^{*}\>r\). From the recurrence (3.2) we obtain that
Thus,
Therefore, from (3.3) and Lemma 2.3 and the fact that \(x_{n+1}x^{*}=x_{n+1}x_{n}+x_{n}x^{*}\),
that is,
Since \(\x_{n+1}x^{*}\>\x_{n}x^{*}\\) and A is LLipschitz and J is \(L_{*}\)Lipschitz continuous respectively, thus we get
Furthermore,
This is contradiction. Consequently, we can get that \(\{x_{n}\}\) belongs to B for all integers \(n\geq N_{0}\), which implies that the sequence \(\{x_{n}\}\) is bounded, so are the sequences \(\{f(x_{n})\}\) and \(\{AJx_{n}\}\).
Moreover, it is easy to see that \(\x_{n+1}x_{n}\\rightarrow0\) because \(\alpha_{n}\rightarrow0\) and \(\omega_{n}=o(\alpha_{n})\),
Step 2: We show that \(\lim_{n\rightarrow\infty}\sup\langle zf(x_{n}),j(zx_{n+1})\rangle \leq0\), where \(z\in C_{\min}\cap(AJ)^{1}(0)\).
Since the sequences \(\{x_{n}\}\) and \(\{f(x_{n})\}\) are bounded, there exists \(R>0\) sufficiently large such that \(f(x_{n})\), \(x_{n}\in B_{1}:=\overline{B_{R}(z)}\), \(\forall n\in\mathbb{N}\). Furthermore, the set \(B_{1}\) is a bounded closed and convex nonempty subset of E. By the convexity of \(B_{1}\), we have that \((1t)z+tf(x_{n})\in B_{1}\). Then it follows from the definition of φ that \(\varphi(z)\leq\varphi((1t)z+tf(x_{n}))\). Using Lemma 2.3, we have that
thus taking Banach limit over \(n\geq1\),
which means that
that is,
By using the weak lower semicontinuity of the norm on E, we get the following as \(t\rightarrow0\):
Thus, for \(\forall\varepsilon> 0\), there exists \(\delta>0\) such that \(t \in(0,\delta)\), \(n\geq1\)
therefore,
In view of the arbitrariness of ε, we have that
From the normtoweak* uniform continuity of J on each bounded subset of E, we have that
Thus, the sequence \(\{\langle f(x_{n})z,j(x_{n}z)\rangle\}\) satisfies the condition of Lemma 2.1, so we have that
Step 3: Next we show that \(\x_{n+1}z\ \rightarrow 0\).
From (3.2), (3.3) and Lemma 2.3 we have that
In view of the fact that the sequence \(\{x_{n}\}\) is bounded, without loss of generality, we assume that \(M:=\sup\{\x_{n}z\\}\), therefore,
where \(\sigma_{n}=2\alpha_{n} \langle(f(x_{n})z),j(x_{n+1}z)\rangle +2\omega_{n}LL_{*}M^{2}\).
From Lemma 2.2 and (3.4) we shall obtain that
which means that the consequence \(\{x_{n}\}\) converges strongly to z. The proof is complete. □
Theorem 3.3
Let E be a uniformly convex and 2uniformly smooth Banach space. Assume that \(A:E^{*}\rightarrow E\) is an LLipschitz continuous monotone mapping such that \(C_{\min}\cap (AJ)^{1}(0) \neq\emptyset\). Then, for any \(x_{0}\in E\), the sequence \(\{x_{n}\}\) defined by
converges strongly to an element \(z\in(AJ)^{1}(0)\).
Proof
Similar to the proof in Theorem 3.2, we can obtain that the sequences \(\{x_{n}\}\) and \(\{AJx_{n}\}\) are bounded. Furthermore, we have that \(\lim_{n\rightarrow\infty}\sup\langle x_{n}z,j(x_{n+1}z)\rangle\leq0\), where \(z\in C_{\min}\cap (AJ)^{1}(0) \).
In addition, the recurrence (3.5) can be rewritten as
It is easy to see that \(\x_{n+1}x_{n}\=(1\alpha_{n})\omega_{n}\AJx_{n}\ \rightarrow0\) as \(\alpha_{n}\rightarrow0\).
From the recursion (3.5) and Lemma 2.4 we have that
where \(M:=\sup\{\x_{n}z\\}\). It follows from Lemma 2.2 that \(\lim_{n\rightarrow\infty}\x_{n}z\=0\), which means that the sequence \(\{x_{n}\}\) converges strongly to an element \(z\in(AJ)^{1}(0)\). The proof is complete. □
According to Zegeye [1] and Liu [32], for a mapping \(T:E\rightarrow E^{*}\), a point \(x^{*}\in E\) is called a Jfixed point of T if and only if \(Tx^{*}=Jx^{*}\) and T is called semipseudo if and only if \(A:=JT\) is monotone. We can observe that a zero point of A is the Jfixed point of a semipseudo mapping. If E is a Hilbert space, the semipseudo mapping and the Jfixed point coincide with a pseudocontractive mapping and a fixed point of pseudocontraction, respectively. In the case that the semipseudo mapping T is from \(E^{*}\) to E, we have that \(AJ:=(J^{1}T)J\) is monotone and the Jfixed point set is denoted by \(F_{J}(T)=\{x\in E, x=TJx\}\). We have the following corollaries for semipseudo mappings from \(E^{*}\) to E.
Corollary 3.4
Let E be a uniformly convex and 2uniformly smooth Banach space. Assume that \(T:E^{*}\rightarrow E\) is an LLipschitz continuous semipseudo mapping such that \(C_{\min}\cap F_{J}(T)\neq\emptyset\) and \(f:E\rightarrow E\) is a piecewise function defined as (C2). Then, for any \(x_{0}\in E\), the sequence \(\{x_{n}\}\) defined by
converges strongly to an element \(z\in F_{J}(T)\).
Corollary 3.5
(Zegeye [1])
Let E be a uniformly convex and 2uniformly smooth Banach space. Assume that \(A:E^{*}\rightarrow E\) is an LLipschitz continuous monotone mapping such that \(C_{\min}\cap (AJ)^{1}(0) \neq\emptyset\). Then, for any \(u\in E\), the sequence \(x_{n}\) defined by
converges strongly to an element \(z\in(AJ)^{1}(0)\).
Proof
Take \(f(x)\equiv u\) in Theorem 3.2, the result is obtained. □
If we change the role of E and \(E^{*}\), then we shall obtain the following results.
Theorem 3.6
Let E be a uniformly convex and 2uniformly smooth Banach space. Assume that \(A:E\rightarrow E^{*}\) is an LLipschitz continuous monotone mapping such that \(C_{\min}\cap(AJ^{1})^{1}(0)\neq\emptyset\). Then, for any \(x_{0}\in E\), the sequence \(\{x_{n}\}\) defined by
converges strongly to an element \(z\in(AJ^{1})^{1}(0)\).
Theorem 3.7
(Zegeye [1])
Let E be a uniformly convex and 2uniformly smooth Banach space. Assume that \(A:E\rightarrow E^{*}\) is an LLipschitz continuous monotone mapping such that \(C_{\min}\cap(AJ^{1})^{1}(0)\neq\emptyset\). Then, for any \(u\in E\), the sequence \(\{x_{n}\}\) defined by
converges strongly to an element \(z\in(AJ^{1})^{1}(0)\).
We give below two examples in order to show that the conditions of explicit iterative Algorithm (3.2) are easily satisfied.
Example 1
We take the parameters as follows:
It is easy to verify that

(1)
\(\lim_{n\rightarrow\infty}\alpha_{n}=0\), \(\sum_{n=1}^{\infty}\alpha_{n}=\infty\);

(2)
\(\lim_{n\rightarrow\infty}\frac{\omega_{n}}{\alpha_{n}}=0\) and \(\sum_{n=1}^{\infty}\omega_{n}<\infty\).
Example 2
We take the parameters as follows:
It is easy to verify that

(1)
\(\lim_{n\rightarrow\infty}\alpha_{n}=0\), \(\sum_{n=1}^{\infty}\alpha_{n}=\infty\);

(2)
\(\lim_{n\rightarrow\infty}\frac{\omega_{n}}{\alpha_{n}}=0\) and \(\sum_{n=1}^{\infty}\omega_{n}<\infty\).
4 Applications
In this section, we consider the constrained convex minimization problems and the solution of Hammerstein integral equations as the applications of our main result which is proposed in Sect. 3.
4.1 Application to constrained convex minimization problems
In this subsection, we will consider the following minimization problem:
where C is a nonempty closed convex subset of E, and \(h:C\rightarrow R\) is a realvalued convex function. Assume that problem (4.1) is consistent (i.e., its solution set is nonempty). According to Diop et al. [21], \(x\in E\) is a minimizer of h if and only if \(0 \in\partial h(x)\).
Lemma 4.1
Let E be a real normed smooth space and \(h:E\rightarrow\mathbb{R}\) be a differential convex function. Assume that the function h is bounded, then the subdifferential map \(\partial h:E\rightarrow\mathbb{R}\) is bounded and the following inequality holds:
Proof
Define \(g:=h\frac{1}{2} \Vert \cdot \Vert ^{2}\), then \(h=g+\frac{1}{2} \Vert \cdot \Vert ^{2}\). Since h and \(\Vert \cdot \Vert ^{2}\) are differential, so g is differential and the subdifferential of g is denoted by \(\partial g=\partial hJ\). Let \(x\in E\), we can get from the definition of ∂g that
which means that
Exchanging x and y in the above inequality (4.2), we have that
Adding the above inequalities (4.2) and (4.3), we get that
This completes the proof. □
Remark 4.2
From Lemma 4.1, the subdifferential ∂h is monotone, we can also get that \(T=J\partial h\) is a semipseudo mapping from E to \(E^{*}\).
Consequently, the following theorems are obtained.
Theorem 4.3
Let E be a uniformly convex and 2uniformly smooth real Banach space. Assume that \(h:E\rightarrow\mathbb{R}\) is a proper, convex, bounded, and coercive function such that \(C_{\min}\cap (\partial hJ)^{1}(0)\neq\emptyset\) and \(f:E\rightarrow E\) is a piecewise function defined as (C2). Then, for any \(x_{0}\in E\), the sequence \(\{x_{n}\}\) defined by
converges strongly to an element \(x^{*}\in(\partial h J)^{1}(0)\), that is, \(Jx^{*}\in(\partial h)^{1}(0)\). Then function h has a unique minimizer \(Jx^{*}\in E^{*}\) and the sequence \(\{x_{n}\}\).
Theorem 4.4
Let E be a uniformly convex and 2uniformly smooth real Banach space. Assume that \(h:E\rightarrow\mathbb{R}\) is a proper, convex, bounded, and coercive function such that \(C_{\min}\cap (\partial hJ)^{1}(0)\neq\emptyset\). Then, for any \(x_{0}\in E\), the sequence \(\{x_{n}\}\) defined by
converges strongly to an element \(x^{*}\in(\partial h J)^{1}(0)\), that is, \(Jx^{*}\in (\partial h)^{1}(0)\).
4.2 Application to solution of Hammerstein integral equations
An integral equation (generally nonlinear) of Hammerstein type has the form
where the unknown function u and the inhomogeneous function w lie in a Banach space E of measurable realvalued functions.
By simple transformation, (4.4) shall be written as
which can be illustrated, without loss of generality, as
For the case of a real Hilbert space H, for \(F, K:H\rightarrow H\), Chidume and Zegeye [33] defined an auxiliary map on the Cartesian product \(E:=H\times H\), \(T:E\rightarrow E\) by
It is known that
They obtained strong convergence of an iterative algorithm defined in the Cartesian product space E to a solution of Hammerstein Eq. (4.5).
In a Banach space more general than a Hilbert space, Zegeye [34], Chidume and Idu [35] introduced the operator \(T:E\times E^{*}\rightarrow E^{*}\times E\):
where \(F:E\rightarrow E^{*}\) and \(K:E^{*}\rightarrow E\) are monotone mappings and \(J_{*}\) is the normalized duality map from \(E^{*}\) to E. They proved that the mapping \(A:=JT\) defined by \(A[u,v]:=[Fuv, Kv+u]\) is monotone and \(u^{*}\) is a solution (when they exist) of the Hammerstein equation \(u+KFu=0\) if and only if \((u^{*},v^{*})\) is a zero point of A, where \(v^{*}=Fu^{*}\). Applying our Theorem 3.2, the following theorems shall be obtained.
Theorem 4.5
Let E be a uniformly convex and 2uniformly smooth Banach space. Assume that \(F:E\rightarrow E^{*}\), \(K:E^{*}\rightarrow E\) are Lipschitz continuous monotone mappings such that Hammerstein Eq. (4.5) is solvable and \(f_{1}:E\rightarrow E\), \(f_{2}:E^{*}\rightarrow E^{*}\) are two piecewise functions defined as (C2). Then, for \((u_{0},v_{0})\in E\times E^{*}\), the sequences \(\{u_{n}\}\) and \(\{v_{n}\}\) defined by
converge strongly to \(u^{*}\) and \(v^{*}\), respectively, where \(u^{*}\) is a solution of \(u+KFu=0\) with \(v^{*}=Fu^{*}\).
Theorem 4.6
Let E be a uniformly convex and 2uniformly smooth Banach space. Assume that \(F:E\rightarrow E^{*}\), \(K:E^{*}\rightarrow E\) are Lipschitz continuous monotone mappings such that Hammerstein Eq. (4.5) is solvable. Then, for \((u_{0},v_{0})\in E\times E^{*}\), the sequences \(\{u_{n}\}\) and \(\{v_{n}\}\), defined by
converge strongly to \(u^{*}\) and \(v^{*}\), respectively, where \(u^{*}\) is a solution of \(u+KFu=0\) with \(v^{*}=Fu^{*}\).
5 Numerical example
In the sequel, we give a numerical example to illustrate the applicability, effectiveness, efficiency, and stability of our viscosity iterative algorithm (VIA). We have written all the codes in Matlab R2016b and they are preformed on a LG dual core personal computer.
5.1 Numerical behavior of VIA
Example
Let \(E=\mathbb{R}\), \(C=E\). Let \(A, J:\mathbb {R}\rightarrow\mathbb{R}\) be the mappings defined as
\(f:C\rightarrow C\) be defined as
Thus, for \(x,y\in\mathbb{R}\), we have
Hence, A is \(a\)Lipschitz continuous monotone, J is 1Lipschitz continuous.
Two groups of consequences of parameters are tested here as follows:
Case I: \(\alpha_{n}=\frac{1}{(n+1)^{p}}\), \(\omega_{n}=\frac{1}{n(n+1)^{p}}\), \(p\in[1/8,1/4,1/3,1/2,1]\);
Case II: \(\alpha_{n}=\frac{1}{\ln^{p}(n+1)}\), \(\omega_{n}=\frac{1}{n\ln ^{p}(n+1)}\), \(p\in[1/8,1/4,1/3,1/2,1]\).
We can see that all these parameters satisfy the conditions:

(i)
\(\lim_{n\rightarrow\infty}\alpha_{n}=0\), \(\sum_{n=1}^{\infty}\alpha_{n}=\infty\);

(ii)
\(\omega_{n}=o(\alpha_{n})\), \(\sum_{n=1}^{\infty}\omega_{n}<\infty\).
We will use the sequence \(D_{n}=10^{8}\times\x_{n+1}x_{n}\^{2}\) to study the convergence of our explicit viscosity iterative algorithm (VIA). The convergence of \(D_{n}\) to 0 implies that the sequence \(\{x_{n}\}\) converges to \(x^{*}\in(AJ)^{1}(0)\). To illustrate the behavior of the algorithm, we have performed experiments for both number of iterations (iter.) and elapsed execution time (CPU time—in the second). Figures 1–18 and Table 1 describe the behavior of \(D_{n}\) generated by VIA for the aforementioned groups of parameters. It is obvious that if \(x_{n}\in(AJ)^{1}(0)\), then the process stops and \(x_{n}\) is the solution of problem \(0\in AJu\); otherwise, we shall compute the following viscosity algorithm:
where a is different choices from \([\frac{1}{100}, \frac{1}{2}, 2]\).
In these figures, xaxes represent the number of iterations while yaxes represent the value of \(D_{n}\). We can summarize the following observations from these figures:

(a)
The rate of \(D_{n}=10^{10}\times\x_{n+1}x_{n}\^{2}\) generated by our algorithm (VIA) depends strictly on the convergence rate of parameter \(\{\alpha_{n}\}\) and the Lipschitz coefficient of a continuous monotone operator.

(b)
Our viscosity iterative algorithm (VIA) works well for parameter sequences of \(\{\alpha_{n}\}\) being fast convergent to 0 as \(n\rightarrow\infty\). In general, if \(D_{n}=\ x_{n+1}x_{n}\^{2}\), then the error of \(D_{n}\) can be obtained approximately equal to 10^{−16}. When \(D_{n}\) obtains to this error, then it becomes unstable. The best error of \(D_{n}\) can be obtained approximately equal to 10^{−30} when \(a=2\).

(c)
For the second group parameter \(\{\alpha_{n}\}\) being slowly convergent to 0 as \(n\rightarrow\infty\), then \(D_{n}\) is slightly increasing in the early iterations, and after that, it is seen to be almost stable.
5.2 Comparison of VIA with other algorithms
In this part, we present several experiments in comparison with other algorithms. Two methods used in comparison are the generalized Mann iteration method (GMIM) (Chidume et al. [35], Algorithm 1) and the regularization method (RM) (Zegeye [1], Algorithm 2). The RM requires to previously know a constant u. For experiments, we choose the same sequences \(\alpha _{n}=\frac{1}{n+1}\) and \(\omega_{n}=\frac{1}{n(n+1)}\) in these algorithms. The condition \(\x_{n+1}x_{n}\^{2}\leq TOL\) is chosen to be as the stopping criterion. The following tables are comparisons of VIA, RM, GMIM with different choices of a. The numerical results are showed in Table 2.
From these tables, we can see that the RM is the best. The GMIM is the most timeconsuming, and the reasonable explanation is the fact that at each step the GMIM has no contractive parameters (coefficients) for obtaining the next step which can take lower convergence rate, while the convergence rate of the RM depends strictly on the previous constant u and the initial value \(x_{0}\). In comparing with other two methods, VIA seems to have competitive advantage. However, the main advantage of VIA is that the viscosity iterative algorithm works more stable than other methods and it is done in Banach spaces much more general than Hilbert spaces.
6 Conclusion
Let E be a nonempty closed uniformly convex and 2uniformly smooth Banach space with dual \(E^{*}\). We construct some implicit and explicit algorithms for solving the equation \(0\in AJu\) in the Banach space E, where \(A:E^{*}\rightarrow E\) is a monotone mapping and \(J:E\rightarrow E^{*}\) is the normalized duality map which plays an indispensable role in this research paper. The advantages of the algorithm are that the resolvent operator is not involved, which makes the iteration simple for computation; moreover, the zero point problem of monotone mappings is extended from Hilbert spaces to Banach spaces. The proposed algorithms converge strongly to a zero of the composed mapping AJ under concise parameter conditions. In addition, the main result is applied to approximate the minimizer of a proper convex function and the solution of Hammerstein integral equations. To some extent, our results extend and unify some results considered in Xu [12], Zegeye [1], Chidume and Idu [2], Chidume [3, 35], and Ibarakia and Takahashi [22].
References
Zegeye, H.: Strong convergence theorems for maximal monotone mappings in Banach spaces. J. Math. Anal. Appl. 343, 663–671 (2008)
Chidume, C.E., Kennedy, O.I.: Approximation of zeros of bounded maximal monotone mappings, solutions of Hammerstein integral equations and convex minimization problem. Fixed Point Theory Appl. 2016, 97 (2016)
Chidume, C.E., Romanus, O.M., Nnyaba, U.V.: A new iterative algorithm for zeros of generalized Phistrongly monotone and bounded maps with application. Br. J. Math. Comput. Sci. 18(1), 1–14 (2016)
Zarantonello, E.H.: Solving functional equations by contractive averaging. Tech. Rep. 160, US. Army Math, Madison, Wisconsin (1960)
Minty, G.J.: Monotone (nonlinear) operators in Hilbert spaces. Duke Math. J. 29(4), 341–346 (1962)
Kac̆urovskii, R.I.: On monotone operators and convex functionals. Usp. Mat. Nauk 15(4), 213–215 (1960)
Chidume, C.E.: An approximation method for monotone Lipschitz operators in Hilbert spaces. J. Aust. Math. Soc. Ser. A 41, 59–63 (1986)
Berinde, V.: Iterative Approximation of Fixed Points. Lecture Notes in Mathematics. Springer, London (2007)
Martinet, B.: Regularisation d’inequations variationnelles par approximations successives. Rev. Fr. Inform. Rech. Oper. 4, 154–158 (1970)
Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877–898 (1976)
Chidume, C.E.: An approximation method for monotone Lipschitzian operators in Hilbertspaces. J. Aust. Math. Soc. Ser. A 41, 59–63 (1986)
Xu, H.K.: A regularization method for the proximal point algorithm. J. Glob. Optim. 36, 115–125 (2006)
Tang, Y.: Strong convergence of viscosity approximation methods for the fixedpoint of pseudocontractive and monotone mappings. Fixed Point Theory Appl. 2013, 273 (2013). https://doi.org/10.1186/168718122013273
Qin, X.L., Kang, S.M., Cho, Y.J.: Approximating zeros of monotone operators by proximal point algorithms. J. Glob. Optim. 46, Article ID 75 (2010)
Browder, F.E.: Nonlinear mappings of nonexpansive and accretivetype in Banach spaces. Bull. Am. Math. Soc. 73, 875–882 (1967)
Alber, Y.: Metric and generalized projection operators in Banach spaces: properties and applications. In: Kartsatos, A.G. (ed.) Theory and Applications of Nonlinear Operators of Accrective and Monotone Type, pp. 15–50. Dekker, New York (1996)
Chidume, C.E.: Geometric Properties of Banach Spaces and Nonlinear Iterations. Lectures Notes in Mathematics. Springer, London (2009)
Chidume, C.E.: Iterative approximation of fixed points of Lipschitzian strictly pseudocontractive mappings. Proc. Am. Math. Soc. 99(2), 283–288 (1987)
Agarwal, R.P., Meehan, M., O’Regan, D.: Fixed Point Theory and Applications. Cambridge Tracts in Mathematics, vol. 141. Cambridge University Press, Cambridge (2001)
Reich, S.: A weak convergence theorem for alternating methods with Bergman distance. In: Kartsatos, A.G. (ed.) Theory and Applications of Nonlinear Operators of Accrective and Monotone Type. Lecture Notes in Pure and Appl. Math., vol. 178, pp. 313–318. Dekker, New York (1996)
Diop, C., Sow, T.M.M., Djitte, N., Chidume, C.E.: Constructive techniques for zeros of monotone mappings in certain Banach space. SpringerPlus 4, 383 (2015)
Ibaraki, T., Takahashi, W.: A new projection and convergence theorems for the projections in Banach spaces. J. Approx. Theory 149(1), 1–14 (2007)
Cioranescu, I.: Geometry of Banach Spaces, Duality Mappings and Nonlinear Problems. Kluwer Academic, Dordrecht (1990)
Xu, Z.B., Roach, G.F.: Characteristic inequalities of uniformly convex and uniformly smooth Banach spaces. J. Math. Anal. Appl. 157, 189–210 (1991)
Xu, H.K.: Inequalities in Banach spaces with applications. Nonlinear Anal. 16(12), 1127–1138 (1991)
Zălinescu, C.: On uniformly convex functions. J. Math. Anal. Appl. 95, 344–374 (1983)
Kamimura, S., Takahashi, W.: Strong convergence of a proximaltype algorithm in Banach spaces. SIAM J. Optim. 13(3), 938–945 (2002)
Tan, K.K., Xu, H.K.: Approximating fixed points of nonexpansive mappings by Ishikawa iteration process. J. Math. Anal. Appl. 178(2), 301–308 (1993)
Takahashi, W.: Nonlinear Functional AnalysisFixed Point Theory and Its Applications. Yokohama Publishers, Yokohama (2000)
Osilike, M.O., Aniagbosor, S.C.: Weak and strong convergence theorems for fixed points of asymptotically nonexpansive mapping. Math. Comput. Model. 32(10), 1181–1191 (2000)
Alber, Y., Ryazantseva, I.: Nonlinear Ill Posed Problems of Monotone Type. Springer, London (2006)
Liu, B.: Fixed point of strong duality pseudocontractive mappings and applications. Abstr. Appl. Anal. 2012, Article ID 623625 (2012). https://doi.org/10.1155/2012/623625
Chidume, C.E., Zegeye, H.: Approximation of solutions of nonlinear equations of monotone and Hammersteintype. Appl. Anal. 82(8), 747–758 (2003)
Zegeye, H.: Iterative solution of nonlinear equations of Hammerstein type. J. Inequal. Pure Appl. Math. 4(5), Article ID 92 (2003)
Chidume, C.E., Idu, K.O.: Approximation of zeros of bounded maximal monotone mappings, solutions of Hammerstein integral equations and convex minimization problems. Fixed Point Theory Appl. 2016, 97 (2016). https://doi.org/10.1186/s1366301605828
Acknowledgements
The author expresses their deep gratitude to the referee and the editor for his/her valuable comments and suggestions which helped tremendously in improving the quality of this paper and made it suitable for publication.
Funding
This article is funded by the National Science Foundation of China (11471059), the Science and Technology Research Project of Chongqing Municipal Education Commission (KJ1706154), and the Research Project of Chongqing Technology and Business University (KFJJ2017069).
Author information
Authors and Affiliations
Contributions
The author worked jointly in drafting and approving the final manuscript. The author read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The author declares that they have no competing interests.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Tang, Y. Viscosity iterative algorithm for the zero point of monotone mappings in Banach spaces. J Inequal Appl 2018, 254 (2018). https://doi.org/10.1186/s1366001818451
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s1366001818451