Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
where the matrix is positive semidefinite. Obviously, this problem is a NP-Hard combinatorial problem. My question is if this problem can be relaxed and somehow rewritten as a convex problem. Thanks
