From: A cutting hyperplane method for solving pseudomonotone non-Lipschitzian equilibrium problems
Scheme (2.1)-(2.3) | Algorithm 2a in [14] | ||||
---|---|---|---|---|---|
Problem | No. iterations | CPU times (seconds) | Problem | No. iterations | CPU times (seconds) |
1 | 16 | 1.8438 | 1 | 23 | 1.1388 |
2 | 13 | 1.4375 | 2 | 15 | 2.1103 |
3 | 19 | 2.5156 | 3 | 25 | 3.1023 |
4 | 21 | 2.7031 | 4 | 22 | 3.7801 |
5 | 14 | 1.7344 | 5 | 17 | 2.0183 |
6 | 16 | 1.9531 | 6 | 19 | 2.0081 |
7 | 16 | 1.8594 | 7 | 21 | 1.5921 |
8 | 19 | 2.5938 | 8 | 25 | 3.0142 |
9 | 16 | 2.1875 | 9 | 15 | 1.9082 |
10 | 12 | 1.5632 | 10 | 23 | 4.0115 |