On the continuous quadratic knapsack problem

The authors introduce a new algorithm for the continuous bounded quadratic knapsack problem. This algorithm is motivated by the geometry of the problem, is based on the iterative solution of a series of simple projection problems, and is easy to understand and implement. In practice, the method compares favorable to other well-known algorithms (some of which have superior worst-case complexity) on problem sizes up to n=4000.