A feasible method for solving an SDP relaxation of the quadratic knapsack problem
In this paper, we consider a semidefinite programming (SDP) relaxation of the quadratic knapsack problem. After applying low-rank factorization, we get a nonconvex problem, whose feasible region is an algebraic […]