46 citations · 54 across the 6 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.OC2024★ 1 cited
Constructing Tight Quadratic Relaxations for Global Optimization: II. Underestimating Difference-of-Convex (D.C.) Functions
William R. Strahl, Arvind U. Raghunathan, Nikolaos V. Sahinidis +1
Recent advances in the efficiency and robustness of algorithms solving convex quadratically constrained quadratic programming (QCQP) problems motivate developing techniques for cre…
math.OC2024★ 1 cited
Constructing Tight Quadratic Relaxations for Global Optimization: I. Outer-Approximating Twice-Differentiable Convex Functions
William R. Strahl, Arvind U. Raghunathan, Nikolaos V. Sahinidis +1
When computing bounds, spatial branch-and-bound algorithms often linearly outer approximate convex relaxations for non-convex expressions in order to capitalize on the efficiency a…