Skip to main content

Table 5 Results for Example 5.4 using Algorithm in Corollary 4.2

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

Starting points \(x_{0}\) Number of iterations CPU (s) Approximate solution \(x^{*}\) Approximate of \(c(x^{*})\) Approximate of \(q(Ax^{*})\)
\((1,2,3)^{T}\) 1220 1.492 \((-0.0009,0.0007,0.0002)^{T}\) −0.00049951 0.00050081
\((1,1,1)^{T}\) 1062 1.342 \((0.0004,0.0007,-0.0006)^{T}\) −0.00079951 0.00130016
\((4,5,6)^{T}\) 1225 1.642 \((0.0006,0.0007,-0.0007)^{T}\) −0.00079951 0.00140036
rand(3,1)10 1197 1.832 \((0.0008,0.0004,-0.0007)^{T}\) −0.00059984 0.00110064
\((6,5,4)^{T}\) 2569 4.346 \((0.0020,0.0004,-0.0015)^{T}\) −0.00099984 0.00190400
\((2,2,2)^{T}\) 1365 2.083 \((0.0007,0.0006,-0.0008)^{T}\) −0.00089964 0.00140049
\((3,2,1)^{T}\) 2093 3.525 \((0.0015,0.0005,-0.0013)^{T}\) −0.00109975 0.00180225