Table 2 Computational results for Problem 5.2 with different initial points
From: Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping
Initial point | (1,0,0) | (0,1,0) | (0,0.5,0.5) | (0.5,0.5,0.5) | |
|---|---|---|---|---|---|
CQ algorithm | Iter. | 652 | 167 | 1,441 | 38 |
Sec. | 0.1092 | 0.0312 | 0.2652 | 0 | |
Accelerated CQ algorithm | Iter. | 577 | 273 | 1,430 | 84 |
Sec. | 0.0936 | 0.0468 | 0.2496 | 0.0156 | |