1 citations · 1 across the 2 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2024★ 1 cited
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…
math.OC2023
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…