Nonconvex quadratic programming

A common question I get is along the lines how can I solve a nonconvex QP using SeDuMi?

A new example dives into the issue.