From: A projection descent method for solving variational inequalities
Dimension of the problem | The method in [ 14 ] | Algorithm 1 with \(\boldsymbol{\alpha ^{*}_{k_{1}}}\) | Algorithm 1 with \(\boldsymbol{\alpha^{*}_{k_{2}}}\) | ||||||
---|---|---|---|---|---|---|---|---|---|
k | l | CPU (sec.) | k | l | CPU (sec.) | k | l | CPU (sec.) | |
n = 100 | 318 | 676 | 0.03 | 93 | 312 | 0.01 | 68 | 235 | 0.05 |
n = 300 | 435 | 936 | 0.07 | 127 | 404 | 0.03 | 111 | 356 | 0.09 |
n = 500 | 489 | 1,035 | 0.15 | 146 | 491 | 0.07 | 129 | 416 | 0.17 |
n = 600 | 406 | 877 | 0.18 | 117 | 378 | 0.08 | 92 | 299 | 0.15 |
n = 800 | 386 | 832 | 0.64 | 110 | 359 | 0.29 | 76 | 249 | 0.28 |