Online generation via offline selection of strong linear cuts from quadratic SDP relaxations

16 October 2018
14:00
Radu Baltean-Logojan
Abstract

Convex and in particular semidefinite relaxations (SDP) for non-convex continuous quadratic optimisation can provide tighter bounds than traditional linear relaxations. However, using SDP relaxations directly in Branch&Cut is impeded by lack of warm starting and inefficiency when combined with other cut classes, i.e. the reformulation-linearization technique. We present a general framework based on machine learning for a strong linear outer-approximation that can retain most tightness of such SDP relaxations, in the form of few strong low dimensional linear cuts selected offline. The cut selection complexity is taken offline by using a neural network estimator (trained before installing solver software) as a selection device for the strongest cuts. Lastly, we present results of our method on QP/QCQP problem instances.

  • Numerical Analysis Group Internal Seminar