Theory and Modern Applications
Table 1 Numerical results for Example 4.1
From: An inertially constructed forward–backward splitting algorithm in Hilbert spaces
No. of iter. | CPU (sec) | |||
|---|---|---|---|---|
\(\Theta _{k}=0\) | \(\Theta _{k} \neq 0\) | \(\Theta _{k} = 0\) | \(\Theta _{k} \neq 0\) | |
Choice 1. \(x_{0}=(5)\), \(x_{1}=(2)\) and N = 20 | 55 | 46 | 0.083838 | 0.064682 |
Choice 1. \(x_{0}=(5)\), \(x_{1}=(2)\) and N = 4 | 53 | 44 | 0.094593 | 0.078660 |
Choice 2. \(x_{0}=(-7)\), \(x_{1}=(-3)\) and N = 20 | 64 | 54 | 0.087539 | 0.064254 |
Choice 2. \(x_{0}=(-7)\), \(x_{1}=(-3)\) and N = 4 | 59 | 49 | 0.140981 | 0.069864 |