The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables
From MaRDI portal
Publication:2670502
DOI10.1016/j.orl.2022.01.007MaRDI QIDQ2670502
Shaoning Han, Andrés Gómez, Atamtürk, Alper
Publication date: 11 March 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.04618
semidefinite programming; convexification; indicator variables; perspective formulation; mixed-integer quadratic optimization
90-XX: Operations research, mathematical programming
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- On general minimax theorems
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Computational study of a family of mixed-integer quadratic programming problems
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Sparse learning via Boolean relaxations
- Submodular functions: from discrete to continuous domains
- 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
- 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
- Phase transitions in semidefinite relaxations
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
- Cardinality Constrained Linear-Quadratic Optimal Control
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants
- Quadratic Convex Reformulations for Semicontinuous Quadratic Programming
- An efficient algorithm for image segmentation, Markov random fields and related problems
