Table 1 Computational results for Problem 5.1 with different dimensions
From: Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping
|  | Initial point | rand( N ,1) | 200 × rand( N ,1) | 5e | 5,000e | |
|---|---|---|---|---|---|---|
N = 5 m = 5 | Algorithm 3.1 | Iter. | 2 | 62 | 5 | 9 |
Sec. | 0 | 0 | 0 | 0 | ||
Mann algorithm | Iter. | 64 | 68 | 73 | 74 | |
Sec. | 0 | 0 | 0 | 0 | ||
N = 1,000 m = 50 | Algorithm 3.1 | Iter. | 4 | 448 | 7 | 425 |
Sec. | 0.0156 | 1.0608 | 0.0312 | 1.0608 | ||
Mann algorithm | Iter. | 505 | 515 | 478 | 429 | |
Sec. | 1.2948 | 1.2480 | 1.2012 | 1.1076 | ||
N = 50 m = 1,000 | Algorithm 3.1 | Iter. | 6,814 | 7 | 4 | 9 |
Sec. | 38.9846 | 0.1092 | 0.0312 | 0.1248 | ||
Mann algorithm | Iter. | 8,438 | 7,771 | 8,692 | 6,913 | |
Sec. | 53.6799 | 43.4463 | 49.7799 | 38.7818 | ||