Abstract
It is meaningful and valuable to find common fixed points of different nonexpansive-type operators, which are associated with variational inequalities, integral equations, image process and other optimization problems in real life. The purpose of this paper is to suggest and consider a class of general semi-implicit iterative methods involving semi-implicit rule and inaccurate computing errors, which extend the iterative algorithm introduced by Ali et al. in 2020. Using Liu’s lemma, we analyze convergence and stability of the new iterative approximations for common fixed points of three different nonexpansive-type operators. Furthermore, we provide convergence rates of the new iterations and some numerical examples to illustrate the efficiency and stability of the new iterative schemes. As an application of our main results presented in this paper, we use the proposed iterative schemes to solve the known Stampacchia variational inequality.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Let \({{\mathbb {X}}}\) be a Hilbert space and \(K\subset {{\mathbb {X}}}\) be a nonempty closed convex bounded subset. For \(i=1, 2, 3\), suppose that \({\Phi _i}: K\rightarrow K\) is a nonexpansive-type operator with Lipschitz coefficient \(\theta _i\in [0, 1]\), that is, \(\left\| \Phi _i(x)-\Phi _i(y)\right\| \le \theta _i\left\| x-y\right\| \) for each \(x, y\in K\). In this paper, based on the iterative scheme (in short, JF) due to Ali et al. (2020), we introduce and investigate the following general semi-implicit (also named as implicit midpoint rule) approximation (in short, JFESD) with errors for \({\Phi _i}\) \((i=1, 2, 3)\):
where \(\{r_n\},\{s_n\}\subseteq [0,1]\) are two real number sequences, and \(\{d_n\}\), \(\{e_n\}\) and \(\{h_n\}\) are three errors to take into account some possible inexact computations of the nonexpansive-type operator points, which satisfy hypothesis (H):
-
(i)
\(d_n=d_n^\prime +d_n^{\prime \prime }\) with \(\lim _{n\rightarrow \infty }\Vert d_n^\prime \Vert =0\) and \(\sum _{n=0}^\infty \Vert d_n^{\prime \prime }\Vert <\infty \);
-
(ii)
\(\lim _{n\rightarrow \infty } \Vert e_n\Vert =0 \); (iii) \(\sum ^{\infty }_{n=0} \Vert h_n\Vert < \infty \).
Some special cases of the JFESD (1.1) can be found as follows:
-
(Case 1) While \(d_n, e_n, h_n\equiv 0\) for all \(n\in {{\mathbb {N}}}\), the JFESD (1.1) reduces to the following semi-implicit iteration (in short, JFSD) for three different nonexpansive-type operators:
$$\begin{aligned} \left\{ \begin{array}{l}\displaystyle \displaystyle {\varrho _{n + 1}} = {\Phi _1} \left( \left( 1-{r_n} \right) {\varsigma _n} + {r_n}{\Phi _1}(\varsigma _n) \right) , \\ \displaystyle {\varsigma _n} = {\Phi _2} \left( \frac{{{\vartheta _n} + {\varsigma _n}}}{2} \right) , \\ \displaystyle {\vartheta _n}={\Phi _3} \left( \left( 1-{s_n} \right) \frac{{\vartheta _n}+{\varrho _n}}{2}+{s_n}{\Phi _3} \left( \frac{{\vartheta _n}+{\varrho _n}}{2} \right) \right) . \end{array} \right. \end{aligned}$$(1.2) -
(Case 2) If \(\Phi _1=\Phi _2=\Phi _3=\Phi \), then the JFESD (1.1) is equivalent to a class of semi-implicit scheme (in short, JFES) with errors for a nonexpansive-type operator as follows:
$$\begin{aligned} \left\{ \begin{array}{l} \displaystyle {\varrho _{n + 1}} = {\Phi } \left( \left( 1 - {r_n} \right) {\varsigma _n} + {r_n}{\Phi }(\varsigma _n) + {r_n}{d_n} \right) , \\ \displaystyle {\varsigma _n} = {\Phi } \left( \frac{{{\vartheta _n} + {\varsigma _n}}}{2} \right) + {e_n}, \\ \displaystyle {\vartheta _n}={\Phi } \left( \left( 1-{s_n} \right) \frac{{\vartheta _n}+{\varrho _n}}{2}+{s_n}{\Phi } \left( \frac{{\vartheta _n}+{\varrho _n}}{2} \right) \right) +{h_n}. \end{array} \right. \end{aligned}$$(1.3) -
(Case 3) When \(d_n=e_n=h_n\equiv 0\) for each \(n\in {{\mathbb {N}}}\), the JFES (1.3) becomes the following new semi-implicit iterative process (in short, JFS) for a nonexpansive-type operator:
$$\begin{aligned} \left\{ \begin{array}{l} \displaystyle {\varrho _{n + 1}} = {\Phi } \left( \left( 1 - {r_n} \right) {\varsigma _n} + {r_n}{\Phi }(\varsigma _n) \right) , \\ \displaystyle {\varsigma _n} = {\Phi } \left( \frac{{{\vartheta _n} + {\varsigma _n}}}{2} \right) , \\ \displaystyle {\vartheta _n}={\Phi } \left( \left( 1-{s_n} \right) \frac{{\vartheta _n}+{\varrho _n}}{2}+{s_n}{\Phi } \left( \frac{{\vartheta _n}+{\varrho _n}}{2} \right) \right) . \end{array} \right. \end{aligned}$$(1.4)
Remark 1.1
(i) In regard to nonexpansive-type operator \(\Phi _i\) for \(i=1,2,3\) in (1.1)–(1.4), one can see that \(\Phi _i\) is nonexpansive if the Lipschitz coefficient \(\theta _i=1\); and when \(\theta _i\in [0, 1)\), \(\Phi _i\) becomes a contraction operator. Furthermore, if \(\theta _i>0\) for \(i=1,2,3\), then \(\Phi _i\) is called \(\theta _i\)-Lipschitzian continuous. In other words, for \(i=1,2,3\), nonexpansive-type operator with Lipschitz coefficient \(\theta _i\) is said to be \(\theta _i\)-Lipschitz continuous operator, here \(\theta _i\le 1\).
(ii) We note that the above iterative processes (1.1)–(1.4) are brand new and not reported in the literature.
Example 1.1
It is well known that the projection operator \(P_K: {{\mathbb {R}}}^n\rightarrow {{\mathbb {R}}}^n\) defined by
is a nonexpansive-type operator with Lipschitz coefficient 1 and it is widely used to solve variational inequality, which is an important branch of optimization and was introduced in the early sixties by the study of mechanics.
Remark 1.2
For some \(i=1,2,3\), when \(\Phi _i=P_K\), the projection operator in Example 1.1, it is easy to see that the iterations (1.1)–(1.4) are still different from Algorithms 2.2–2.6 in Noor (2007).
As we all know, research of nonexpansive-type operators has a long history, one of the most important fields is to find fixed points via applying fixed point theory. In fact, many problems can be formulated as fixed point models or can be solved by fixed point theory. For example, the whole world has been profoundly impacted by the novel coronavirus since 2019 and it is imperative to depict the spread of the coronavirus. Panda et al. (2021) applied fractional derivatives to improve the 2019-nCoV/SARS-CoV-2 models, and by means of fixed point theory, existence and uniqueness of solutions of the models were proved. More applications of fixed point theory, such as equations, image process and other optimization problems, one can refer to Cacciapaglia and Sannino (2021); Ali et al. (2022); Panda et al. (2020); Harker and Pang (1990); Ali et al. (2020); Maldar (2021); Hanjing and Suantai (2020) and the reference therein.
In 1922, S. Banach first used the Picard iteration method to create a fixed point theorem in metric spaces, that is the famous Banach contraction principle. After that, many scholars introduced a lot of iteration methods, such as Mann iteration (in short, MANN) (Mann 1953), Ishikawa iterative process (in short, ISHIKAWA) (Ishikawa 1974), Noor three-step iterative approximation scheme (in short, NOOR) (Noor 2007; Noor and Yao 2007), novel fixed point algorithm (in short, SAKURAI) (Sakurai and Iiduka 2014) and so on, to approximate fixed points of various nonexpansive-type operators and obtained others fixed point theorems, see (Thakur et al. 2016) and the reference therein. Recently, to answer the question: Is it possible to define a new iterative scheme, whose rate of convergence is better than that of some known and leading iterative schemes, for generalized nonexpansive-type operators due to Hardy and Rogers? Ali et al. (2020) considered the JF as follows:
where \(r_n,s_n \in (0,1)\) are two sequences, and studied the conditions of weak and strong convergence for (1.6) to a generalized self-map \(\Phi \) on a nonempty closed convex subset of a Banach space. The numerical examples in Ali et al. (2020) indicate that the JF (1.6) is much faster than some existing algorithms.
Remark 1.3
It is worth noting that the semi-implicit terms in the second and third equations of the JFS (1.4) replace the corresponding terms of the JF (1.6).
On the one hand, to solve nonlinear problems arising in mechanics, economics, optimization, differential equations and others mathematics and engineering problems, variational inequalities mentioned in Example 1.1 have become efficient tools and have been paid great attention by many scholars. See, for example, Daniele et al. (2003); Harker and Pang (1990); Noor and Yao (2007); Phannipa and Atid (2021); Noor (2007) and the reference therein.
In 1964, Stampacchia (1964) considered the following variational inequality problem of finding a point \(u \in K\) such that
where K is a nonempty, closed and convex set of a real Hilbert space \({\mathbb {X}}\), and \(\langle \cdot ,\cdot \rangle \) is the inner product in \({\mathbb {X}}\), \(F: K \rightarrow K\) is a specific nonlinear operator. The set of solutions for the variational inequality (1.7) is denoted by VI(K, F). As everyone knows that the problem (1.7) is equivalent to the following fixed point problem:
here \(\kappa \) is a positive constant and \(P_K\) is the projection operator formulated as in (1.5). There are many methods to solve the inequality problems of the form (1.7) (see Harker and Pang 1990), which include excellent numerical behaviors based on projection and contraction operator techniques.
For seeking common fixed points of nonexpansive-type operators and variational inequalities, Noor and Yao (2007) introduced some iterative schemes with projection operators and proved convergence of the iterative algorithms. To get strong convergence in more weak conditions, Phannipa and Atid (2021) introduced an iteration scheme and showed that the iteration scheme strongly converges to a common fixed point of nonexpansive-type operators and variational inequalities in Hilbert spaces. Very recently, based on the fundamental relation between variational inequality and fixed point problem presented in (1.8), Maldar (2021) reformulated the NOOR, JF (1.6) and some other iterative algorithms to approximate the common fixed points of generalized nonexpansive-type mappings and solutions of variational inequality problems.
On the other hand, the semi-implicit rule is a powerful numerical method for solving ordinary differential equations (Deuflhard 1985), differential algebraic equations (Schneider 1993). In addition, as an approximation method, some authors applied semi-implicit rule to iterative scheme of nonexpansive-type operators. Alghamdi et al. (2014) established a semi-implicit rule for nonexpansive-type operators and proved weak convergence of the iteration in Hilbert spaces, and used the algorithm to solve a nonlinear time-dependent evolution equation. Based on the semi-implicit rule, Luo and Cai (2017) and Aibinu et al. (2018) developed viscosity algorithms for nonexpansive-type operators and stated that these algorithms can strongly converge to a fixed point in smooth Banach spaces.
While calculating every iteration, errors will occur naturally, so it is worth of studying convergence of algorithms with errors. Liu (1995) first established ISHIKAWA and MANN with errors and proved that the iterations strongly converge to the unique solution of the accretive operator equations in Banach spaces. Following the work of Liu (1995), Chang et al. (2003) studied ISHIKAWA with mixed errors of nonexpansive-type operators, and found necessary and sufficient conditions for the iterative sequence to strongly converge to a fixed point in Banach spaces. Ni and Yao (2015) constructed a modified ISHIKAWA with errors for nonexpansive-type operator, and obtained strong convergence of the iterative algorithm in reflexive Banach spaces under suitable conditions.
By the importance of stable and unstable equilibria are really different in dynamics systems, the stability of equilibrium points should be investigated seriously. Lemaire (1996) may be the first one to investigate the stability of the iteration method for nonexpansive-type operators. In 2017, Alber (2017) proved weak and strong convergence and stability of some iteration schemes with perturbations in a Banach space. Lately, Li and Lan (2019) proposed convergence and stability analysis of new Picard–Mann iteration processes with errors for the semi-implicit rules of two different nonexpansive-type operators, and proved iterative approximation of solutions for a class of optimal control problems with elliptic boundary value constraint. Furthermore, Li and Lan (2019) gave numerical examples to show that the new Picard–Mann iteration process with mixed errors is more effective than the Picard–Mann semi-implicit iteration (in short, PMMI) with mixed errors, the Picard–Mann semi-implicit iterative process (in short, PMI) and other related iterative processes for a nonexpansive-type operator. And then, Ali et al. (2021) defined Picard’s three-step iteration for approximating fixed points of Zamfirescu operators which contain contraction mappings, and proved the iteration is almost T-stable and compared convergence of the three-step iteration with that of some leading iterative processes.
On the basis of Ali et al. (2020), Li and Lan (2019) and other work mentioned above, to obtain a fast and stable iterative scheme of nonexpansive-type operators and to solve the variational inequality (1.7), we explored the JFESD (1.1) and its special case (1.2)–(1.4). Then, we analyze convergence and stability of the sequences generated by (1.1)–(1.4) in Hilbert spaces, and obtain convergence rate of the schemes (1.1)–(1.4). Finally, we provide some numerical examples to illustrate that our schemes are more effective than other aforesaid known iterative schemes and apply the general semi-implicit approximation (1.1) to solve Stampacchia variational inequality (1.7).
2 Main results
In this section, we introduce a useful definition and an important lemma, and prove convergence and stability of the JFESD (1.1). Furthermore, using our iteration scheme JFESD (1.1), an integral equation as a numerical example shall be solved.
Definition 2.1
Let \(({{\mathbb {X}}},d)\) be a metric space, \(\Phi : {{\mathbb {X}}} \rightarrow {{\mathbb {X}}}\) be a given operator and \(\varrho _0 \in {{\mathbb {X}}}\). Assume that the iteration scheme \(\{\varrho _n\}\) generated by
converges to a fixed point u of \(\Phi \), i.e., \(u\in Fix(\Phi ): =\left\{ x\in {{\mathbb {X}}}\vert \, \Phi (x)=x\right\} \). Taking \(\{\varsigma _n\}\) be an arbitrary sequence in \({{\mathbb {X}}}\) and setting \(\epsilon _n = d\left( \varsigma _{n+1}, f(\Phi ,\varsigma _n)\right) \) for \(n\in {{\mathbb {N}}}\), then the fixed point iteration procedure \(\{\varrho _n\}\) is called \(\Phi \)-stable or stable with respect to \(\Phi \), and \(\lim _{n \rightarrow \infty } \epsilon _n= 0\) if and only if \(\lim _{n \rightarrow \infty } \varsigma _n = u\).
Lemma 2.1
(Liu 1995) Let \(\{a_n\},\{b_n\}\) and \(\{c_n\}\) be three nonnegative real sequences meeting:
with \(t_n\in [0,1]\), \(\sum ^\infty _{n=0}t_n=\infty \), \(b_n=o(t_n)\), and \(\sum ^\infty _{n=0}c_n<\infty \). Then \(\lim _{n \rightarrow \infty }a_n=0\).
In the sequel, we give convergence and stability analysis of the JFESD (1.1) via using Lemma 2.1 and Definition 2.1.
Theorem 2.1
Let K be a nonempty closed convex bounded subset of Hilbert space \({{\mathbb {X}}}\). If for \(i=1,2,3\), \(\Phi _i: K \rightarrow K\) is a nonexpansive-type operator with Lipschitz coefficient \(\theta _i\in [0,1]\) satisfying \(\sum _{i=1}^{3}\theta _i < 3\) and \(Fix(\Phi _1 \cap \Phi _2 \cap \Phi _3) \ne \emptyset \),
then the following statements hold:
-
(i) The iterative sequence \(\{\varrho _n\}\) generated by JFESD (1.1) converges to \(\varrho ^* \in Fix(\Phi _1 \cap \Phi _2 \cap \Phi _3)\) with convergence rate for every step (i.e., \(n\in {\mathbb {N}}\)):
$$\begin{aligned} \rho _n= {\theta _1}{\theta _2}{\theta _3}\cdot \frac{\left[ 1-{r_n}(1-{\theta _1})\right] \left[ 1-{s_n}(1-{\theta _3})\right] }{(2-{\theta _2})\left\{ 2-{\theta _3}\left[ 1-{s_n}(1-{\theta _3}) \right] \right\} }, \end{aligned}$$and there exists a constant \(\rho \in (0, 1]\) such that \(\lim _{n \rightarrow \infty }\rho _n<\rho \).
-
(ii) For any sequence \(\{w_n\} \subset {{\mathbb {X}}}\), \(\lim _{n \rightarrow \infty }w_n = \varrho ^*\) if and only if \(\lim _{n \rightarrow \infty } \epsilon _n = 0\), here \(\{\epsilon _n\}\) is generated by
$$\begin{aligned} \left\{ \begin{array}{l} \displaystyle \epsilon _n = \left\| w_{n+1} - {\Phi _1} \left( \left( 1-{r_n}\right) {\eta _n}+{r_n} {\Phi _1} {\eta _n} +{r_n} {d_n}\right) \right\| , \\ \displaystyle {\eta _n} = {\Phi _2}\left( \frac{\eta _n + \xi _n}{2}\right) +e_n,\\ \displaystyle {\xi _n} = {\Phi _3}\left( \left( 1-s_n\right) \frac{\xi _n+w_n}{2} + s_n \Phi _3\left( \frac{\xi _n+w_n}{2}\right) \right) +h_n. \end{array} \right. \end{aligned}$$(2.1)Scilicet, the JFESD (1.1) is \(\Phi \)-stable.
Proof
First, we prove convergence of the iterative scheme JFESD (1.1). Let \(\varrho ^* \in Fix(\Phi _1 \cap \Phi _2 \cap \Phi _3)\). Then by (1.1), one has
where \(\iota _n=\theta _3\left( 1-{s_n}+\theta _3{s_n}\right) \), this indicates that
Furthermore, it follows from the second formulation of (1.1) that
this implies with (2.2) and \(\iota _n\le \theta _3\) for \(n\in {{\mathbb {N}}}\) that
Taking \(\tau _n={\theta _1} \left( 1-{r_n}+{\theta _1{r_n}}\right) \), then \(\tau _n\le \theta _1\) for \(n\in {{\mathbb {N}}}\) and by (1.1) and (2.3), and \(\{r_n\}, \{s_n\}\subseteq [0,1]\), now we know that for each \(n\in {{\mathbb {N}}}\):
where
which is because \(\tau _n \in [0,\theta _1]\), \(\iota _n \in [0,\theta _3]\), \(\sum ^{3}_{i=1} \theta _i < 3\), \(\theta _i\in [0,1]\) for \(i=1,2,3\), and there exists \(i \in \{1,2,3\}\) such that \(\theta _i<1\), i.e., \(\theta _1 \theta _2 \theta _3<1\). Therefore, one has a lower bound \(t_{*}>0\) of \(\{t_n\} \subseteq [0,1]\), that is \(t_*=\lim \inf \nolimits _{n \rightarrow \infty } t_n \in (0,1]\). Furthermore, we can easily know that \(\sum ^{\infty }_{n=0}t_n=\infty \). Thus it follows from (2.4) that
By Lemma 2.1, the inequality (2.5) yields with the boundedness of \(\{r_n\}\) and the condition (H) that \(\left\| {\varrho _n}-\varrho ^*\right\| \) as \(n \rightarrow \infty \), i.e., the sequence \(\{\varrho _n\}\) generated by the JFESD (1.1) strongly converges to \(\varrho ^*\) with convergence rate in every step:
Next, we prove the iterative scheme JFESD (1.1) is \(\Phi \)-stable. First, we show that if \(\lim _{n \rightarrow \infty }\epsilon _n \rightarrow 0\), then \(\lim _{n \rightarrow \infty } w_n \rightarrow 0\). In fact, it follows from (2.1) that
which implies with (2.5) that
Hence, if \(\lim _{n \rightarrow \infty } \epsilon _n \rightarrow 0\), then from Lemma 2.1 and the given conditions, we get \(\lim _{n \rightarrow \infty }\left\| w_n - w^*\right\| \rightarrow 0\) and \(\lim _{n \rightarrow \infty } w_n = w^*\).
Whereas, if \(\lim _{n \rightarrow \infty } w_n=w^*\), by (2.4) and the assumptions, one knows that
this shows that \(\lim _{n \rightarrow \infty }\epsilon _n \rightarrow 0\). The proof is completed. \(\square \)
From Theorem 2.1, it is easy to obtain the following results to the special cases (1.2)–(1.4) of the JFESD (1.1).
Corollary 2.1
Suppose that \({{\mathbb {X}}}\), K and operator \(\Phi _i\) \((i=1, 2, 3)\) are the same as in Theorem 2.1. Then the sequence \(\{\varrho _n\}\) generated by the JFSD (1.2) converges to \(\varrho ^* \in Fix(\Phi _1 \cap \Phi _2 \cap \Phi _3)\) with convergence rate for \(n \in {\mathbb {N}}\):
and there exists a positive constant \(\rho \) such that \(\rho _n<\rho \le 1\) for any \(n\in {{\mathbb {N}}}\). Moreover, for any sequence \(\{w_n\} \subset {{\mathbb {X}}}\), \(\lim \limits _{n \rightarrow \infty }w_n = w^*\) if and only if \(\lim \limits _{n \rightarrow \infty } \epsilon _n = 0\), here \(\epsilon _n\) is defined by
i.e., the iteration scheme JFSD (1.2) is \(\Phi \)-stable.
Corollary 2.2
Let \({{\mathbb {X}}}\) and K be the same as in Theorem 2.1. If \(\Phi _1=\Phi _2=\Phi _3=\Phi : K \rightarrow K\) is nonexpansive-type operator with Lipschitz coefficient \(\theta \in [0,1)\) and \(Fix(\Phi ) \ne \emptyset \), then the sequence \(\{\varrho _n\}\) generated by the JFES (1.3) converges to \(\varrho ^*\in Fix(\Phi )\) with convergence rate:
for every \(n\in {{\mathbb {N}}}\) and there exists a constant \(\rho \in (0,1]\) such that \(\rho _n<\rho \) for \(n\in {{\mathbb {N}}}\). Furthermore, letting a sequence \(\{\epsilon _n\}\) be decided by
then for any sequence \(\{w_n\} \subset {{\mathbb {X}}}\), \(\lim _{n \rightarrow \infty }w_n =w^*\) if and only if \(\lim \limits _{n \rightarrow \infty } \epsilon _n = 0\) and the iteration scheme JFES (1.3) is called \(\Phi \)-stable.
Corollary 2.3
Assume that \({{\mathbb {X}}}\), K and \(\Phi \) are the same as in Corollary 2.2. then the sequence \(\{x_n\}\) determined by the JFS (1.4) converges to \(\varrho ^*\in Fix(\Phi )\) with convergence rate \(\rho _n\) of (2.6) in every step. Furthermore, for any sequence \(\{w_n\}\subset {{\mathbb {X}}}\), \(\lim _{n \rightarrow \infty }w_n = w^*\) if and only if \(\lim _{n \rightarrow \infty }\epsilon _n = 0\), where \(\epsilon _n\) is confirmed as follows:
that is, the iteration scheme JFS (1.4) is \(\Phi \)-stable.
To verify our results, we give a numerical example as follows.
Example 2.1
We consider a known integral equation, which often arises in many physical problems, defined as
where l and \(a=f(0)\) are real constants, and \(k: {{\mathbb {R}}}\times {{\mathbb {R}}}\rightarrow {{\mathbb {R}}}\) is a given continuous function.
From Eq. (2.7), one can easily decide an operator \(\Phi : {{\mathbb {R}}}\rightarrow {{\mathbb {R}}}\) by
and knows that if \(\sup _{\varrho \in [0,l]} \int _{0}^{\varrho }\left\| k(\varrho ,\varsigma )\right\| d\varsigma <1\), then \(\Phi \) is a nonexpansive-type operator. In fact, for any \(f, g\in {{\mathbb {R}}}\), we have
By Banach contraction mapping principle, the operator \(\Phi \) has a fixed point, which is the solution of Eq. (2.7).
With regard to (2.7) and (2.8), taking \(a=1\), \(l=\frac{9}{10}\) and \(k(\cdot ,\cdot )\equiv 1\), then by simple calculation, one can easily see that \(\sup _{\varrho \in [0,l]} \int _{0}^{\varrho }\left\| k(\varrho ,\varsigma )\right\| d\varsigma =\frac{9}{10}<1\) and an exact solution of the following example of (2.7):
is \(f(\varrho )=e^\varrho \) for every \(\varrho \in \left[ 0,\frac{9}{10}\right] \), which is a fixed point of special operator \(\Phi \) to (2.9). In subsequent work, the exact solution of the particular case (2.9) shall be numerically approximated via using our new iterative schemes JFESD (1.1) and JFSD (1.2). Assume \(\Phi _1=\Phi \), \(\Phi _2=\Phi _3=I\), the identity operator, \(r_n = 0.3\), \(s_n=0.5\), \(d_n^\prime =\frac{n^2}{10^n}\), \(d_n^{\prime \prime }=\frac{n}{10^n}\), \(e_n=\frac{1}{5^n}\), \(h_n=\frac{10}{8^n}\) for each \(n\in {{\mathbb {N}}}\), and the initial function \(f(\varrho )=\varrho \) is given. Then the numerical solutions after some steps are displayed in Figs. 1 and 2, and mean square errors (in short, MSE) of JFESD (1.1) and JFSD (1.2) have been computed in Fig. 3. It is light to see that the iteration schemes JFESD (1.1) and JFSD (1.2) can fastly converge to the exact solution of (2.9), respectively, and although the convergence speed to JFESD (1.1) and JFSD (1.2) are not the same, the numbers of iteration (in short, Iter.) for converging to the precise solution are no more than twenty . These indicate the validity of Theorem 2.1 and Corollary 2.1.
3 Simulation and applications
In this section, using the new iterative schemes presented in this paper and based on Matlab 2020b and R 4.1, we will propose two numerical simulation examples for approximating fixed points of nonexpansive-type operators and to check on the efficiency of our methods. Furthermore, we apply the new scheme JFESD (1.1) to solve the variational inequality (1.7).
Example 3.1
Let \(K=[0,+\infty ]\), \(\Phi (\varrho )=\sqrt{\varrho ^2-6 \varrho + 30}\), and for any \(n\in {{\mathbb {N}}}\), \(r_n=s_n =\frac{1}{2}\), \(d_n^\prime =\frac{n^2}{10^n}\), \(d_n^{\prime \prime }=\frac{n}{10^n}\), \(e_n=\frac{1}{5^n}\) and \(h_n=\frac{10}{8^n}\).
In Li and Lan (2019), Li and Lan proved the operator \(\Phi \) is a nonexpansive-type operator and showed that one fixed point of \(\Phi \) is 5. Now we will use our new iteration schemes to approximate the fixed points of \(\Phi \). To make clear that our schemes are better than others, we generate 1000 random initial points between 0 and 20, and set the stop condition as \(\Vert \varrho _{n+1} - \varrho _n\Vert \le \varepsilon \), here \(\varepsilon = 10^{-5}, 10^{-10}\). The numerical simulation results for two special cases of the JFESD (1.1): JFES (1.3) and JFS (1.4), and some others known schemes JF, PMMI, PMI, MANN, ISHIKAWA, NOOR and SAKURAI are appeared in Figs. 4 and 5.
In Fig. 4, horizontal axis means different iterative schemes, vertical axis is the Iter. of iterative schemes with different stopped conditions. From Fig. 4, one can easily see that the JFS (1.4) converges faster than other schemes under given stopped conditions, and they are nearly not affected by initial points. In Fig. 5, horizontal axis means different iterative schemes, vertical axis means the final approximated value, it is clear that the JFES (1.2) stably converges to a fixed point for the given nonexpansive-type operator.
Example 3.2
Take \(K=[0,+\infty ]\), \(r_n=s_n=\frac{1}{2}\), \(d_n^\prime =\frac{n^2}{10^n}\), \(d_n^{\prime \prime }=\frac{n}{10^n}\), \(e_n = \frac{1}{5^n}\) and \(h_n=\frac{10}{8^n}\) for all \(n\in {{\mathbb {N}}}\), and define \(\Phi _i=\Phi \) for \(i=1, 2, 3\) as
where \(\varrho \in [0, \infty )\).
From (3.1), we know that one fixed point of \(\Phi \) is \(\pi \) and
which shows that \(\Phi \) is a nonexpansive-type operator. It follows from Theorem 2.1 that the JFESD (1.1) and its some special cases can approximate the fixed point of \(\Phi \). Indeed, taking \(\varrho _0=18.5\), absolute errors of the iterative schemes JFES, JFS, JF, PMMI, MANN, ISHIKAWA, NOOR and SAKURAI for Example 3.2 are listed in Table 1, and one can readily see that the absolute error of our new iteration scheme JFS (1.4) becomes to 0 at the soonest. This implies that the JFS (1.4) is the best one of the compared eight schemes.
We note that from the fixed point problem (1.8), if the second \(\varsigma _n\) in the first equation of the JFESD (1.1) is substituted by \(P_K(\varsigma _n-\kappa F(\varsigma _n))\), where the projection operator \(P_K\) is the same as in (1.5), F is a nonlinear operator on K and \(\kappa \) is a positive constant, then the JFESD (1.1) is equivalent to the following iteration:
where \(\{r_n\}\) , \(\{s_n\} \) , \(\{d_n\}\), \(\{e_n\}\) and \(\{h_n\}\) are the same sequences as in (1.1). Thus, the iterative process (3.2), as an application of the new iteration scheme JFESD (1.1), can be deemed to find common fixed points of operator \(\Phi _i\) for \(i=1, 2, 3\) and solutions of Stampacchia variation inequality (1.7). This shall be proposed at the end of this section.
Theorem 3.1
Let \({{\mathbb {X}}}\) be a Hilbert space endowed with the norm \(\Vert \cdot \Vert \) and an inner product \(\langle \cdot , \cdot \rangle \), and \(K\subset {{\mathbb {X}}}\) be a nonempty closed convex bounded set. Suppose that the following conditions hold:
-
\((C_1)\) For \(i=1,2,3\), \(\Phi _i: K \rightarrow K\) is nonexpansive-type operator with Lipschitz coefficient \(\theta _i\in [0,1]\) and \(Fix(\Phi _1 \cap \Phi _2 \cap \Phi _3) \cap VI(K,F) \ne \emptyset \).
-
\((C_2)\) \(r_n\in (0,1]\) for all \(n\in {{\mathbb {N}}}\) and \(\lim _{n\rightarrow \infty }r_n\ne 0\) or \(\lim _{n\rightarrow \infty }r_n\) does not exist .
-
\((C_3)\) \(F: K\rightarrow K\) is a \(\mu \)-Lipschitzian continuous and \(\sigma \)-strongly monotone operator, i.e., if there exists a constant \(\sigma >0\) such that \(\langle F(x) - F(y), x-y\rangle \ge \sigma \Vert x-y\Vert ^2\) for all \(x, y\in K\).
-
\((C_4)\) The constant \(\kappa \), which is the same constant as in (1.8), satisfies
$$\begin{aligned} \kappa \in \left\{ \begin{aligned}&(0, \infty ), \quad&\text{ if }\quad \theta _1=0. \\&\left( 0, \frac{\sigma +\sqrt{\sigma ^2+\mu ^2\theta _1^{-1}\left( 1-\theta _1\right) }}{\mu ^2}\right) , \quad&\text{ if }\quad \theta _1 \ne 0, \end{aligned} \right. \end{aligned}$$(3.3)
Then convergence and stability of the iteration (3.2) can be analyzed as follows:
-
(i) The iterative sequence \(\left\{ \varrho _n\right\} \) defined by (3.2) converges to \(Fix(\Phi _1 \cap \Phi _2 \cap \Phi _3) \cap VI(K,F)\) with convergence rate:
$$\begin{aligned} {\hat{\rho }}_n = {\theta _1}{\theta _2}{\theta _3} \cdot \frac{[1-{r_n}(1-\upsilon \theta _1)][1-{s_n}(1-{\theta _3})]}{(2-{\theta _2})\{2-{\theta _3} [1-{s_n}(1-{\theta _3}) ]\}} \end{aligned}$$for any \(n\in {\mathbb {N}}\), where \(\upsilon = \sqrt{1-2\kappa \sigma +\kappa ^2\mu ^2}\), and there exists a constant \({\hat{\rho }}\in (0, 1]\) such that \({\hat{\rho }}_n<{\hat{\rho }}\).
-
(ii) For any sequence \(\{w_n\}\subset {{\mathbb {X}}}\), \(\lim _{n \rightarrow \infty }w_n = w^*\) if and only if \(\lim _{n\rightarrow \infty }\epsilon _n=0\), here \(\epsilon _n\) decided by
$$\begin{aligned} \left\{ \begin{aligned}&\epsilon _n = \left\| w_{n+1} - {\Phi _1} \left( \left( 1 - {r_n} \right) {\eta _n} + {r_n}{\Phi _1}\left( P_K \left( \eta _n-\kappa F(\eta _n)\right) \right) + {r_n}{d_n} \right) \right\| , \\&{\eta _n} = {\Phi _2}\left( \frac{\eta _n + \xi _n}{2}\right) +e_n, \\&{\xi _n} = {\Phi _3}\left( \left( 1-s_n\right) \frac{\xi _n+w_n}{2} + s_n \Phi _3\left( \frac{\xi _n+w_n}{2}\right) \right) + h_n, \end{aligned} \right. \end{aligned}$$(3.4)namely, the iteration scheme (3.2) is \(\Phi \)-stable.
Proof
By the condition \((C_3)\), one gets
for any \(x, y\in K\), i.e., \(\mu \ge \sigma \) and knows that \(1-2\kappa \sigma +\kappa ^2 \mu ^2\ge 0\). Setting \(\varrho ^*\in Fix(\Phi _1 \cap \Phi _2 \cap \Phi _3) \cap VI(K,F)\), that is, \(\varrho ^*\in K\) is a common fixed point of operator \(\Phi _i\) for \(i=1, 2, 3\) and a solution of Stampacchia variational inequality (1.7), then it follows that
and so
here \(\upsilon =\sqrt{1-2\kappa \sigma +\kappa ^2\mu ^2}\). By (3.2), Example 1.1 and (3.5), now we know that
where \({\hat{\tau }}_n= \theta _1\left[ (1-r_n) + \upsilon \theta _1 r_n \right] \), as the condition \((C_4)\) intends that \({\hat{\tau }}_n=0<1\) is always right if \(\theta _1=0\). Otherwise, it is easy to see that \(\upsilon <\theta _1^{-1}\) when \(\theta _1 \ne 0\) and \({\hat{\tau }}_n<\theta _1\) by the condition \((C_2)\). Thus, it follows from the condition \((C_1)\) that there exists a constant \({\hat{t}}_*=\lim \inf \nolimits _{n \rightarrow \infty } {\hat{t}}_n \in (0,1]\), where \({\hat{t}}_n=\frac{(4-2\theta _2-2\iota _n) + \theta _2 \iota _n (1-{\hat{\tau }}_n)}{(2-\theta _2)(2-\iota _n)}\). Hence, for each \(n\in {{\mathbb {N}}}\), replacing \(\tau _n\), \(t_*\) and \(1-t_n\) in (2.4) by \({\hat{\tau }}_n\), \({\hat{t}}_*\) and \(1-{\hat{t}}_n=\frac{\theta _2{\hat{\tau }}_n\iota _n}{\left( 2-\theta _2\right) \left( 2-\iota _n\right) }\) in several, where \(\iota _n\) is the same as in (2.2), then similar to the proof of Theorem 2.1, it follows from (2.3), (3.6), \({\hat{\tau }}_n < \theta _1\) and Lemma 2.1 that \(\left\| {\varrho _n}-\varrho ^*\right\| \) as \(n \rightarrow \infty \), i.e., the sequence \(\{\varrho _n\}\) strongly converges to \(\varrho ^*\) with the following convergence rate in every step:
The rest proof can be immediately obtained from the proof of Theorem 2.1 and so it is omitted. \(\square \)
Remark 3.1
(i) One can easily see that the difference between the JFESD (1.1) and the iteration (3.2) is only the second \(\varsigma _n\) in the first equation of (1.1), which depends on the equivalence of Stampacchia variational inequality (1.7) and the fixed point problem (1.8). That is to say, solving the inequality (1.7) is equivalent to finding common fixed points of nonexpansive-type operators \(\Phi _1\), \(\Phi _2\), \(\Phi _3\) and \(P_K\).
(ii) As projection operator is a nonexpansive-type operator, and the conditions \((C_1)\) and \((C_2)\) in Theorem 3.1 separately mean \(\theta _i=1\) for \(i=1, 2, 3\) and the lower bound of \({\hat{t}}_n\) exists, the operator \(\Phi _i\) with Lipschitz coefficient \(\theta _i\in [0,1]\) in (3.2) can be replaced by projection operator for each \(i=1,2,3\), and so one can get a new iteration scheme with errors for the variational inequality (1.7) as follows:
and one can achieve convergence and stability of the scheme (3.7) under some suitable conditions.
(iii) Furthermore, some variational inequalities of the form (1.7), for example, Noor (general) variational inequality introduced and studied by Noor (2007), can be solved via the new approximation method of the form JFESD (1.1) or its special cases (3.2) and (3.7). However, it follows from Remark 1.2, Figs. 4 and 5 in Example 3.1 and Table 1 of Example 3.2 that the convergence and stable of our approximation methods presented in this paper are better than those of the Noor (2007).
4 Conclusions
In this paper, we introduced a class of general semi-implicit approximations with errors and proved that the general iterative approximations converge to common fixed points of three different nonexpansive-type operators in Hilbert spaces. In addition, we studied stability of the iterative approximations, obtained convergence and validated our iterative schemes based on some numerical examples, which show that the new iterative methods presented in this paper have better convergence rate and stability. Finally, to solve Stampacchia variational inequality (1.7), we applied the new iterative methods to approximate common fixed points of nonexpansive-type operators and the projection operator associated with the inequality (1.7).
However, the following two open questions are worthy of future research:
-
(1) Nonexpansive-type operators include various forms, does the general iteration scheme JFESD (1.1) also converge to fixed points of generalized nonexpansive operators (Thakur et al. 2016; Ali et al. 2020), asymptotically quasi-nonexpansive type operators (Chang et al. 2003), totally quasi-D-asymptotically nonexpansive operator (Ni and Yao 2015), and other nonexpansive operators?
-
(2) Many iteration schemes are composed of Picard and Mann iteration schemes, so whether can all iteration schemes based on Picard and Mann iterations converge to fixed points of nonexpansive-type operators? And how about are convergence and stability when errors and semi-implicit rule are considered?
Availability of data and materials
Not applicable.
Code availability
We will provide under request.
Abbreviations
- JF:
-
Iterative scheme introduced by Ali et al. (2020).
- JFESD:
-
General semi-implicit approximation with errors for three different nonexpansive-type operators.
- JFSD:
-
Semi-implicit iteration for three different nonexpansive-type operators.
- JFES:
-
Semi-implicit scheme with errors for a nonexpansive-type operator.
- JFS:
-
Semi-implicit scheme for a nonexpansive-type operator.
- PMMI:
-
Picard–Mann semi-implicit iteration with mixed errors for a nonexpansive-type operator (Li and Lan 2019).
- PMI:
-
Picard–Mann semi-implicit iterative process for a nonexpansive-type operator (Li and Lan 2019).
- MANN:
-
Mann iteration introduced by Mann (1953).
- ISHIKAWA:
-
Ishikawa iterative process due to Ishikawa (1974).
- NOOR:
-
Noor three-step iterative approximation scheme introduced by Noor (2007).
- SAKURAI:
-
Novel fixed point algorithm formulated by Sakurai and Iiduka (2014).
- Iter.:
-
The numbers of iteration.
References
Aibinu MO, Pillay P, Olaleru JO, Mewomo OT (2018) The implicit midpoint rule of nonexpansive mappings and applications in uniformly smooth Banach spaces. J Nonlinear Sci Appl 11(12):1374–1391
Alber YI (2017) On the stability of iterative approximations to fixed points of nonexpansive mappings. J Math Anal Appl 328(2):958–971
Alghamdi MA, Alghamdi MA, Shahzad N, Xu HK (2014) The implicit midpoint rule for nonexpansive mappings. Fixed Point Theory Appl 96:9
Ali F, Ali J, Nieto JJ (2020) Some observations on generalized non-expansive mappings with an application. Comput Appl Math 39(2):20
Ali F, Ali J, Rodríguez-López R (2021) Approximation of fixed points and the solution of a nonlinear integral equation. Nonlinear Funct Anal Appl 26(5):869–885
Ali W, Turab A, Nieto JJ (2022) On the novel existence results of solutions for a class of fractional boundary value problems on the cyclohexane graph. J Inequal Appl 5:19
Cacciapaglia G, Sannino F (2021) Evidence for complex fixed points in pandemic data. Front Appl Math Stat 7:659580
Chang SS, Cho YJ, Zhou YY (2003) Iterative sequences with mixed errors for asymptotically quasi-nonexpansive type mappings in Banach spaces. Acta Math Hungar 100(1–2):147–155
Daniele P, Giannessi F, Maugeri A (2003) Equilibrium Problems and Variational Models. Kluwer, Boston
Deuflhard P (1985) Recent progress in extrapolation methods for ordinary differential equations. SIAM Rev 27(4):505–535
Hanjing A, Suantai S (2020) A fast image restoration algorithm based on a fixed point and optimization method. Math MDPI 8(3):378
Harker PT, Pang JS (1990) Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms and applications. Math Prog 48(2):161–220
Ishikawa S (1974) Fixed points by a new iteration method. Proc Am Math Soc 44(1):147–150
Lemaire B (1996) Stability of the iteration method for non expansive mappings. Serdica Math J 22(3):331–340
Li TF, Lan HY (2019) On new Picard-Mann iterative approximations with mixed errors for implicit midpoint rule and applications. J Funct Spaces 2019:13 (Art. ID 4042965)
Liu LS (1995) Ishikawa and Mann iterative process with errors for nonlinear strongly accretive mappings in Banach spaces. J Math Anal Appl 194(1):114–125
Luo P, Cai G (2017) The viscosity iterative algorithms for the implicit midpoint rule of nonexpansive mappings in uniformly smooth Banach spaces. J Inequal Appl 154:12
Maldar S (2021) Iterative algorithms of generalized nonexpansive mappings and monotone operators with application to convex minimization problem. J Appl Math Comput (Published online: 15 July 2021) https://doi.org/10.1007/s12190-021-01593-y
Mann WR (1953) Mean value methods in iteration. Proc Am Math Soc 4(3):506–510
Ni RX, Yao JC (2015) The modified Ishikawa iterative algorithm with errors for a countable family of Bregman totally quasi-\(D\)-asymptotically nonexpansive mappings in reflexive Banach spaces. Fixed Point Theory Appl 35:24
Noor MA (2007) General variational inequalities and nonexpansive mappings. J Math Anal Appl 331(2):810–822
Noor MA, Yao YH (2007) Three-step iterations for variational inequalities and nonexpansive mappings. Appl Math Comput 190(2):1312–1321
Panda SK, Abdeljawad T, Ravichandran C (2020) Novel fixed point approach to Atangana-Baleanu fractional and \(L^p\)-Fredholm integral equations. Alexandria Eng J 59(4):1959–1970
Panda SK, Atangana A, Nieto JJ (2021) New insights on novel coronavirus 2019-nCoV/SARS-CoV-2 modelling in the aspect of fractional derivatives and fixed points. Math Biosci Eng 18(6):8683–8726
Phannipa W, Atid K (2021) An approximation method for solving fixed points of general system of variational inequalities with convergence theorem and application. IAENG Int J Appl Math 51(3):751–756
Sakurai K, Iiduka H (2014) Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping. Fixed Point Theory Appl 202:11
Schneider C (1993) Analysis of the linearly implicit mid-point rule for differential-algebra equations. Electron Trans Numer Anal 1:1–10
Stampacchia G (1964) Formes bilinéaires coercitives sur les ensembles convexes (French). C R Acad Sci Paris 258:4413–4416
Thakur BS, Thakur D, Postolache M (2016) A new iterative scheme for numerical reckoning fixed points of Suzuki’s generalized nonexpansive mappings. Appl Math Comput 275:147–155
Acknowledgements
We are grateful to the anonymous referees and editors for their valuable comments and helpful suggestions to improve the quality of this paper.
Funding
This work was partially supported by Central Government Funds of Guiding Local Scientific and Technological Development for Sichuan Province (Grant No. 2021ZYD0017), the Sichuan Science and Technology Program (2019YJ0541) and the Innovation Fund of Postgraduate, Sichuan University of Science & Engineering (y2021097).
Author information
Authors and Affiliations
Contributions
H-YX carried out the proof of the theorems and gave some numerical simulations to show the existence results. H-YL and FZ conceived of the research, and participated in its design and coordination. All authors have read and approved the final manuscript.
Corresponding author
Ethics declarations
Conflict of interest
All authors declare no conflicts of interest in this paper.
Ethics approval
Not applicable.
Consent to participate
Not applicable.
Consent for publication
Not applicable.
Additional information
Communicated by Carlos Conca.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Xu, Hy., Lan, Hy. & Zhang, F. General semi-implicit approximations with errors for common fixed points of nonexpansive-type operators and applications to Stampacchia variational inequality. Comp. Appl. Math. 41, 190 (2022). https://doi.org/10.1007/s40314-022-01890-7
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40314-022-01890-7
Keywords
- Convergence and stability
- General semi-implicit iteration with errors
- Common fixed point
- Nonexpansive-type operator
- Liu’s lemma