3 papers
math.OC2026
Sparse Cuts for the Positive Semidefinite Cone
Oktay Günlük, Paul Jünger, Jeff Linderoth +2
We consider optimization problems containing nonconvex quadratic functions for which semidefinite programming (SDP) relaxations often yield strong bounds. We investigate linear ine…
math.OC2026
Accelerating Benders decomposition for solving a sequence of sample average approximation replications
Harshit Kothari, James R. Luedtke
Sample average approximation (SAA) is a technique for obtaining approximate solutions to stochastic programs that uses the average from a random sample to approximate the expected…
cs.LG2025
On Integer Programming for the Binarized Neural Network Verification Problem
Woojin Kim, James R. Luedtke
Binarized neural networks (BNNs) are feedforward neural networks with binary weights and activation functions. In the context of using a BNN for classification, the verification pr…