On the convex hull of convex quadratic optimization problems with indicators
From MaRDI portal
Publication:6120854
DOI10.1007/s10107-023-01982-0arXiv2201.00387OpenAlexW4379792694MaRDI QIDQ6120854
Linchuan Wei, Andrés Gómez, Atamtürk, Alper, Simge Küçükyavuz
Publication date: 21 February 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.00387
Cites Work
- Unnamed Item
- Unnamed Item
- A lasso for hierarchical interactions
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Parallel machine match-up scheduling with manufacturing cost considerations
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- Computational study of a family of mixed-integer quadratic programming problems
- Convex programming for disjunctive convex optimization
- Quadratic optimization with switching variables: the convex hull for \(n=2\)
- Ideal formulations for constrained convex optimization problems with indicator variables
- Submodular functions: from discrete to continuous domains
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- OR Forum—An Algorithmic Approach to Linear Regression
- Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
- On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs
- Cardinality Constrained Linear-Quadratic Optimal Control
- An efficient algorithm for image segmentation, Markov random fields and related problems
- Conditions for Positive and Nonnegative Definiteness in Terms of Pseudoinverses
- \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables
- A graph-based decomposition method for convex quadratic optimization with indicators
- Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix
- Supermodularity and valid inequalities for quadratic optimization with indicators
