13 citations · 27 across the 4 of their papers we have counts for
Showing 2018 · math.OCShow all
3 papers · 2 filters
math.OC2018
The convex hull of a quadratic constraint over a polytope
Asteroide Santana, Santanu S. Dey
A quadratically constrained quadratic program (QCQP) is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadra…
math.OC2018★ 7 cited
On Subadditive Duality for Conic Mixed-Integer Programs
Burak Kocuk, Diego Moran
In this paper, we show that the subadditive dual of a feasible conic mixed-integer program (MIP) is a strong dual whenever it is feasible. Moreover, we show that this dual feasibil…
math.OC2018
New SOCP relaxation and branching rule for bipartite bilinear programs
Santanu S. Dey, Asteroide Santana, Yang Wang
A bipartite bilinear program (BBP) is a quadratically constrained quadratic optimization problem where the variables can be partitioned into two sets such that fixing the variables…