Global Solutions of Nonconvex Standard Quadratic Programs via Mixed Integer Linear Programming Formulations

Add to your list(s) Download to your calendar using vCal

• Emre Alper Yildirim (Koc University, Turkey)
• Thursday 13 December 2018, 12:00-13:00
• Nuffield G13.

If you have a question about this talk, please contact Sergey Sergeev.

A standard quadratic program is an optimization problem that consists of minimizing a (nonconvex) quadratic form over the unit simplex. We focus on reformulating a standard quadratic program as a mixed integer linear programming problem. We propose two alternative mixed integer linear programming formulations. Our first formulation is based on casting a standard quadratic program as a linear program with complementarity constraints. We then employ binary variables to linearize the complementarity constraints. For the second formulation, we first derive an overestimating function of the objective function and establish its tightness at any global minimizer. We then linearize the overestimating function using binary variables and obtain our second formulation. For both formulations, we propose a set of valid inequalities. Our extensive computational results illustrate that the proposed mixed integer linear programming reformulations significantly outperform other global solution approaches. On larger instances, we usually observe improvements of orders of magnitude.

This is joint work with Jacek Gondzio.

This talk is part of the Optimisation and Numerical Analysis Seminars series.

This talk is included in these lists:

• Nuffield G13
• Optimisation and Numerical Analysis Seminars
• School of Mathematics Events

Note that ex-directory lists are not shown.