Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming
From MaRDI portal
Publication:2666655
DOI10.3934/jimo.2020071zbMath1476.90213OpenAlexW3013712002MaRDI QIDQ2666655
Publication date: 23 November 2021
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2020071
quadratic programmingsemi-continuousquadratic convex reformulationmixed-integer quadratically constrained quadratic programmingquadratically constrained convex reformulation
Uses Software
Cites Work
- Extending the QCR method to general mixed-integer programs
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Computational study of a family of mixed-integer quadratic programming problems
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Projected Perspective Reformulations with Applications in Design Problems
- Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
- Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
- Semidefinite Programming
- Quadratic Convex Reformulations for Semicontinuous Quadratic Programming
- Unnamed Item
This page was built for publication: Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming
