News for hackers. Stuff that matters.

A comment on Show HN: OSQP: a new first-order solver for large-scale quadratic programs. Parent comment

Re:Show HN: OSQP: a new first-order solver for large-scale q... by tmyklebu on Sunday November 26, 2017 @06:54PM (#15783791)
Did you test miosqp against standard MIQPs? For example, in QPLIB, there is a handful of convex mixed-integer QPs.
[ Parent | on HN ]
Re:Show HN: OSQP: a new first-order solver for large-scale q... by sidereus on Sunday November 26, 2017 @07:50PM (#15784013)
Haven't tried the MIQP extension against the QPLIB yet. It is just a prototype and it is written in Python. We first need to implement it in C to compare the timings.
[ Parent | on HN ]
Re:Show HN: OSQP: a new first-order solver for large-scale q... by tmyklebu on Sunday November 26, 2017 @08:49PM (#15784251)
You could compare number of nodes explored rather than absolute timings to see how inaccuracy solving the relaxations affects branch-and-bound.
[ Parent | on HN ]