Semidefinite relaxations for non-convex quadratic mixed-integer programming
From MaRDI portal
Publication:378112
DOI10.1007/s10107-012-0534-yzbMath1280.90091OpenAlexW2082874874MaRDI QIDQ378112
Christoph Buchheim, Angelika Wiegele
Publication date: 11 November 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0534-y
Semidefinite programming (90C22) Integer programming (90C10) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
Linear transformation based solution methods for non-convex mixed integer quadratic programs, Dantzig-Wolfe reformulations for binary quadratic problems, Transformation-based preprocessing for mixed-integer quadratic programs, Exact quadratic convex reformulations of mixed-integer quadratically constrained problems, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, Conic approximation to quadratic optimization with linear complementarity constraints, On globally solving the extended trust-region subproblems, \texttt{EXPEDIS}: an exact penalty method over discrete sets, SDP-based branch-and-bound for non-convex quadratic integer optimization, Ellipsoid Bounds for Convex Quadratic Integer Programming, Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs, Valid inequalities for quadratic optimisation with domain constraints, Optimal portfolio deleveraging under market impact and margin restrictions, A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, A semidefinite programming method for integer convex quadratic minimization, A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs, Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization, A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation, A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations, DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs, QPLIB: a library of quadratic programming instances, Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations, A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs, Decision Diagram Decomposition for Quadratically Constrained Binary Optimization, On the separation of split inequalities for non-convex quadratic integer programming, SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
Uses Software
Cites Work
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Optimization of a quadratic function with a circulant matrix
- An algorithmic framework for convex mixed integer nonlinear programs
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Portfolio optimization with an envelope-based multi-objective evolutionary algorithm
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A branch-and-reduce approach to global optimization
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- CSDP, A C library for semidefinite programming
- Semidefinite Programming
