Related papers: Unique lifting of integer variables in minimal ine…
We investigate a mixed 0-1 conic quadratic optimization problem with indicator variables arising in mean-risk optimization. The indicator variables are often used to model non-convexities such as fixed charges or cardinality constraints.…
We introduce characteristic functions for certain contractive liftings of row contractions. These are multi-analytic operators which classify the liftings up to unitary equivalence and provide a kind of functional model. The most important…
We study a mixed integer linear program with m integer variables and k non-negative continuous variables in the form of the relaxation of the corner polyhedron that was introduced by Andersen, Louveaux, Weismantel and Wolsey [Inequalities…
This paper presents an efficient approach for the evaluation of multi-parametric mixed integer quadratic programming (mp-MIQP) solutions, occurring for instance in control problems involving discrete time hybrid systems with quadratic cost.…
We present novel mixed-integer programming (MIP) formulations for optimization over nonconvex piecewise linear functions. We exploit recent advances in the systematic construction of MIP formulations to derive new formulations for…
Our study is motivated by the solution of Mixed-Integer Non-Linear Programming (MINLP) problems with separable non-convex functions via the Sequential Convex MINLP technique, an iterative method whose main characteristic is that of solving,…
In this paper, we study the polyhedral structure of an integrated minimum-up/-down time and ramping polytope, which has broad applications in variant industries. The polytope we studied includes minimum-up/-down time, generation…
In this article we study commutant lifting, more generally intertwining lifting, for different reproducing kernel Hilbert spaces over two domains in $\mathbb{C}^n$, namely the unit ball and the unit polydisc. The reproducing kernel Hilbert…
We study disjunctive conic sets involving a general regular (closed, convex, full dimensional, and pointed) cone K such as the nonnegative orthant, the Lorentz cone or the positive semidefinite cone. In a unified framework, we introduce…
Cutting planes are frequently used for solving integer programs. A common strategy is to derive cutting planes from building blocks or a substructure of the integer program. In this paper, we focus on knapsack constraints that arise from…
We'll measure the differences of the dual variables and the gain of the objective function when creating new problems, which each has one inequality more than the starting LP-instance. These differences of the dual variables are naturally…
A Bell inequality defined for a specific experimental configuration can always be extended to a situation involving more observers, measurement settings or measurement outcomes. In this article, such "liftings" of Bell inequalities are…
The Calder\'on problem consists in recovering an unknown coefficient of a partial differential equation from boundary measurements of its solution. These measurements give rise to a highly nonlinear forward operator. As a consequence, the…
This work introduces liftings and their associated Young measures as new tools to study the asymptotic behaviour of sequences of pairs $(u_j,Du_j)j$ for $(u_j)_j \in \mathrm{BV}(\Omega;\mathbb{R}^m)$ under weak* convergence. These tools are…
In this paper we discuss lifting laws which, roughly, are ways of "lifting" elements of the open orbit of one prehomogeneous vector space to elements of the minimal nonzero orbit of another prehomogeneous vector space. We prove a handful of…
Stability analysis of discrete-time switched systems under minimum dwell-time is studied using a new type of LMI conditions. These conditions are convex in the matrices of the system and shown to be equivalent to the nonconvex conditions…
Symmetry is the essential element of lifted inference that has recently demon- strated the possibility to perform very efficient inference in highly-connected, but symmetric probabilistic models models. This raises the question, whether…
In studies of smooth maps with good differential topological conditions such as immersions, embeddings, Morse functions and their higher dimensional versions including fold maps and application to geometry, especially algebraic and…
MINLO (mixed-integer nonlinear optimization) formulations of the disjunction between the origin and a polytope via a binary indicator variable have broad applicability in nonlinear combinatorial optimization, for modeling a fixed cost $c$…
Motivated by recent advances in solution methods for mixed-integer convex optimization (MICP), we study the fundamental and open question of which sets can be represented exactly as feasible regions of MICP problems. We establish several…