Separable Convex Optimization Problems with Linear Ascending Constraints
SIAM Journal on Optimization
Hi-index | 0.00 |
We give several linear time algorithms for the continuous quadratic knapsack problem. In addition, we report cycling and wrong-convergence examples in a number of existing algorithms, and give encouraging computational results for large-scale problems.