Gaddum’s test for symmetric cones

A real symmetric matrix “A” is copositive if the inner product if Ax and x is nonnegative for all x in the nonnegative orthant. Copositive programming has attracted a lot of attention since Burer showed that hard nonconvex problems can be formulated as completely-positive programs. Alas, the power of copositive programming is offset by its … Read more