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

Table 11

Correlated test for root-finding algorithms.

Dimension	Iterations			Time (sec)			Error
	Avg	Max	Min	Avg	Max	Min	—
FPA2
500000	4.9	8	3	0.015	0.017	0.014	0
1000000	5.2	8	4	0.033	0.036	0.031	0
10000000	5.2	10	4	0.343	0.410	0.322	0
50000000	5.0	9	4	1.633	1.878	1.544	0
Regula falsi
500000	11.2	40	6	0.086	0.132	0.059	5
1000000	11.9	77	4	0.169	0.443	0.113	6
10000000	13.3	96	6	1.861	6.058	1.224	11
50000000	11.5	66	4	9.078	21.548	5.451	5
Secant
500000	8.7	12	6	0.072	0.109	0.058	15
1000000	8.6	11	6	0.143	0.201	0.113	12
10000000	8.5	12	6	1.466	2.178	1.172	17
50000000	8.6	15	6	7.598	10.430	5.978	13
Bisection
500000	50.1	53	45	0.135	0.206	0.056	4
1000000	49.9	53	45	0.258	0.393	0.186	6
10000000	49.8	53	42	2.692	4.051	1.162	8
50000000	50.5	53	44	14.889	20.946	6.336	4