News for hackers. Stuff that matters.
Re:Show HN: OSQP: a new first-order solver for large-scale q... by LolWolf on Sunday November 26, 2017 @05:01PM (#15783276)
If the variable is constrained to be an integer, the problem becomes NP-hard-as-hell (in both a complexity sense and an approximation sense), sadly. It also stops being convex, so splitting-cone methods can't be directly applied and the solution here goes out the window.

In general, you assume the variables here to be real-valued vectors.

There are no comments on this comment yet.