Research Article
An Accelerated Fixed-Point Algorithm Applied to Quadratic Convex Separable Knapsack Problems
Table 14
Results of the sensor placement problem.
| Dimension | Iterations | Time (sec) | Error | | Avg | Max | Min | Avg | Max | Min | ā |
| FPA2 | 100 | 11.4 | 13 | 10 | 0.0 | 0.0 | 0.0 | 0 | 1000 | 16.5 | 18 | 15 | 0.1 | 0.1 | 0.0 | 0 | 10000 | 20.4 | 23 | 19 | 0.7 | 0.8 | 0.5 | 0 | 100000 | 24.3 | 25 | 23 | 7.2 | 9.5 | 6.6 | 0 | 1000000 | 28.8 | 30 | 28 | 87.9 | 103.2 | 83.6 | 0 |
| Newton | 100 | 11.4 | 13 | 10 | 0.0 | 0.0 | 0.0 | 0 | 1000 | 16.5 | 18 | 15 | 0.1 | 0.1 | 0.1 | 0 | 10000 | 20.7 | 23 | 19 | 1.0 | 1.2 | 0.8 | 0 | 100000 | 24.3 | 25 | 23 | 10.3 | 13.3 | 9.5 | 0 | 1000000 | 28.8 | 30 | 28 | 123.2 | 192.3 | 109.7 | 0 |
| Variable fixing | 100 | 11.4 | 13 | 10 | 0.0 | 0.0 | 0.0 | 0 | 1000 | 16.5 | 18 | 15 | 0.1 | 0.1 | 0.0 | 0 | 10000 | 20.7 | 22 | 19 | 0.8 | 1.0 | 0.6 | 0 | 100000 | 22.7 | 24 | 20 | 9.2 | 9.9 | 8.7 | 0 | 1000000 | 21.9 | 23 | 20 | 113.0 | 185.2 | 99.6 | 0 |
| FPA | 100 | 11.4 | 13 | 10 | 0.0 | 0.0 | 0.0 | 0 | 1000 | 16.5 | 18 | 15 | 0.1 | 0.1 | 0.1 | 0 | 10000 | 20.4 | 23 | 19 | 1.0 | 1.1 | 0.8 | 0 | 100000 | 24.3 | 25 | 23 | 10.8 | 13.6 | 10.1 | 0 | 1000000 | 28.8 | 30 | 28 | 133.9 | 154.6 | 126.7 | 0 |
| Secant | 100 | 37.2 | 61 | 28 | 0.0 | 0.0 | 0.0 | 0 | 1000 | 68.4 | 122 | 40 | 0.3 | 0.6 | 0.2 | 0 | 10000 | 442.7 | 1001 | 53 | 15.8 | 35.0 | 2.4 | 4 | 100000 | 1001.0 | 1001 | 1001 | 287.6 | 415.0 | 269.8 | 10 | 1000000 | 1001.0 | 1001 | 1001 | 3640.9 | 4487.0 | 3485.7 | 10 |
| Median search | 100 | 8.0 | 8 | 8 | 0.0 | 0.0 | 0.0 | 0 | 1000 | 11.0 | 11 | 11 | 0.1 | 0.1 | 0.1 | 0 | 10000 | 14.0 | 14 | 14 | 1.0 | 1.1 | 0.8 | 0 | 100000 | 18.0 | 18 | 18 | 9.0 | 10.1 | 8.7 | 0 | 1000000 | 21.0 | 21 | 21 | 96.2 | 158.6 | 87.4 | 0 |
|
|