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 | 228 | 465 | 0.024 | 138 | 447 | 0.023 | 73 | 240 | 0.06 |
n = 300 | 259 | 540 | 0.04 | 185 | 580 | 0.03 | 103 | 332 | 0.09 |
n = 500 | 531 | 1,109 | 0.15 | 227 | 700 | 0.10 | 128 | 403 | 0.16 |
n = 600 | 520 | 1,160 | 0.22 | 225 | 701 | 0.13 | 135 | 419 | 0.20 |
n = 800 | 568 | 1,236 | 0.51 | 244 | 779 | 0.34 | 157 | 520 | 0.40 |