An Extrapolated Iterative Algorithm for Multiple-Set Split Feasibility Problem

Table 2

The numerical results of Example 4.2.

	𝑡,𝑟	Algorithm (1.2)	Algorithm 3.1	Algorithm (1.2)	Algorithm 3.1	Algorithm (1.2)	Algorithm 3.1
𝑁		𝑠=1	𝑠=1	𝑠=0.8	𝑠=0.8	𝑠=1.95	𝑠=1.95
𝑁=20	𝑡=5	Iter. = 1944	Iter. = 257	Iter. = 2387	Iter. = 303	Iter. = 1076	Iter. = 165
	𝑟=20	Sec.=2.395	Sec.=0.313	Sec.=2.741	Sec.=0.352	Sec.=1.305	Sec.=0.294
𝑁=40	𝑡=10	Iter.=5494	Iter.=267	Iter.=6824	Iter.=314	Iter.=2901	Iter.=176
	𝑟=40	Sec.=5.403	Sec.=0.340	Sec.=6.304	Sec.=0.396	Sec.=2.988	Sec.=0.345
𝑁=60	𝑡=10	Iter.=14352	Iter.=278	Iter.=17895	Iter.=326	Iter.=7445	Iter.=183
	𝑟=60	Sec.=20.304	Sec.=0.452	Sec.=26.401	Sec.=0.620	Sec.=17.04	Sec.=0.370