From: An algorithm for the split-feasibility problems with application to the split-equality problem
ε | CPU(s) | Iteration | Approximate solution | CPU(s) | Iteration | Approximate solution |
---|---|---|---|---|---|---|
 | CQ algorithm | PRGA | ||||
10−3 | - | 2 | (0.5994553, 0.8004082) | 0.01 | 314 | (0.6006783, 0.7994908) |
10−4 | 375.25 | 1,630,698 | (0.5999200, 0.8000600) | 0.03 | 1334 | (0.5999466, 0.8000400) |
 | CQ-like algorithm (\(w_{n}=1\)) | CQ-like algorithm (\(w_{n}=1.9\)) | ||||
10−3 | 6.47 | 249,918 | (0.6007997, 0.7993996) | 3.41 | 131,247 | (0.6007997, 0.7993996) |
10−4 | 652.44 | 24,999,920 | (0.6000800, 0.7999400) | 342.80 | 13,157,560 | (0.6000800, 0.7999400) |