On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
From MaRDI portal
Publication:4910814
DOI10.1007/978-3-642-36694-9_15zbMath1372.90073OpenAlexW206383345MaRDI QIDQ4910814
Publication date: 19 March 2013
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36694-9_15
semidefinite programmingvalid inequalitiesperspective reformulationmixed integer quadratic programming
Semidefinite programming (90C22) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20)
Related Items
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods, On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables, Valid Inequalities for Separable Concave Constraints with Indicator Variables, Strong formulations for quadratic optimization with M-matrices and indicator variables, The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables, \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables, Extended formulations in mixed integer conic quadratic programming, Convex hull results on quadratic programs with non-intersecting constraints, Supermodularity and valid inequalities for quadratic optimization with indicators, Quadratic cone cutting surfaces for quadratic programs with on-off constraints, Strong formulations for conic quadratic optimization with indicator variables, Quadratic optimization with switching variables: the convex hull for \(n=2\), Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations, Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization, Ideal formulations for constrained convex optimization problems with indicator variables
