Strong Convergence of Modified Inertial Mann Algorithms for Nonexpansive Mappings

Abstract

We investigated two new modified inertial Mann Halpern and inertial Mann viscosity algorithms for solving fixed point problems. Strong convergence theorems under some fewer restricted conditions are established in the framework of infinite dimensional Hilbert spaces. Finally, some numerical examples are provided to support our main results. The algorithms and results presented in this paper can generalize and extend corresponding results previously known in the literature.

1. Introduction–Preliminaries

Let C be a nonempty closed convex subset of a real Hilbert space H. Recall that a mapping $T:C\to C$ is said to be nonexpansive if $\parallel Tx-Ty\parallel \le \parallel x-y\parallel$ for all $x,y\in C$. We denote the set of fixed points of a mapping T by $Fix\left(T\right):=\{x\in C:Tx=x\}$. For any $x\in H$, $P_C$ denotes the metric projection of H onto C, such that $P_{C}x:={argmin}_{y\in C}\parallel x-y\parallel$.

The main purpose of this paper is to consider the following fixed point problem: find $x^{*}\in C$, such that $T{x}^{*}=x^{*}$, where $T:C\to C$ is nonexpansive with $Fix\left(T\right)\ne \varnothing$. In recent years, there has been tremendous interest in developing approximation of fixed point problems with nonexpansive mappings. The fixed point problem, serves as a powerful mathematical model, which generalize important concepts in optimization problems, such as, monotone variational inequalities, convex optimization problems, signal processing and image restoration problems; see, e.g., [1,2,3,4,5] and the references therein. In general, the Picard iteration $x_{n+1}=T{x}_n=\cdots =T^{n+1}{x}_0$ may perform poorly, where $x_0$ is starting point, this means that the Picard method may not converge even in weak topology. Mann iteration algorithm is one of the effective ways to overcome this difficulty, which generates iterative sequence $\left\{x_n\right\}$ through the following convex combination:

$$x_{n+1}={\psi }_n{x}_n+\left(1-{\psi }_n\right)T{x}_n,n\ge 0.$$

(1)

The Mann iteration algorithm is extremely useful for finding the fixed point problem of nonexpansive mappings, and provides a unified framework for different algorithms. However, it should be pointed out that even in a Hilbert space, the iterative sequence $\left\{x_n\right\}$ defined by (1) has only weak convergence under certain conditions.

In the past two decades, there has been extensive study and application of the modified Mann iteration algorithm to obtain strong convergence, see [6,7,8,9,10] and the references therein. In 2003, Nakajo and Takahashi [6] established strong convergence of the Mann iteration by means of projection methods, and proposed the following algorithm in a Hilbert space H:

$$\left\{\begin{array}{c}{y}_n={\psi }_n{x}_n+\left(1-{\psi }_n\right)T{x}_n,\hfill \\ C_n=\left\{p\in C:∥y_n-p∥\le ∥x_n-p∥\right\},\hfill \\ Q_n=\left\{p\in C:〈x_n-p,x_n-x_0〉\le 0\right\},\hfill \\ x_{n+1}=P_{C_n\cap Q_n}{x}_0,n\ge 0,\hfill \end{array}\right.$$

(2)

where T is a nonexpansive mapping on C, $P_{C_n\cap Q_n}$ is the metric projection from C onto $C_n\cap Q_n$, and $\left\{{\psi }_n\right\}\subset [0,1)$. Iteration scheme (2) is now referred to simply as the CQ algorithm. For further research, we refer to [9,11,12] for more details. These methods require us to calculate the metric projection in each iteration. However, in complex practical applications, it is difficult to know the numerical expression of the metric projection operator. Note that this is computationally very expensive, and thus projection algorithms are extremely inconvenient in many cases. Recently, Kim and Xu [7] got rid of the projection algorithm. Indeed, they proposed the following modified Mann iteration algorithm based on the Halpern iterative algorithm [13] and the Mann iteration algorithm (1):

$$\left\{\begin{array}{c}{y}_n={\psi }_n{x}_n+\left(1-{\psi }_n\right)T{x}_n,\hfill \\ x_{n+1}={\nu }_{n}u+\left(1-{\nu }_n\right)y_n,n\ge 0,\hfill \end{array}\right.$$

(3)

where $T:C\to C$ is a nonexpansive mapping with $Fix\left(T\right)\ne \varnothing$, for some fixed point $u\in C$, sequences $\left\{{\psi }_n\right\}$ and $\left\{{\nu }_n\right\}$ in $(0,1)$. Then the iterative sequence $\left\{x_n\right\}$ defined by (3) converges to a fixed point of T in norm by satisfying the following conditions:

(C1)

${lim}_{n\to \infty }{\psi }_n=0,{\sum }_{n=0}^{\infty }{\psi }_n=\infty$ and ${\sum }_{n=0}^{\infty }\left|{\psi }_{n+1}-{\psi }_n\right|<\infty$;

(C2)

${lim}_{n\to \infty }{\nu }_n=0,{\sum }_{n=0}^{\infty }{\nu }_n=\infty$ and ${\sum }_{n=0}^{\infty }\left|{\nu }_{n+1}-{\nu }_n\right|<\infty$.

Inspired by the result of Kim and Xu [7], Yao, Chen and Yao [8] introduced a new modified Mann iteration algorithm by combines the viscosity approximation algorithm [14] and the modified Mann iteration algorithm [7]. They established strong convergence result under fewer restrictions. It is important to note that there is no additional projection involved in [7,8]. Recently, the above results have been extended to more general operators and wider Banach spaces, such as strict pseudo-contractions, quasi-nonexpansive mappings, asymptotically quasi-nonexpansive mappings, see, e.g., [12,15,16,17] and the references therein.

On the other hand, the inertial type technique, which was first proposed by Polyak [18], have attracted considerable attention in the research of fast convergence of algorithms. It is a heavy-ball method based on a second-order time dynamic system. The inertial method involves two iterative steps, and the second iterative step is obtained by means of the previous two iterates. In recent years, a great deal of mathematical effort in fast iterative algorithms has been devoted to the study of inertial extrapolation techniques. Researchers have improved some algorithms with the help of inertial techniques. They have shown the superiority of those results in theory and numerical experiments, and applied them to the fields of signal processing and image restoration. For instance, inertial forward-backward splitting algorithms [19,20], inertial projection algorithms [21,22], inertial extragradient algorithms [23,24,25] and fast iterative shrinkage-thresholding algorithm (FISTA) [26]. In 2008, by unifying the inertial extrapolation and the Mann algorithm (1), Mainge [27] introduced the following inertial Mann algorithm:

$$\left\{\begin{array}{c}{w}_n=x_n+{\delta }_n\left(x_n-x_{n-1}\right),\hfill \\ x_{n+1}={\psi }_n{w}_n+\left(1-{\psi }_n\right)T{w}_n,n\ge 0.\hfill \end{array}\right.$$

(4)

It should be noted that the iterative sequence $\left\{x_n\right\}$ defined by (4) converges weakly to a fixed point of T under some mild assumptions.

Inspired and motivated by the works of Kim and Xu [7], Yao et al. [8] and Mainge [27], we propose a modified inertial Mann Halpern algorithm and a modified inertial Mann viscosity algorithm. Strong convergence results are obtained under some mild conditions. Finally, some numerical examples to support our results are provided. These demonstrate the superiority of our proposed algorithm by comparison with some algorithms in [6,7,8,27,28].

Throughout this paper, we use the symbol “→” for strong convergence and “⇀” for weak convergence. For each $x,y\in H$, we have the following facts.

(1)

${\parallel x+y\parallel }^2\le {\parallel x\parallel }^2+2\langle y,x+y\rangle$;

(2)

${\parallel tx+(1-t)y\parallel }^2={t\parallel x\parallel }^2+{(1-t)\parallel y\parallel }^2-t(1-t){\parallel x-y\parallel }^2,\forall t\in \mathbb{R}$;

(3)

$\langle P_{C}x-x,P_{C}x-y\rangle \le 0,\forall y\in C$.

We need some lemmas to use in our proof. The first one is called the demiclosed principle.

Lemma 1

([29]). Assume that C is a nonempty closed convex subset of a real Hilbert space H and $T:C\to H$ is a nonexpansive mapping. Let $\left\{x_n\right\}$ be a sequence in C and $x\in H$ such that $x_n\rightharpoonup x$ and $T{x}_n-x_n\to 0$ as $n\to +\infty$. Then $x\in Fix\left(T\right)$.

Lemma 2

([30]). Suppose that $\left\{S_n\right\}$ is a sequence of nonnegative real numbers such that

$$\begin{array}{c}\hfill S_{n+1}\le \left(1-{\nu }_n\right)S_n+{\nu }_n{\sigma }_n,\forall n\ge 0,\mathit{and}{S}_{n+1}\le S_n-{\eta }_n+{\pi }_n,\forall n\ge 0,\end{array}$$

where $\left\{{\nu }_n\right\}$ is a sequence in $(0,1)$, $\left\{{\eta }_n\right\}$ is a sequence of nonnegative real numbers, $\left\{{\sigma }_n\right\}$ and $\left\{{\pi }_n\right\}$ are real sequences such that (i) ${\sum }_{n=0}^{\infty }{\nu }_n=\infty$; (ii) ${lim}_{n\to \infty }{\pi }_n=0$; (iii) ${lim}_{k\to \infty }{\eta }_{n_k}=0$ implies ${lim\; sup}_{k\to \infty }{\sigma }_{n_k}\le 0$ for any subsequence $\left\{{\eta }_{n_k}\right\}$ of $\left\{{\eta }_n\right\}$. Then ${lim}_{n\to \infty }{S}_n=0$.

2. Modified Inertial Mann Halpern and Viscosity Algorithms

In this section, combining the idea of inertial technique with the Halpern algorithm and viscosity algorithm, respectively, we introduce two modified inertial Mann algorithms and analyze their convergence.

Theorem 1.

Assume that C is a nonempty closed convex subset of a real Hilbert space H and $T:C\to C$ is a nonexpansive mapping with $Fix\left(T\right)\ne \varnothing$. Given a point $u\in C$ and given two sequences $\left\{{\psi }_n\right\}$ and $\left\{{\nu }_n\right\}$ in $(0,1)$, the following conditions are satisfied:

(D1) 

${\sum }_{n=0}^{\infty }{\nu }_n=\infty$ and ${lim}_{n\to \infty }{\nu }_n=0$;

(D2) 

${lim}_{n\to \infty }\frac{{\delta }_n}{{\nu }_n}∥x_n-x_{n-1}∥=0$.

Let $x_{-1},x_0\in C$ be arbitrarily. Define a sequence $\left\{x_n\right\}$ by the following algorithm:

$$\left\{\begin{array}{c}{w}_n=x_n+{\delta }_n(x_n-x_{n-1}),\hfill \\ y_n={\psi }_n{w}_n+\left(1-{\psi }_n\right)T{w}_n,\hfill \\ x_{n+1}={\nu }_{n}u+\left(1-{\nu }_n\right)y_n,n\ge 0.\hfill \end{array}\right.$$

(5)

Then the iterative sequence $\left\{x_n\right\}$ defined by (5) converges strongly to $p=P_{Fix\left(T\right)}u$.

Proof. 

First we show that $\left\{x_n\right\}$ is bounded. Indeed, taking $p\in Fix\left(T\right)$, due to the nonexpansivity of T, we have

$$\begin{array}{cc}\hfill ∥x_{n+1}-p∥& \le {\nu }_n\parallel u-p\parallel +\left(1-{\nu }_n\right)∥y_n-p∥\hfill \\ & \le {\nu }_n\parallel u-p\parallel +\left(1-{\nu }_n\right)\left({\psi }_n\parallel w_n-p\parallel +(1-{\psi }_n)\parallel T{w}_n-p\parallel \right)\hfill \\ & \le \left(1-{\nu }_n\right)∥x_n-p∥+{\nu }_n∥u-p∥+\left(1-{\nu }_n\right){\delta }_n∥x_n-x_{n-1}∥.\hfill \end{array}$$

(6)

Let $M:=2max\left\{\parallel u-p\parallel ,{sup}_{n\ge 0}\frac{\left(1-{\nu }_n\right){\delta }_n}{{\nu }_n}∥x_n-x_{n-1}∥\right\}$. Then (6) reducing to the following:

$$∥x_{n+1}-p∥\le \left(1-{\nu }_n\right)∥x_n-p∥+{\nu }_{n}M\le max\{\parallel x_n-p\parallel ,M\}\le \cdots \le max\{\parallel x_0-p\parallel ,M\}.$$

(7)

Combining condition (D2) and (7), we obtain that $\left\{x_n\right\}$ is bounded. So $\left\{w_n\right\}$ and $\left\{y_n\right\}$ are also bounded. By the definition of $\left\{y_n\right\}$ in (5), we know that

$$\begin{array}{cc}\hfill \parallel y_n{-p\parallel }^2& ={\psi }_n\parallel w_n{-p\parallel }^2+\left(1-{\psi }_n\right){\parallel T{w}_n-p\parallel }^2-{\psi }_n\left(1-{\psi }_n\right)\parallel T{w}_n-w_n{\parallel }^2\hfill \\ & \le \parallel w_n{-p\parallel }^2-{\psi }_n\left(1-{\psi }_n\right){\parallel T{w}_n-w_n\parallel }^2.\hfill \end{array}$$

(8)

Therefore, according to the definition of $\left\{w_n\right\}$ and (8), we get

$$\begin{array}{cc}\parallel x_{n+1}{-p\parallel }^2\hfill & =\parallel (1-{\nu }_n)(y_n-p)+{\nu }_n(u-p)\parallel \hfill \\ & \le {\left(1-{\nu }_n\right)}^2{∥y_n-p∥}^2+2{\nu }_n\langle u-p,x_{n+1}-p\rangle \hfill \\ & \le \left(1-{\nu }_n\right)\parallel w_n{-p\parallel }^2-{\psi }_n\left(1-{\psi }_n\right)\left(1-{\nu }_n\right){\parallel T{w}_n-w_n\parallel }^2+2{\nu }_n\langle u-p,x_{n+1}-p\rangle \hfill \\ & =\left(1-{\nu }_n\right){∥x_n-p∥}^2+{\delta }_n^2\left(1-{\nu }_n\right){∥x_n-x_{n-1}∥}^2+2{\delta }_n\left(1-{\nu }_n\right)\langle x_n-x_{n-1},x_n-p\rangle \hfill \\ & -{\psi }_n\left(1-{\psi }_n\right)\left(1-{\nu }_n\right){\parallel T{w}_n-w_n\parallel }^2+2{\nu }_n\langle u-p,x_{n+1}-p\rangle .\hfill \end{array}$$

(9)

For the sake of simplicity, for each $n\ge 0$, let

$$\begin{array}{cc}\hfill S_n& ={∥x_n-p∥}^2,{\pi }_n={\nu }_n{\sigma }_n,\hfill \\ \hfill {\sigma }_n& =\frac{{\delta }_n^2\left(1-{\nu }_n\right)}{{\nu }_n}{∥x_n-x_{n-1}∥}^2+\frac{2{\delta }_n\left(1-{\nu }_n\right)}{{\nu }_n}\langle x_n-x_{n-1},x_n-p\rangle +2\langle u-p,x_{n+1}-p\rangle ,\hfill \\ \hfill {\eta }_n& ={\psi }_n\left(1-{\psi }_n\right)\left(1-{\nu }_n\right){\parallel T{w}_n-w_n\parallel }^2.\hfill \end{array}$$

As a result, inequality (9) reduces to the following:

$$\begin{array}{c}\hfill S_{n+1}\le \left(1-{\nu }_n\right)S_n+{\nu }_n{\sigma }_n,\mathrm{and}{S}_{n+1}\le S_n-{\eta }_n+{\pi }_n.\end{array}$$

From the conditions (D1) and (D2), we see that ${\sum }_{n=0}^{\infty }{\nu }_n=\infty$ and ${lim}_{n\to \infty }{\pi }_n=0$. In order to complete the proof, using Lemma 2, it remains to show that ${lim}_{k\to \infty }{\eta }_{n_k}=0$ implies ${lim\; sup}_{k\to \infty }{\sigma }_{n_k}\le 0$ for any subsequence $\left\{{\eta }_{n_k}\right\}$ of $\left\{{\eta }_n\right\}$. Let $\left\{{\eta }_{n_k}\right\}$ be a subsequence of $\left\{{\eta }_n\right\}$ such that ${lim}_{k\to \infty }{\eta }_{n_k}=0$, since $\left\{{\psi }_{n_k}\right\}$ and $\left\{{\nu }_{n_k}\right\}$ in $(0,1)$, which implies that ${lim}_{k\to \infty }\parallel T{w}_{n_k}-w_{n_k}\parallel =0$. Using the condition (D2), we have

$$∥w_{n_k}-x_{n_k}∥={\delta }_{n_k}∥x_{n_k}-x_{n_{k-1}}∥\to 0(k\to \infty ).$$

(10)

Since $\left\{x_{n_k}\right\}$ is bounded, there exists a subsequence $\{x_{n_{k_j}}\}$ of $\left\{x_{n_k}\right\}$ such that $x_{n_{k_j}}\rightharpoonup \overline{x}$ as $j\to \infty$ and ${lim}_{k\to \infty }sup〈u-p,x_{n_k}-p〉={lim}_{j\to \infty }\langle u-p,x_{n_{k_j}}-p\rangle$. It follows from (10) that $w_{n_{k_j}}\rightharpoonup \overline{x}$ as $j\to \infty$. We get $\overline{x}\in Fix\left(T\right)$ by means of Lemma 1. Combining the projection property and $p=P_{Fix\left(T\right)}u$, it follows that

$$\underset{k\to \infty }{lim}sup〈u-p,x_{n_k}-p〉=\underset{j\to \infty }{lim}\langle u-p,x_{n_{k_j}}-p\rangle =\langle u-p,\overline{x}-p\rangle \le 0.$$

(11)

By (5), we obtain $\parallel y_{n_k}-w_{n_k}\parallel =(1-{\psi }_{n_k})\parallel T{w}_{n_k}-w_{n_k}\parallel \to 0$ as $k\to \infty$. This together with (10) imply that $\parallel y_{n_k}-x_{n_k}\parallel \le \parallel y_{n_k}-w_{n_k}\parallel +\parallel w_{n_k}-x_{n_k}\parallel \to 0$ as $k\to \infty$. Further, on account of condition (D1), we obtain

$$∥x_{n_{k+1}}-x_{n_k}∥\le {\nu }_{n_k}∥u-x_{n_k}∥+\left(1-{\nu }_{n_k}\right)∥y_{n_k}-x_{n_k}∥\to 0(k\to \infty ).$$

(12)

Combining (11) and (12), we infer that ${lim\; sup}_{k\to \infty }\langle u-p,x_{n_{k+1}}-p\rangle \le 0$, which together with condition (D2) indicate that ${lim\; sup}_{k\to \infty }{\sigma }_{n_k}\le 0$. Consequently, we observe that ${lim}_{n\to \infty }{S}_n=0$ from Lemma 2, and hence $x_n\to p$ as $n\to \infty$. The proof is complete. ☐

We emphasize that if $f:C\to C$ is a contractive mapping and we replace u by $f\left(x_n\right)$ in (5), we can obtain the following viscosity iteration algorithm, for more details, see [31].

Theorem 2.

Assume that C is a nonempty closed convex subset of a real Hilbert space H and $T:C\to C$ is a nonexpansive mapping with $Fix\left(T\right)\ne \varnothing$. Let $f:C\to C$ be a ρ-contraction with $\rho \in [0,1)$, that is $\parallel f\left(x\right)-f\left(y\right)\parallel \le \rho \parallel x-y\parallel ,\forall x,y\in C$. Given two sequences $\left\{{\psi }_n\right\}$ and $\left\{{\nu }_n\right\}$ in $(0,1)$, the following conditions are satisfied:

(K1) 

${\sum }_{n=0}^{\infty }{\nu }_n=\infty$ and ${lim}_{n\to \infty }{\nu }_n=0$;

(K2) 

${lim}_{n\to \infty }\frac{{\delta }_n}{{\nu }_n}∥x_n-x_{n-1}∥=0$.

Let $x_{-1},x_0\in C$ be arbitrarily. Define a sequence $\left\{x_n\right\}$ by the following algorithm:

$$\left\{\begin{array}{c}{w}_n=x_n+{\delta }_n(x_n-x_{n-1}),\hfill \\ y_n={\psi }_n{w}_n+\left(1-{\psi }_n\right)T{w}_n,\hfill \\ x_{n+1}={\nu }_{n}f\left(x_n\right)+\left(1-{\nu }_n\right)y_n,n\ge 0.\hfill \end{array}\right.$$

(13)

Then the iterative sequence $\left\{x_n\right\}$ defined by (13) converges strongly to $z=P_{Fix\left(T\right)}f\left(z\right)$.

Remark 1.

(1) 

For special choice, the parameter ${\delta }_n$ in the Algorithm (5) and the Algorithm (13) can be chosen as follows.

$$0\le {\delta }_n\le {\overline{\delta }}_n,{\overline{\delta }}_n=\left\{\begin{array}{cc}min\left\{\frac{{\xi }_n}{∥x_n-x_{n-1}∥},\frac{n-1}{n+\eta -1}\right\},\hfill & if{x}_n\ne x_{n-1};\hfill \\ \frac{n-1}{n+\eta -1},\hfill & otherwise,\hfill \end{array}\right.$$

(14)

for some $\eta \ge 3$ and $\left\{{\xi }_n\right\}$ is a positive sequence such that ${lim}_{n\to \infty }\frac{{\xi }_n}{{\nu }_n}=0$. This idea derives from the recent inertial extrapolated step introduced in [26,32].

(2) 

If ${\delta }_n=0$ for all $n\ge 0$, in the Algorithm (5) and the Algorithm (13), then we obtained the results proposed by Kim and Xu [7] and Yao et al. [8], respectively.

(3) 

It is worth to mention that our proposed algorithms can get rid of the condition (C1) and obtain strong convergence results.

3. Numerical Experiments

In this section, we perform some numerical experiments to illustrate the convergence behavior of our proposed algorithms, and show the computational performance of our algorithms by comparison with some existing ones. For convenience, the modified inertial Mann Halpern algorithm (5) and modified inertial Mann viscosity algorithm (13) are abbreviated as MIMHA and MIMVA, respectively. All the programs are performed in MATLAB2018a on a PC Desktop Intel(R) Core(TM) i5-8250U CPU @ 1.60GHz 1.800 GHz, RAM 8.00 GB.

Example 1.

To begin with, we consider an example in infinite dimensional Hilbert space. Suppose that C and Q is nonempty closed and convex subsets of real Hilbert spaces $H_1$ and $H_2$, respectively. Let $T:H_1\to H_2$ be a bounded linear operator. We consider the following split feasibility problem (in short, SFP):

$$find{x}^{*}\in C\mathit{such}\mathit{that}T{x}^{*}\in Q.$$

(15)

For any $f,g\in L^2\left([0,2\pi ]\right)$, we consider $H_1=H_2=L^2\left([0,2\pi ]\right)$ with inner product $\langle f,g\rangle :={\int }_0^{2\pi }f\left(t\right)g\left(t\right)\mathrm{d}t$ and induced norm ${\parallel f\parallel }_2:={\left({\int }_0^{2\pi }{\left|f\left(t\right)\right|}^2\mathrm{d}t\right)}^{\frac{1}{2}}$. Consider the following two half space:

$$C=\left\{x\in L_2\left([0,2\pi ]\right)\mid {\int }_0^{2\pi }x\left(t\right)\mathrm{d}t\le 1\right\},\mathit{and}Q=\left\{x\in L_2\left([0,2\pi ]\right)\mid {\int }_0^{2\pi }{\left|x\left(t\right)-sin\left(t\right)\right|}^2\mathrm{d}t\le 16\right\}.$$

The sets C and Q are nonempty, closed and convex subsets of Hilbert space $L^2\left([0,2\pi ]\right)$. Assume that $T:L^2\left([0,2\pi ]\right)\to L^2\left([0,2\pi ]\right)$ is a bounded linear operator defined by $\left(Tx\right)\left(t\right):=x\left(t\right)$. Let $T^{*}$ denote the adjoint of T. Then $\left(T^{*}x\right)\left(t\right)=x\left(t\right)$ and $\parallel T\parallel =1$. Therefore, (15) is actually a convex feasibility problem: $find{x}^{*}\in C\cap Q$. Moreover, observe that the solution set of (15) is nonempty since $x\left(t\right)=0$ is a solution. For solving the (15), Byrne [33] proposed the following algorithm:

$$x_{n+1}=P_C\left(x_n-\lambda T^{*}\left(I-P_Q\right)T{x}_n\right),$$

where $0<\lambda <2L$ with Lipschitz constant $L=1/{\parallel T\parallel }^2$. For the purpose of our numerical computation, we use the following formula for the projections onto C and Q, respectively, see [29].

$$P_C\left(x\right)=\left\{\begin{array}{cc}\frac{1-a}{4{\pi }^2}+x,\hfill & a>1;\hfill \\ x,\hfill & a\le 1.\hfill \end{array}\right.\mathit{and}{P}_Q\left(x\right)=\left\{\begin{array}{cc}sin(·)+\frac{4(x-sin(·\left)\right)}{\sqrt{b}},\hfill & b>16;\hfill \\ x,\hfill & b\le 16,\hfill \end{array}\right.$$

where $a={\int }_0^{2\pi }x\left(t\right)\mathrm{d}t$ and $b={\int }_0^{2\pi }{|x\left(t\right)-sin\left(t\right)|}^2\mathrm{d}t$. We consider different initial points $x_{-1}=x_0$ in the experiment and use the stopping criterion

$$E_n=\frac{1}{2}{∥P_C{x}_n-x_n∥}_2^2+\frac{1}{2}{∥P_{Q}T{x}_n-T{x}_n∥}_2^2<ϵ.$$

We use the modified Mann Halpern algorithm (MMHA, i.e., MIMHA with ${\delta }_n=0$) [7], the modified inertial Mann Halpern algorithm (5) (MIMHA), the modified Mann viscosity algorithm (MMVA, i.e., MIMVA with ${\delta }_n=0$) [8] and the modified inertial Mann viscosity algorithm (13) (MIMVA) to solve Example 1. In all algorithms, set $ϵ={10}^{-3}$, ${\psi }_n=\frac{1}{100{(n+1)}^2}$, ${\nu }_n=\frac{1}{n+1}$, $\lambda =0.25$. In MIMHA algorithm and MIMVA algorithm, update inertial parameter ${\delta }_n$ by (14) with ${\xi }_n=\frac{10}{{(n+1)}^2}$ and $\eta =4$. Set $u=0.9x_0$ in the MIMHA algorithm and $f\left(x\right)=0.9x_n$ in the MIMVA algorithm, respectively. Results of these calculations are given in

Table 1. Computation results for Example 1.

		MMHA		MIMHA		MMVA		MIMVA
Cases	Initial Points	Iter.	Time(s)	Iter.	Time(s)	Iter.	Time(s)	Iter.	Time(s)
I	$x_0=\frac{t^2}{10}$	58	15.62	56	16.83	14	3.64	8	2.35
II	$x_0=\frac{e^{\frac{t}{2}}}{3}$	195	53.20	194	60.40	16	4.34	10	2.90
III	$x_0=\frac{2^t}{16}$	47	12.85	43	13.03	13	3.36	8	2.35
IV	$x_0=3sin\left(2t\right)$	98	26.61	95	28.54	8	2.08	5	1.47

and Figure 1. In Table 1, “Iter." and “Time(s)" denote the number of iterations and the cpu time in seconds, respectively.

Example 2.

The second example we consider the convex feasibility problem, for any nonempty closed convex set $C_i\subset R^N$ ($i=0,1,\dots ,m$), find $x^{*}\in C:={\bigcap }_{i=0}^m{C}_i$, where one suppose that $C\ne \varnothing$. Define a mapping $T:R^N\to R^N$ by $T:=P_0\left(\frac{1}{m}{\sum }_{i=1}^m{P}_i\right)$, where $P_i=P_{C_i}$ represents the metric projection onto $C_i$. Owing to $P_i$ is nonexpansive, and thus the mapping T is also nonexpansive. Furthermore, it is easy to see that $Fix\left(T\right)=Fix\left(P_0\right){\bigcap }_{i=1}^{m}Fix\left(P_i\right)=C_0{\bigcap }_{i=1}^m{C}_i=C$. In this example, we set $C_i$ as a closed ball with center $c_i\in R^N$ and radius $r_i>0$. Therefore, $P_i$ can be calculated as follows:

$$P_i\left(x\right):=\left\{\begin{array}{cc}{c}_i+\frac{r_i}{∥c_i-x∥}\left(x-c_i\right),\hfill & if∥c_i-x∥>r_i;\hfill \\ x,\hfill & if∥c_i-x∥\le r_i.\hfill \end{array}\right.$$

Choose $r_i=1(i=0,1,\dots ,m)$, ${\mathbf{c}}_0=[0,0,\dots ,0]$, ${\mathbf{c}}_1=[1,0,\dots ,0]$, and ${\mathbf{c}}_2=[-1,0,\dots ,0]$. ${\mathbf{c}}_i\in {(-1/\sqrt{N},1/\sqrt{N})}^N(i=3,\dots ,m)$ are randomly chosen. According to the choice of ${\mathbf{c}}_1,{\mathbf{c}}_2$ and $r_1,r_2$, it follows that $Fix\left(T\right)=\left\{\mathbf{0}\right\}$. Iteration error of the algorithm represented by $E_n={∥x_n∥}_{\infty }$.

We use the CQ algorithm (2) (CQ) [6], the inertial Mann algorithm (4) (iMann) [27], the modified inertial Mann algorithm (MIMA) [28], the modified Mann viscosity algorithm (MMVA) [8] and the modified inertial Mann viscosity algorithm (13) (MIMVA) to solve Example 2. In all algorithms, set $N=30,m=30$. Set ${\psi }_n=\frac{1}{n+1}$ in the CQ algorithm and ${\delta }_n=0.5$, ${\psi }_n=\frac{1}{n+1}$ in the iMann algorithm, respectively. Set ${\alpha }_n=0.9$, $\lambda =1$, ${\beta }_n=\frac{1}{{(n+1)}^2}$, $\mu =1$ and ${\gamma }_n=0.1$ in the MIMA algorithm and ${\xi }_n=\frac{10}{{(n+1)}^2}$, $\eta =4$, ${\psi }_n=\frac{1}{100{(n+1)}^2}$, ${\nu }_n=\frac{1}{n+1}$ and $f\left(x\right)=0.1x_n$ in the MIMVA algorithm, respectively. Take maximum iteration of 1000 as a common stopping criterion. The initial values are randomly generated by the MATLAB function 10rand(N,1). Computational results are shown in Figure 2.

Example 3.

As a final example, we consider the Fermat-Weber (FW) problem, which is a well-known model in location theory. FW is expressed mathematically as follows: find $\mathbf{x}\in R^n$ that solves

$$minf\left(\mathbf{x}\right):=\sum _{i=1}^m{\omega }_i{∥\mathbf{x}-{\mathbf{a}}_i∥}_2,$$

(16)

where $a_i\in R^n$ are anchor points and ${\omega }_i$ are given non-negative weights. It should be pointed out that f is non-differentiable at the anchor points. The Weiszfeld algorithm is the most famous method for solving the problem (16), see [34] for more details. He constructed the following fixed-point iterative algorithm: ${\mathbf{x}}_{n+1}=T{\mathbf{x}}_n,n\in N$. The mapping $T:R^n\backslash \mathbf{A}⟼R^n$ is defined by

$$T\left(x\right):=\frac{1}{{\sum }_{i=1}^m\frac{{\omega }_i}{∥\mathbf{x}-{\mathbf{a}}_i∥}}\sum _{i=1}^m\frac{{\omega }_i{\mathbf{a}}_i}{∥\mathbf{x}-{\mathbf{a}}_i∥},$$

where $\mathbf{A}=\left\{{\mathbf{a}}_1,{\mathbf{a}}_2,\dots ,{\mathbf{a}}_m\right\}$. We consider a three dimensional example with $n=3,m=8$ anchor points,

$$\mathbf{A}=\left(\begin{array}{cccccccc}0& 10& 0& 10& 0& 10& 0& 10\\ 0& 0& 10& 10& 0& 0& 10& 10\\ 0& 0& 0& 0& 10& 10& 10& 10\end{array}\right),$$

and ${\omega }_i=1$ for all i. In view of the special selection of anchor points ${\mathbf{a}}_i(i=1,2,3,\dots ,8)$, it follows that the optimal value of (16) is ${\mathbf{x}}^{*}={(5,5,5)}^{\mathsf{T}}$. Figure 3 shows a schematic diagram of the anchor points and the optimal solution.

We use the modified inertial Mann Halpern algorithm (5) (MIMHA) and the modified inertial Mann viscosity algorithm (13) (MIMVA) to solve Example 3. In MIMHA algorithm and MIMVA algorithm, set ${\xi }_n=\frac{10}{{(n+1)}^2}$, $\eta =4$, ${\psi }_n=\frac{1}{100{(n+1)}^2}$, ${\nu }_n=\frac{1}{n+1}$. Set $u=0.9x_0$ in the MIMHA algorithm and $f\left(x\right)=0.9x_n$ in the MIMVA algorithm, respectively. Let $E_n={\parallel x_n-x^{*}\parallel }_2$ be the iteration error of these algorithms, and maximum number of iterations 1000 as a common stopping criterion. The initial values are randomly generated by the MATLAB function 10rand(3,1). Numerical results are reported in Figure 4.

Remark 2.

(1)

From Examples 1–3, we observe that Algorithm (13) is efficient, easy to implement, and most importantly very fast. In addition, the inertial parameter (14) can significantly improve the convergence speed of our proposed algorithms, see Figure 2b.

(2)

The Algorithm (13) proposed in this paper can improve some known results in the field, see Figure 2a. It should be noted that the choice of initial values does not affect the calculation performance of our algorithms, see Table 1.

4. Conclusions

This paper discussed the modified inertial Mann Halpern and viscosity algorithms based on the idea of inertial technique. Strong convergence results are obtained under some suitable conditions. In addition, our proposed algorithms are applied to split feasibility problem, convex feasibility problem and location theory. Note that the algorithms and results presented in this paper can summarize and improve some known results in the area. Part of our future work will focus on extending the results to more general operators and wider Banach spaces.