Timeline for sparse binary vector
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 18, 2013 at 10:42 | vote | accept | Cruiselan | ||
| Feb 18, 2013 at 10:42 | vote | accept | Cruiselan | ||
| Feb 18, 2013 at 10:42 | |||||
| Feb 15, 2013 at 23:54 | comment | added | Suvrit | search for "binary QP" or "boolean QP" and you'll find tons of info. | |
| Feb 15, 2013 at 22:06 | comment | added | Gerry Myerson | The statement of the question should be edited into the body of the question, not left in a comment. | |
| Feb 15, 2013 at 19:25 | answer | added | Günter Rote | timeline score: 2 | |
| Feb 15, 2013 at 17:37 | comment | added | Cruiselan | 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 | |
| Feb 15, 2013 at 17:21 | history | asked | Cruiselan | CC BY-SA 3.0 |