Table 4 Results for Example 5.4 using Li method in Algorithm 1 [8]
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}\) | 4 | 0.1410 | \((-0.4024,0.0658,0.1958)^{T}\) | −0.00647036 | 0.0319258 |
\((1,1,1)^{T}\) | 5 | 0.0940 | \((0.3532,0.0392,-0.2707)^{T}\) | −0.186663 | 0.43465 |
rand(3,1)∗10 | 8 | 0.0940 | \((0.8768,0.0604,-0.6844)^{T}\) | −0.488352 | 1.51358 |