Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs
From MaRDI portal
Publication:5148407
DOI10.1137/19M1271762zbMath1458.90486arXiv2010.04822MaRDI QIDQ5148407
Arvind U. Raghunathan, Carlos J. Nohra, Nikolaos V. Sahinidis
Publication date: 4 February 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.04822
global optimization; branching strategies; convex quadratic relaxations; mixed-integer quadratic programs
90C11: Mixed integer programming
90C26: Nonconvex programming, global optimization
90C20: Quadratic programming
Related Items
SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs, A computational study on QP problems with general linear constraints, New bounds for nonconvex quadratically constrained quadratic programming, Improved convex and concave relaxations of composite bilinear forms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- A survey for the quadratic assignment problem
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Global minimization of indefinite quadratic problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A quadratic assignment formulation of the molecular conformation problem
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- A hybrid LP/NLP paradigm for global optimization relaxations
- Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Branching rules revisited
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- BARON: A general purpose global optimization software package
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- Global optimization of nonconvex problems with multilinear intermediates
- Partial Lagrangian relaxation for general quadratic programming
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- LAPACK Users' Guide
- 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
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Global optimization of general non-convex problems with intermediate bilinear substructures
