From: An algorithm for the split-feasibility problems with application to the split-equality problem
 | \(\mathbf{PRGA}\ \boldsymbol {[x_{1}=(1,1)^{T}, \rho=0.06]}\) | ||
---|---|---|---|
ε | CPU(s) | Iteration | Approximate solution |
10−3 | − | 375 | (0.5993223, 0.8005078) |
10−4 | 0.16 | 7086 | (0.5999597, 0.8000302) |
10−5 | 0.22 | 9493 | (0.5999947, 0.8000040) |
10−6 | 1.00 | 44,211 | (0.6000002, 0.7999999) |
10−7 | 24.63 | 1,058,254 | (0.6, 0.8) |