Table 2 Results for Example 5.4 using Qu and Xiu method in [7]
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,0,0,0)^{T}\) | 1890 | 2.7740 | \((-0.1203,0.0285,0.0582)^{T}\) | −0.00308775 | −0.0152279 |
\((1,1,1,1,1,1)^{T}\) | 2978 | 4.2860 | \((0.8603,-0.1658,-0.5073)^{T}\) | −0.12681 | 1.08162 |
\((1,2,3,4,5,6)^{T}\) | 3317 | 4.8570 | \((3.6522,-0.1526,-2.3719)^{T}\) | −1.06831 | 15.5579 |