Use the spectral theorem for real symmetric matrices to write , with orthogonal and diagonal and nonnegative. For any sign vector, , soThis is an exact identity for every sign choice. Put . When , the Rademacher rounding for a semidefinite relaxation givesHence is feasible. In the finite spanning case from part (a), makes , and the spanning condition then gives . If a nonzero instead had , it would be an unbounded feasible direction rather than a vector to divide by zero.
Articles by others on the same topic
There are currently no matching articles.