Table 1 Numerical results of Example 6.1
From: Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
Initial point: \(x_{0}=(1,1,1)^{T}\), \(y_{0}=(0,0,0)^{T}\) | |||
|---|---|---|---|
Algorithm | Time (s) | No. Iterations | Approximate solution \((x^{*},y^{*})\) |
RACQA (1.8) | 0.34021 | 7357 | \(x^{*}=(0.0130,1.000,0.0079)^{T}\) |
\(y^{*}=(0.0291,5.0008,0.0079)^{T}\) | |||
Algorithm 4.1 | 0.26312 | 5847 | \(x^{*}=(0.0001,0.9996,0.1028)^{T}\) |
\(y^{*}=(0.0002,4.9990,0.1030)^{T}\) | |||