Quadratic cone cutting surfaces for quadratic programs with on-off constraints
From MaRDI portal
Publication:1751215
DOI10.1016/j.disopt.2016.04.008zbMath1387.90174OpenAlexW2478973774MaRDI QIDQ1751215
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2016.04.008
Related Items (14)
On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables ⋮ Strong formulations for quadratic optimization with M-matrices and indicator variables ⋮ \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables ⋮ Extended formulations in mixed integer conic quadratic programming ⋮ A graph-based decomposition method for convex quadratic optimization with indicators ⋮ Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs ⋮ On the convex hull of convex quadratic optimization problems with indicators ⋮ Unnamed Item ⋮ Supermodularity and valid inequalities for quadratic optimization with indicators ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ Strong formulations for conic quadratic optimization with indicator variables ⋮ A Mixed-Integer Fractional Optimization Approach to Best Subset Selection ⋮ Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization ⋮ Ideal formulations for constrained convex optimization problems with indicator variables
Cites Work
- Unnamed Item
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Corner polyhedra and their connection with cutting planes
- Computational study of a family of mixed-integer quadratic programming problems
- Integer and mixed-integer programming models: General properties
- The risk inflation criterion for multiple regression
- Convex programming for disjunctive convex optimization
- 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
- On Minimal Valid Inequalities for Mixed Integer Conic Programs
- Perspective Reformulation and Applications
- Aircraft Rescheduling with Cruise Speed Control
- 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
- Sparse Filter Design Under a Quadratic Constraint: Low-Complexity Algorithms
- On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
- Cardinality Constrained Linear-Quadratic Optimal Control
This page was built for publication: Quadratic cone cutting surfaces for quadratic programs with on-off constraints
