In early experiments we observe that for both tasks, projecting with respect to all constraints of their original formulations using a generic quadratic program solver was prohibitively slow.
we construct relaxed polytopes by considering only a subset of the constraints.