Variable fixing method by weighted average for the continuous quadratic knapsack problem

Abstract

<p style='text-indent:20px;'>We analyze the method of solving the separable convex continuous quadratic knapsack problem by weighted average from the viewpoint of variable fixing. It is shown that this method, considered as a variant of the variable fixing algorithms, and Kiwiel's variable fixing method generate the same iterates. We further improve the algorithm based on the analysis regarding the semismooth Newton method. Computational results are given and comparisons are made among the state-of-the-art algorithms. Experiments show that our algorithm has significantly good performance; it behaves very much like an <inline-formula><tex-math id="M1">\begin{document}$ O(n) $\end{document}</tex-math></inline-formula> algorithm with a very small constant.</p>