Quadratic optimization with switching variables: the convex hull for \(n=2\)
From MaRDI portal
Publication:2044962
DOI10.1007/s10107-021-01671-wzbMath1473.90104arXiv2002.04681OpenAlexW3177377053MaRDI QIDQ2044962
Samuel Burer, Kurt M. Anstreicher
Publication date: 11 August 2021
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.04681
Semidefinite programming (90C22) Convex programming (90C25) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
\(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables, A graph-based decomposition method for convex quadratic optimization with indicators, On the convex hull of convex quadratic optimization problems with indicators
Cites Work
- Unnamed Item
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Convex programming for disjunctive convex optimization
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Computable representations for convex hulls of low-dimensional quadratic forms
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
- Valid Inequalities for the Pooling Problem with Binary Variables
- The Convex Envelope of (n–1)-Convex Functions
- On Nonconvex Quadratic Programming with Box Constraints
- Matrix Analysis
- On the Matrix Equation X′X = A
- On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
