Solving a Split Feasibility Problem by the Strong Convergence of Two Projection Algorithms in Hilbert Spaces

Table 1

Numerical computational results of Algorithm 1:, Algorithm 2:, and Algorithm (4.2).

	Number of iterations			Execution time in seconds
Initial point ()	St-Alg1	St-Alg2	St-Alg3	St-Alg1	St-Alg2	St-Alg3
	27	25	20	0.0497	0.0184	0.0184
	25	28	16	0.0497	0.0184	0.0184
	39	32	21	0.0497	0.0184	0.0184
	47	43	26	0.0497	0.0184	0.0184
	55	40	30	0.0497	0.0184	0.0184