Skip to main content

Table 6 Results for Example 5.5 using Algorithm in Corollary 4.2

From: Gradient projection method with a new step size for the split feasibility problem

Choiceness u Starting points \(x_{0}\) Number of iterations CPU (s) Approximate solution \(x^{*}\) Approximate of \(q_{1}(x^{*})\) Approximate of \(q_{2}(x^{*})\) Approximate of \(\|x^{*}\|_{2}\)
\((2,0,0)^{T}\) \((1,1,1)^{T}\) 1901 3.295 \((1.999999,0.001343,0.001343)^{T}\) −4.00000 −4.99865 2.00000
\((2,0,0)^{T}\) \((2,2,2)^{T}\) 2336 4.486 \((1.999998,0.001651,0.001651)^{T}\) −3.99999 −4.99834 2.00000
\((2,0,0)^{T}\) \((1,2,3)^{T}\) 2716 4.576 \((1.999998,0.001506,0.002259)^{T}\) −3.99999 −4.99773 2.00000
\((3,0,0)^{T}\) \((1,1,1)^{T}\) 2209 3.935 \((2.998244,0.000948,0.000948)^{T}\) −4.00000 −9.98852 2.99824
\((3,0,0)^{T}\) \((2,2,2)^{T}\) 2417 3.505 \((2.999133,0.001595,0.001595)^{T}\) −3.99999 −9.99320 2.99913
\((3,0,0)^{T}\) \((1,2,3)^{T}\) 2821 3.955 \((2.998563,0.001346,0.002019)^{T}\) −3.99999 −9.98936 2.99856
\((1,2,0)^{T}\) \((1,1,1)^{T}\) 1667 3.375 \((1.000131,1.998964,0.001299)^{T}\) −0.00414 −1.99896 2.23520
\((1,2,0)^{T}\) \((2,2,2)^{T}\) 2068 3.745 \((1.000919,1.999901,0.001849)^{T}\) −0.00039 −1.99999 2.23639
\((1,2,0)^{T}\) \((1,2,3)^{T}\) 2363 4.566 \((0.999977,1.999833,0.002357)^{T}\) −0.00066 −1.99760 2.23591