The standard quadratic optimization problem consists of minimizing a quadratic form over the standard simplex. It has highly relevant applications ranging from portfolio optimization to machine learning. However, if the quadratic form is neither convex nor concave, this problem is NP-hard. We study a distributionally r...
I. Bomze, Daniel de Vicente, Simge Küçükyavuz· 0 citations
This work develops the main components of CORe, including coordinate-wise optimality conditions, closed-form characterizations, and disjunctive reformulations, and demonstrates the framework across multiple problem families, including quadratic problems and robust single-index models.
Tong Xu, S. Fattahi, Andrés Gómez et al.· 0 citations
We present an open-source software package that implements a provably convergent Benders-type decomposition algorithm for multistage stochastic integer programs. In addition to standard cut families, such as Benders, strengthened Benders, and Lagrangian cuts, the algorithm incorporates rectified linear unit (ReLU) cuts...
Akul Bansal, Simge Küçükyavuz· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.