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.02 | 142 | 439 | 0.01 | 99 | 309 | 0.06 |
n = 300 | 259 | 540 | 0.04 | 180 | 553 | 0.03 | 97 | 302 | 0.08 |
n = 500 | 531 | 1,109 | 0.15 | 226 | 699 | 0.09 | 189 | 579 | 0.23 |
n = 600 | 520 | 1,160 | 0.23 | 251 | 768 | 0.14 | 129 | 400 | 0.18 |
n = 800 | 568 | 1,236 | 0.48 | 246 | 754 | 0.31 | 197 | 603 | 0.48 |