Table 1 Numerical comparisons for test Examples 1–6
From: An accelerating algorithm for globally solving nonconvex quadratic programming
E.g. | Methods | Opt. val. | Opt. sol. | Iter. | Time (s) |
|---|---|---|---|---|---|
1 | ours | 10.00000 | (2.0000, 8.0000) | 3 | 0.35725 |
[25] | 10.0000090 | (1.9999998, 7.9999988) | 41 | 0.02 | |
[26] | 10 | (2, 8) | 27 | 10.83 | |
[27] | 10 | (2, 8) | 53 | 0.3 | |
2 | ours | 3.00000 | (0.0000, 4.0000) | 8 | 0.01791 |
[28] | 3.00000 | (0.0000, 4.0000) | 25 | 0.750 | |
3 | ours | 0.890185 | (1.3148, 0.1396, 0.0, 0.4233) | 1 | 0.38982 |
[27] | 0.8902 | (1.3148, 0.1396, 0.0, 0.4233) | 1 | 0.1880 | |
[29] | 0.890193 | (1.314792, 0.13955, 0.0, 0.423286) | 6 | ||
4 | ours | −16.22662 | (0.0, 3.6403, 0.0, 2.9029, 1.9388, 0.0) | 5 | 0.59005 |
5 | ours | −3.00000 | (3.0000, 3.0000) | 30 | 4.15970 |
6 | ours | −1.06250 | (0.7500, 2.0000) | 3 | 0.26845 |