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

Algorithm 1

FPA algorithm.

	Step 0 (Initialization)
	Set k = 0. Let according to [2, 6, 12].
	Step 1 (Calculating dual bounds)
	For ,
	Compute .
	Step 2 (Calculating fixed-point sums)
	, where .
	, where .
	, where .
	, where .
	Step 3 (Update dual variable)
	Compute .
	Step 4 (Check stopping criterion)
	If , then set according to equation (13) and STOP. Otherwise, set and return to Step 2.