90C20 Quadratic programming
Refine
Document Type
- ZIB-Report (10)
- Doctoral Thesis (1)
Language
- English (11)
Is part of the Bibliography
- no (11)
Keywords
- Pooling Problem (4)
- Cutting Planes (2)
- Large Neighborhood Search (2)
- Mixed-Integer Nonlinear Programming (2)
- Nonconvexity (2)
- Primal Heuristic (2)
- Quadratic Programming (2)
- Relaxation (2)
- Relaxations (2)
- Standard Quadratic Programming (2)
- Computations (1)
- Decomposition (1)
- Extreme Points (1)
- Gas Network Planning (1)
- Intersection cuts (1)
- Mixed-Integer Quadratically Constrained Programming (1)
- Mixed-Integer Quadratically Constrained Programming (1)
- Mixed-Intger Programming (1)
- Nonconvex Optimization (1)
- QCQPs (1)
- Quadratic-free sets (1)
- Robust Optimization (1)
- Uncertainty (1)
- Valid Inequalities (1)
- bisection (1)
- constraint integer programming (1)
- convex relaxation (1)
- downside risk (1)
- equicut (1)
- integer programming (1)
- max-cut (1)
- mean-variance analysis (1)
- mixed integer quadratically constrained programming (1)
- multi-period model (1)
- nonconvex (1)
- nonlinear programming (1)
- quadratic 0-1 programming (1)
- quadratic programming (1)
- semidefinite programming (1)
- spectral bundle method (1)
- subgradient method (1)
- vehicle positioning (1)
Institute
The generation of strong linear inequalities for QCQPs has been recently tackled by a number of authors using the intersection cut paradigm - a highly studied tool in integer programming whose flexibility has triggered these renewed efforts in non-linear settings. In this work, we consider intersection cuts using the recently proposed construction of maximal quadratic-free sets. Using these sets, we derive closed-form formulas to compute intersection cuts which allow for quick cut-computations by simply plugging-in parameters associated to an arbitrary quadratic inequality being violated by a vertex of an LP relaxation. Additionally, we implement a cut-strengthening procedure that dates back to Glover and evaluate these techniques with extensive computational experiments.