Research Article
An Accelerated Fixed-Point Algorithm Applied to Quadratic Convex Separable Knapsack Problems
| 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 . | | Step 3 (Update dual variable) | | Compute . | | Step 4 (Check stopping criterion) | | If , then set according to equations (30) and (33) and STOP. Otherwise, set and return to Step 2. |
|