Showing math.OCShow all
3 papers · 1 filter
math.OC2024
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
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…
math.OC2024
A reformulation-enumeration MINLP algorithm for gas network design
Yijiang Li, Santanu S. Dey, Nikolaos V. Sahinidis
Gas networks are used to transport natural gas, which is an important resource for both residential and industrial customers throughout the world. The gas network design problem is…