Quadratic convex reformulation for quadratic programming with linear on-off constraints
From MaRDI portal
Publication:1755375
DOI10.1016/j.ejor.2018.09.028zbMath1430.90455OpenAlexW2892385339WikidataQ129244369 ScholiaQ129244369MaRDI QIDQ1755375
Baiyi Wu, Rujun Jiang, Li, Duan
Publication date: 9 January 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.09.028
integer programmingmixed integer quadratic programmingsemidefinite programquadratic convex reformulationon-off constraint
Uses Software
Cites Work
- Unnamed Item
- New reformulations for probabilistically constrained quadratic programs
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Extending the QCR method to general mixed-integer programs
- Convex analysis and nonlinear optimization. Theory and examples.
- 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
- Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints
- Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- On mathematical programming with indicator constraints
- On handling indicator constraints in mixed integer programming
- A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem
- 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
- Partial Lagrangian relaxation for general quadratic programming
- Graph Implementations for Nonsmooth Convex Programs
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
