On Two Projection Algorithms for the Multiple-Sets Split Feasibility Problem

Table 2

Computational results for Example 14 with different dimensions and different numbers of 𝐶_𝑖 and 𝑄_𝑗.

	𝑁		20	30	40	50	60
𝑡=5,	Algorithm 5	Iter.	515	675	774	875	1098
		Sec.	0.093	0.125	0.156	0.203	0.485
𝑟=5	Algorithm 7	Iter.	11	8	7	7	7
		InIt.	71	94	105	104	133
		Sec.	0.016	0.031	0.047	0.062	0.078
𝑡=10,	Algorithm 5	Iter.	772	1412	1456	1583	1614
		Sec.	0.328	0.625	0.782	1.047	1.297
𝑟=15	Algorithm 7	Iter.	14	13	9	8	7
		InIt.	76	92	120	122	140
		Sec.	0.031	0.063	0.078	0.094	0.125
𝑡=30,	Algorithm 5	Iter.	854	1467	2100	2246	2448
		Sec.	0.406	0.828	1.437	1.875	3.516
𝑟=40	Algorithm 7	Iter.	15	13	13	13	9
		InIt.	78	88	113	123	144
		Sec.	0.032	0.047	0.093	0.188	0.297