\(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables
From MaRDI portal
Publication:6052055
DOI10.1007/s10107-023-01924-wzbMath1522.90043arXiv2004.07448MaRDI QIDQ6052055
Andrés Gómez, Atamtürk, Alper, Shaoning Han
Publication date: 23 October 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.07448
semidefinite programmingconvexificationindicator variablesperspective formulationmixed-integer quadratic optimization
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
- On general minimax theorems
- Extended formulations for convex hulls of some bilinear functions
- Minotaur: a mixed-integer nonlinear optimization toolkit
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- Valid inequalities for separable concave constraints with indicator variables
- Computational study of a family of mixed-integer quadratic programming problems
- Strong formulations for conic quadratic optimization with indicator variables
- Quadratic optimization with switching variables: the convex hull for \(n=2\)
- New SOCP relaxation and branching rule for bipartite bilinear programs
- On mathematical programming with indicator constraints
- On handling indicator constraints in mixed integer programming
- Submodular functions: from discrete to continuous domains
- On convex envelopes for bivariate functions over polytopes
- On factor width and symmetric \(H\)-matrices
- 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
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables
- Perspective Reformulations of the CTA Problem with L2 Distances
- Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
- Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization
- Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs
- A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints
- Cardinality Constrained Linear-Quadratic Optimal Control
- Quadratic Convex Reformulations for Semicontinuous Quadratic Programming
- An efficient algorithm for image segmentation, Markov random fields and related problems
- Convex Analysis
- A graph-based decomposition method for convex quadratic optimization with indicators
- Supermodularity and valid inequalities for quadratic optimization with indicators
