Table 7 Results for Example 5.6 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 | Lagrange multiplier |
|---|---|---|---|---|
\((1,2,1,0)^{T}\) | 15,562 | 17.745 | \((0.969812,0.969905,1.455039)^{T}\) | 1.061319 |
\((2,2,2,0)^{T}\) | 15,566 | 14.511 | \((0.969905,0.969812,1.455039)^{T}\) | 1.061319 |
\((1,2,3,0)^{T}\) | 15,567 | 11.666 | \((0.969812,0.969905,1.455039)^{T}\) | 1.061319 |
\((4,5,6,0)^{T}\) | 15,566 | 17.495 | \((0.969812,0.969905,1.455039)^{T}\) | 1.061319 |