Research Article
An Accelerated Fixed-Point Algorithm Applied to Quadratic Convex Separable Knapsack Problems
Table 2
Weakly correlated test for state-of-the-art algorithms.
| Dimension | Iterations | Time (sec) | Error | | Avg | Max | Min | Avg | Max | Min | ā |
| FPA2 | 500000 | 5.2 | 8 | 4 | 0.010 | 0.018 | 0.009 | 0 | 1000000 | 5.2 | 9 | 4 | 0.021 | 0.038 | 0.018 | 0 | 10000000 | 5.2 | 10 | 3 | 0.360 | 0.407 | 0.321 | 0 | 50000000 | 5.3 | 7 | 4 | 1.786 | 1.951 | 1.649 | 0 |
| Newton | 500000 | 5.1 | 8 | 4 | 0.019 | 0.024 | 0.015 | 0 | 1000000 | 5.2 | 9 | 4 | 0.037 | 0.050 | 0.032 | 0 | 10000000 | 5.1 | 10 | 3 | 0.419 | 0.501 | 0.318 | 0 | 50000000 | 5.1 | 7 | 3 | 2.105 | 2.476 | 1.721 | 0 |
| Variable fixing | 500000 | 8.2 | 11 | 7 | 0.022 | 0.025 | 0.019 | 0 | 1000000 | 8.5 | 11 | 7 | 0.046 | 0.053 | 0.040 | 0 | 10000000 | 9.0 | 12 | 8 | 0.534 | 0.589 | 0.483 | 0 | 50000000 | 9.1 | 10 | 8 | 2.610 | 2.911 | 2.372 | 0 |
| FPA | 500000 | 5.2 | 8 | 4 | 0.011 | 0.021 | 0.010 | 0 | 1000000 | 5.2 | 9 | 4 | 0.023 | 0.043 | 0.020 | 0 | 10000000 | 5.2 | 10 | 3 | 0.419 | 0.483 | 0.369 | 0 | 50000000 | 5.3 | 7 | 4 | 2.085 | 2.434 | 1.927 | 0 |
| Secant | 500000 | 8.5 | 13 | 7 | 0.021 | 0.037 | 0.012 | 0 | 1000000 | 8.4 | 13 | 6 | 0.039 | 0.066 | 0.023 | 0 | 10000000 | 8.3 | 14 | 6 | 0.417 | 0.658 | 0.235 | 0 | 50000000 | 8.4 | 12 | 6 | 2.236 | 3.186 | 1.094 | 0 |
| Median search | 500000 | 19.9 | 20 | 19 | 0.039 | 0.049 | 0.033 | 0 | 1000000 | 20.9 | 21 | 20 | 0.078 | 0.098 | 0.066 | 0 | 10000000 | 24.2 | 25 | 24 | 0.916 | 1.049 | 0.787 | 0 | 50000000 | 26.8 | 27 | 26 | 4.478 | 4.891 | 4.031 | 0 |
|
|