Table 2 The numerical results of Example 4.2
From: Iterative process for solving a multiple-set split feasibility problem
N | t , r | Censor γ  = 1 | Algo. 3.1 γ  = 1 \(\boldsymbol {t_{k}=0.01}\) | Censor γ  = 0.8 | Algo. 3.1 γ  = 0.8 \(\boldsymbol {t_{k}=0.01}\) | Censor γ  = 1.6 | Algo. 3.1 γ  = 1.6 \(\boldsymbol {t_{k}=0.01}\) |
|---|---|---|---|---|---|---|---|
N = 20 | t = 5 r = 5 | \(\mathrm{Iter.}=181\) \(\mathrm{Sec.}=0.268\) | \(\mathrm{Iter.}=16\) \(\mathrm{Sec.}=0.021\) | \(\mathrm{Iter.}=288\) \(\mathrm{Sec.}=0.499\) | \(\mathrm{Iter.}=20\) \(\mathrm{Sec.}=0.022\) | \(\mathrm{Iter.}=147\) \(\mathrm{Sec.}=0.213\) | \(\mathrm{Iter.}=9\) \(\mathrm{Sec.}= 0.017\) |
N = 40 | t = 10 r = 15 | \(\mathrm{Iter.}=1{,}012\) \(\mathrm{Sec.}=1.032\) | \(\mathrm{Iter.}=39\) \(\mathrm{Sec.}=0.048\) | \(\mathrm{Iter.}=2{,}320\) \(\mathrm{Sec.}=2.122\) | \(\mathrm{Iter.}=57\) \(\mathrm{Sec.}=0.059\) | \(\mathrm{Iter.}=893\) \(\mathrm{Sec.}= 0.795\) | \(\mathrm{Iter.}=19\) \(\mathrm{Sec.}= 0.031\) |