For second phase of two-phase exploration the goal is to choose the leaf with the "best bound". We are performing a minimisation problem and therefore the best lower bound is the smallest one - argmax should be argmin.
https://github.com/oxfordcontrol/miosqp/blob/master/miosqp/workspace.py#L145
Replacing it reduces the number of iterations in my problems substantially (over 100x)!
For second phase of two-phase exploration the goal is to choose the leaf with the "best bound". We are performing a minimisation problem and therefore the best lower bound is the smallest one -
argmaxshould beargmin.https://github.com/oxfordcontrol/miosqp/blob/master/miosqp/workspace.py#L145
Replacing it reduces the number of iterations in my problems substantially (over 100x)!