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

Table 6

Weakly correlated test for accelerated algorithms.

Dimension	Iterations			Time (sec)			Error
	Avg	Max	Min	Avg	Max	Min	—
FPA2-Aitken
500000	2.3	4	1	0.019	0.022	0.017	0
1000000	2.2	5	1	0.037	0.048	0.031	0
10000000	2.1	5	1	0.368	0.456	0.318	0
50000000	2.1	3	1	1.820	2.159	1.624	0
FPA2
500000	5.2	8	4	0.019	0.021	0.018	0
1000000	5.2	9	4	0.036	0.042	0.032	0
10000000	5.3	10	4	0.362	0.416	0.329	0
50000000	5.2	7	4	1.841	2.045	1.642	0
FPA2-Anderson
500000	5.3	57	2	0.021	0.064	0.017	0
1000000	3.7	8	2	0.037	0.042	0.031	1
10000000	3.2	5	2	0.367	0.427	0.325	7
50000000	3.5	5	2	1.848	2.056	1.633	5
FPA
500000	5.2	8	4	0.023	0.026	0.021	0
1000000	5.2	9	4	0.042	0.050	0.037	0
10000000	5.3	10	4	0.429	0.496	0.389	0
50000000	5.2	7	4	2.137	2.470	1.930	0