Table 3 Results for Example 5.4 using Qu and Xiu method in [6]
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}\) | 64 | 0.1570 | \((-0.4019,0.0674,0.1967)^{T}\) | −0.00395724 | 0.0322236 |
\((1,1,1)^{T}\) | 81 | 0.0940 | \((0.3568,0.0343,-0.2652)^{T}\) | −0.172424 | 0.426806 |
rand(3,1)∗10 | 105 | 0.0940 | \((0.8747,0.0795,-0.6876)^{T}\) | −0.49418 | 1.5322 |