1 citations · 1 across the 3 of their papers we have counts for
4 papers · 1 filter
Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization
Immanuel Bomze, Bo Peng, Yuzhou Qiu +1
The Standard Quadratic optimization Problem (StQP), arguably the simplest among all classes of NP-hard optimization problems, consists of extremizing a quadratic form (the simplest…
On Tractable Convex Relaxations of Standard Quadratic Optimization Problems under Sparsity Constraints
Immanuel Bomze, Bo Peng, Yuzhou Qiu +1
Standard quadratic optimization problems (StQPs) provide a versatile modelling tool in various applications. In this paper, we consider StQPs with a hard sparsity constraint, refer…
Polyhedral Properties of RLT Relaxations of Nonconvex Quadratic Programs and Their Implications on Exact Relaxations
Yuzhou Qiu, E. Alper Yıldırım
We study linear programming relaxations of nonconvex quadratic programs given by the reformulation-linearization technique (RLT), referred to as RLT relaxations. We investigate the…
On Exact and Inexact RLT and SDP-RLT Relaxations of Quadratic Programs with Box Constraints
Yuzhou Qiu, E. Alper Yıldırım
Quadratic programs with box constraints involve minimizing a possibly nonconvex quadratic function subject to lower and upper bounds on each variable. This is a well-known NP-hard…