Conflict analysis originally tried to exploit the knowledge that certain nodes in a relaxation-based branch-and-bound are infeasible. It has been extended to derive valid constraints also from feasible nodes. This paper adapts this approach to mixed-integer semidefinite programs. Using dual solutions, the primal constraints are aggregated and the resulting inequalities can be used at different nodes in the tree to tighten variable bounds. We show that this helps to speed up the solutions times by about 8 % on our testset.
Article
View Dual Conflict Analysis for Mixed-Integer Semidefinite Programs