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

Algorithm 3

FPA2-Anderson algorithm.

	Step 0 (Initialization)
	Set k = 0. Let according to [2, 6, 12].
	Define .
	Step 1 (Calculating dual bounds)
	For ,
	Compute .
	Step 2 (Compute )
	Compute , and using according to FPA2 algorithm.
	Compute .
	Step 3 (Updating Anderson acceleration variables)
	Set .
	Let .
	Set .
	Determine according to equation (38).
	Set according to equation (39).
	Step 4 (Check stopping criterion)
	If , then set according to equations (30) and (33) and STOP. Otherwise, set and return to Step 2.