Solve for x : Technical Perspective
Daniel A. Spielman · Communications of the ACM · 2024
We present a new ellipsoidal relaxation of 0-1 quadratic optimization problems. The relaxation and the dual problem are derived. Both these problems are strictly feasible; so strong duality holds, and they can be solved numerically using primal-dual ...