Semidefinite relaxations for non-convex quadratic mixed-integer programming
From MaRDI portal
Recommendations
- Semidefinite programming relaxation for nonconvex quadratic programs
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Semidefinite relaxations for mixed 0-1 second-order cone program
- scientific article; zbMATH DE number 1380758
Cites work
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A branch-and-reduce approach to global optimization
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- An algorithmic framework for convex mixed integer nonlinear programs
- An effective branch-and-bound algorithm for convex quadratic integer programming
- CSDP, A C library for semidefinite programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Linear programming relaxations of quadratically constrained quadratic programs
- Optimization of a quadratic function with a circulant matrix
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Portfolio optimization with an envelope-based multi-objective evolutionary algorithm
- Semidefinite Programming
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
Cited in
(50)- Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- A framework for solving mixed-integer semidefinite programs
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- scientific article; zbMATH DE number 1664574 (Why is no real title available?)
- QPLIB: a library of quadratic programming instances
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- An efficient splitting algorithm for solving the CDT subproblem
- Valid inequalities for quadratic optimisation with domain constraints
- A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
- Conic approximation to quadratic optimization with linear complementarity constraints
- Transformation-based preprocessing for mixed-integer quadratic programs
- Convex relaxations for mixed-integer nonlinear programs
- Dantzig-Wolfe reformulations for binary quadratic problems
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- A semidefinite programming method for integer convex quadratic minimization
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
- Ellipsoid bounds for convex quadratic integer programming
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs
- Convex relaxations for mixed integer predictive control
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Tight SDP relaxations for cardinality-constrained problems
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Linear transformation based solution methods for non-convex mixed integer quadratic programs
- Impact of domain reduction techniques in polynomial optimization: a computational study
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Semidefinite relaxations for mixed 0-1 second-order cone program
- scientific article; zbMATH DE number 3900505 (Why is no real title available?)
- \texttt{EXPEDIS}: an exact penalty method over discrete sets
- On the separation of split inequalities for non-convex quadratic integer programming
- Compact mixed-integer programming formulations in quadratic optimization
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Semidefinite programming relaxation for nonconvex quadratic programs
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints
- On globally solving the extended trust-region subproblems
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- SDP-based branch-and-bound for non-convex quadratic integer optimization
- Optimal portfolio deleveraging under market impact and margin restrictions
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Nonconvex quadratic programming, semidefinite relaxations and randomization algorithms in information and decision systems
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
This page was built for publication: Semidefinite relaxations for non-convex quadratic mixed-integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378112)
