Ellipsoidal mixed-integer representability

@article{Pia2018EllipsoidalMR,
  title={Ellipsoidal mixed-integer representability},
  author={Alberto Del Pia and Jeffrey Poskin},
  journal={Mathematical Programming},
  year={2018},
  volume={172},
  pages={351-369}
}
Representability results for mixed-integer linear systems play a fundamental role in optimization since they give geometric characterizations of the feasible sets that can be formulated by mixed-integer linear programming. We consider a natural extension of mixed-integer linear systems obtained by adding just one ellipsoidal inequality. The set of points that can be described, possibly using additional variables, by these systems are called ellipsoidal mixed-integer representable. In this work… 
Characterizations of mixed binary convex quadratic representable sets
TLDR
The sets that appear in the feasibility version of mixed binary convex quadratic optimization problems are studied to provide a complete characterization of the sets that can be obtained as the projection of such feasible regions.
Mixed-Integer Convex Representability
TLDR
In correspondence with the seminal work on mixed-integer linear representability by Jeroslow and Lowe, it is established that representable sets obey strong regularity properties such as periodicity, and a complete characterization of representable subsets of the natural numbers and of representsable compact sets is provided.
Mixed-integer bilevel representability
TLDR
It is proved that the family of sets that are finite unions of mixed-integer representable sets (up to topological closures) forms an algebra of sets; i.e., this family is closed under finite unions, intersections and complementation.
Regularity in mixed-integer convex representability
Characterizations of the sets with mixed integer programming (MIP) formulations using only rational linear inequalities (rational MILP representable) and those with formulations that use arbitrary
Mixed-integer convex optimization : outer approximation algorithms and modeling power
TLDR
The first finite-time outer approximation methods for problems in general mixed-integer conic form are developed and implemented and implement them in an open-source solver, Pajarito, obtaining competitive performance with the state of the art.
Centerpoints: A Link between Optimization and Convex Geometry
TLDR
An oracle-based algorithm for convex mixed-integer optimization based on centerpoints is developed and it is shown that algorithms based oncenterpoints are "best possible" in a certain sense.

References

SHOWING 1-10 OF 17 REFERENCES
On the Mixed Binary Representability of Ellipsoidal Regions
TLDR
This work considers a natural extension of mixed-integer linear systems obtained by adding just one ellipsoidal inequality, and gives geometric conditions that characterize ellip soidal mixed binary representable sets.
Integer and mixed-integer programming models: General properties
It is well known that mixed-integer formulations can be used tomodel important classes of nonconvex functions, such as fixed-charge functions and linear economy-of-scale cost functions. The purpose
Representability in mixed integer programmiing, I: Characterization results
Representations of unbounded optimization problems as integer programs
AbstractAny optimization problem in a finite structure can be represented as an integer or mixed-integer program in integral quantities.We show that, when an optimization problem on an unbounded
Rational Mixed-Integer and Polyhedral Union Minimization Models
The minimization model concept is defined, and its applications to nonlinear optimization are described. Necessary conditions and sufficient conditions are established for functions to have
Modelling with Integer Variables.
We give several results which characterize MIP-representability of sets and functions, and the finite union of MIP-representable sets. These results extend earlier ones due to R.R. Meyer. We provide
Mixed integer minimization models for piecewise-linear functions of a single variable
Mixed-integer quadratic programming is in NP
TLDR
It is proved that the decision version of mixed-integer quadratic programming is in NP, thereby showing that it is NP-complete.
Integer programming formulation of combinatorial optimization problems
Mixed Integer Linear Programming Formulation Techniques
TLDR
This survey reviews advanced MIP formulation techniques that result in stronger and/or smaller formulations for a wide class of problems.
...
...