An Accelerated Fixed-Point Algorithm Applied to Quadratic Convex Separable Knapsack Problems

Table 5

Uncorrelated test for accelerated algorithms.

Dimension	Iterations			Time (sec)			Error
	Avg	Max	Min	Avg	Max	Min	—
FPA2-Aitken
500000	2.5	6	2	0.017	0.022	0.016	1
1000000	2.4	4	1	0.035	0.039	0.031	1
10000000	2.3	5	2	0.363	0.474	0.333	1
50000000	2.5	4	2	1.749	1.957	1.612	0
FPA2
500000	5.5	8	4	0.016	0.018	0.015	0
1000000	5.4	10	4	0.034	0.040	0.031	0
10000000	5.3	10	4	0.355	0.406	0.325	0
50000000	5.3	8	4	1.681	1.864	1.585	0
FPA2-Anderson
500000	4.4	16	2	0.017	0.026	0.015	2
1000000	4.3	11	2	0.036	0.046	0.031	1
10000000	3.3	5	2	0.358	0.417	0.323	9
50000000	3.2	5	2	1.676	1.839	1.568	10
FPA
500000	5.5	8	4	0.019	0.022	0.018	0
1000000	5.4	10	4	0.040	0.047	0.037	0
10000000	5.3	10	4	0.418	0.487	0.378	0
50000000	5.3	8	4	1.982	2.206	1.855	0