Table 1 The numerical results of Example 4.1
From: Iterative process for solving a multiple-set split feasibility problem
Case | Censor γ  = 1 | Algo. 3.1 γ  = 1 \(\boldsymbol {t_{k}=0.1}\) | Censor γ  = 0.6 | Algo. 3.1 γ  = 0.6 \(\boldsymbol {t_{k}=0.1} \) | Censor γ  = 1.8 | Algo. 3.1 γ  = 1.8 \(\boldsymbol {t_{k}=0.1}\) |
|---|---|---|---|---|---|---|
I | \(\mathrm{Iter.}=1{,}051\) \(\mathrm{Sec.}=1.043\) | \(\mathrm{Iter.}=146\) \(\mathrm{Sec.} =0.401\) | \(\mathrm{Iter.}=1{,}867\) \(\mathrm{Sec.}=1.480\) | \(\mathrm{Iter.}=224\) \(\mathrm{Sec.}=0.334\) | \(\mathrm{Iter.}=832\) \(\mathrm{Sec.}=0.700\) | \(\mathrm{Iter.}= 89\) \(\mathrm{Sec.}=0.062\) |
II | \(\mathrm{Iter.}= 197\) \(\mathrm{Sec.}= 0.320\) | \(\mathrm{Iter.}=28\) \(\mathrm{Sec.}=0.017\) | \(\mathrm{Iter.}=289\) \(\mathrm{Sec.}=0.466\) | \(\mathrm{Iter.}=62\) \(\mathrm{Sec.}=0.0751\) | \(\mathrm{Iter.}=87\) \(\mathrm{Sec.}=0.068\) | \(\mathrm{Iter.}=9\) \(\mathrm{Sec.}=0.010\) |
III | \(\mathrm{Iter.}=207\) \(\mathrm{Sec.}= 0.360\) | \(\mathrm{Iter.}=62\) \(\mathrm{Sec.}=0.049\) | \(\mathrm{Iter.}=362\) \(\mathrm{Sec.}=0.551\) | \(\mathrm{Iter.}= 67\) \(\mathrm{Sec.}=0.0728\) | \(\mathrm{Iter.}=139\) \(\mathrm{Sec.}=0.217\) | \(\mathrm{Iter.}=17\) \(\mathrm{Sec.}=0.020\) |