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

Table 8

Flow test for accelerated algorithms.

Dimension	Iterations			Time (sec)			Error
	Avg	Max	Min	Avg	Max	Min	—
FPA2-Aitken
500000	3.2	6	2	0.019	0.022	0.015	0
1000000	3.5	6	2	0.039	0.050	0.032	2
10000000	3.2	6	2	0.404	0.492	0.334	0
50000000	3.2	5	2	1.978	2.266	1.690	2
FPA2
500000	6.2	8	5	0.018	0.021	0.015	0
1000000	6.6	9	5	0.036	0.043	0.031	0
10000000	6.3	8	4	0.390	0.433	0.329	0
50000000	6.5	9	5	1.871	2.109	1.675	0
FPA2-Anderson
500000	6.2	24	3	0.019	0.034	0.015	2
1000000	6.5	23	3	0.040	0.074	0.032	9
10000000	4.2	5	2	0.380	0.422	0.321	24
50000000	4.6	5	3	1.874	2.004	1.678	23
FPA
500000	6.2	8	5	0.021	0.027	0.018	0
1000000	6.6	9	5	0.043	0.054	0.037	0
10000000	6.3	8	4	0.460	0.517	0.379	0
50000000	6.5	9	5	2.197	2.502	1.953	0