Unbounded convex sets for non-convex mixed-integer quadratic programming
This article considers the non-convex mixed-integer quadratic programming problem which is converted into a problem with a linear objective function but non-linear constraints, with the view of deriving several classes of facet-defining inequalities. The article begins with a brief introduction to quadratic programming and the necessary background theorems and notation. This is followed by the definition of the convex sets and their properties, such as dimension, complexity and symmetries. Classes of new valid inequalities are then described and proven, firstly for the easier case where all variables are continuous, secondly for the case of all-integer variables and finally the general mixed-integer case. Several properties of the convex sets associated with unconstrained, non-convex, mixed-integer quadratic problems are outlined and proven in this very interesting paper, giving rise to new cutting planes which can be used to enhance algorithms for the exact solution of quadratic programs.
- Integer quadratic quasi-polyhedra
- On nonconvex quadratic programming with box constraints
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- Mixed-integer convex representability
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A semidefinite programming approach to the quadratic knapsack problem
- A study of the quadratic semi-assignment polytope
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Box-inequalities for quadratic assignment polytopes
- Chvátal closures for mixed integer programming problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computable representations for convex hulls of low-dimensional quadratic forms
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
- Gap inequalities for non-convex mixed-integer quadratic programs
- Geometry of cuts and metrics
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 4155333 (Why is no real title available?)
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- scientific article; zbMATH DE number 4119933 (Why is no real title available?)
- scientific article; zbMATH DE number 3326540 (Why is no real title available?)
- scientific article; zbMATH DE number 3401090 (Why is no real title available?)
- Integer optimization on convex semialgebraic sets
- Integer quadratic quasi-polyhedra
- Minimal requirements for Minkowski's theorem in the plane I
- On Cones of Nonnegative Quadratic Functions
- On nonconvex quadratic programming with box constraints
- On the computational complexity of membership problems for the completely positive cone and its dual
- On the cone of positive semidefinite matrices
- On the Matrix Equation X′X = A
- Polyhedra related to integer-convex polynomial systems
- Review of nonlinear mixed-integer and disjunctive programming techniques
- SDP relaxations in combinatorial optimization from a Lagrangian viewpoint.
- Semidefinite programming relaxation for nonconvex quadratic programs
- Some NP-complete problems in quadratic and nonlinear programming
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Quadratic programs with hollows
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
- Robust combinatorial optimization with variable budgeted uncertainty
- Valid inequalities for quadratic optimisation with domain constraints
- On the separation of split inequalities for non-convex quadratic integer programming
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- Closedness of integer hulls of simple conic sets
- Integer quadratic quasi-polyhedra
- Irreducible infeasible sets in convex mixed-integer programs
- Model development and optimization for space engineering: concepts, tools, applications, and perspectives
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Convex hull results on quadratic programs with non-intersecting constraints
This page was built for publication: Unbounded convex sets for non-convex mixed-integer quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2436643)
