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

Table 7

Correlated test for accelerated algorithms.

Dimension	Iterations			Time (sec)			Error
	Avg	Max	Min	Avg	Max	Min	—
FPA2-Aitken
500000	2.2	4	1	0.017	0.019	0.015	0
1000000	2.3	4	1	0.036	0.042	0.031	0
10000000	2.2	4	1	0.375	0.440	0.317	0
50000000	2.1	4	1	1.834	2.001	1.646	0
FPA2
500000	5.0	8	3	0.016	0.018	0.015	0
1000000	5.3	8	4	0.035	0.042	0.032	0
10000000	5.2	10	4	0.367	0.459	0.329	0
50000000	5.1	9	4	1.807	1.983	1.657	0
FPA2-Anderson
500000	3.5	10	1	0.017	0.021	0.012	0
1000000	4.0	9	2	0.037	0.043	0.032	0
10000000	3.3	5	2	0.371	0.412	0.326	5
50000000	3.2	5	2	1.802	2.102	1.609	5
FPA
500000	5.0	8	3	0.020	0.021	0.018	0
1000000	5.3	8	4	0.042	0.051	0.037	0
10000000	5.2	10	4	0.434	0.547	0.388	0
50000000	5.1	9	4	2.115	2.385	1.918	0