22 citations · 34 across the 6 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.OC2023★ 1 cited
Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
Evren M. Turan, Johannes Jäschke, Rohit Kannan
We use sensitivity analysis to design bounding-focused discretization (cutting-surface) methods for the global optimization of nonconvex semi-infinite programs (SIPs). We begin by…
math.OC2023★ 1 cited
Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs
Rohit Kannan, Harsha Nagarajan, Deepjyoti Deka
We learn optimal instance-specific heuristics for the global minimization of nonconvex quadratically-constrained quadratic programs (QCQPs). Specifically, we consider partitioning-…