Related papers: Convex Hull Formulations for Mixed-Integer Multili…
Linear programming (LP) relaxations are widely employed in exact solution methods for multilinear programs (MLP). One example is the family of Recursive McCormick Linearization (RML) strategies, where bilinear products are substituted for…
The aim of the paper is to develop a unified algebraical approach to representing the Minkowski difference for convex polyhedra. Namely, there is proposed an exact analytical formulas of the Minkowski difference for convex polyhedra with…
We consider a class of infinite-dimensional optimization problems in which a distributed vector-valued variable should pointwise almost everywhere take values from a given finite set $\mathcal{M}\subset\mathbb{R}^m$. Such hybrid…
We propose in this paper a proximal and contraction method for solving a convex mixed variational inequality problem in a real Hilbert space. To accelerate the convergence of our proposed method, we incorporate an inertial extrapolation…
Bringing together nonlinear optimization with polyhedral and integrality constraints enables versatile modeling, but poses significant computational challenges. We investigate a method to address these problems based on sequential…
We propose the formulation of convex Generalized Disjunctive Programming (GDP) problems using conic inequalities leading to conic GDP problems. We then show the reformulation of conic GDPs into Mixed-Integer Conic Programming (MICP)…
A tight continuous relaxation is a crucial factor in solving mixed integer formulations of many NP-hard combinatorial optimization problems. The (weighted) max $k$-cut problem is a fundamental combinatorial optimization problem with…
For Kichhoff-Love shell problems a new mixed formulation solely based on standard $H^1$ spaces is presented. This allows for flexibility in the construction of discretization spaces, e.g., standard $C^0$-coupling of multi-patch isogeometric…
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…
We study the mixed-integer quadratic programming formulation of an $n$-period hybrid control problem with a convex quadratic cost function and linear dynamics. We first give the convex hull description of the single-period, two-mode problem…
Mixed-Integer Linear Programming (MILP) is a foundational tool for complex decision-making problems. However, the NP-hard nature of MILP presents a significant computational challenge, motivating the development of machine learning-based…
We describe a magnetohydrodynamic (MHD) constrained energy functional for equilibrium calculations that combines the topological constraints of ideal MHD with elements of Taylor relaxation. Extremizing states allow for partially chaotic…
We consider the multilinear polytope defined as the convex hull of the set of binary points satisfying a collection of multilinear equations. The complexity of the facial structure of the multilinear polytope is closely related to the…
We investigate functionals defined on manifolds through parameterizations. If they are to be meaningful, from a geometrical viewpoint, they ought to be invariant under reparameterizations. Standard, local, integral functionals with this…
In this contribution we introduce a mixed interpolation-regression operator for functions defined in some domains of the plane. We focus the attention on the ellipse, an annulus and a polygon. An upper bound for such an operator is…
We investigate mixed-integer second-order conic (SOC) sets with a nonlinear right-hand side in the SOC constraint, a structure frequently arising in mixed-integer quadratically constrained programming (MIQCP). Under mild assumptions, we…
Kubota's integral formula expresses the intrinsic volumes of a convex body as averages over its projections onto linear subspaces. In this work, we introduce a new class of Kubota-type formulas for mixed area measures adapted to rotations…
We study the relaxation of multiple integrals of the calculus of variations, where the integrands are nonconvex with convex effective domain and can take the value \infty. We use local techniques based on measure arguments to prove integral…
We provide theory for computing the lower semi-continuous convex envelope of functionals of the type f(x) plus an l2 misfit, and discuss applications to various non-convex optimization problems. The latter term is a data fit term whereas f…
We investigate the (linearized) Morse index of solutions to Hamiltonan systems, with a focus on convex Hamiltonians functions and sign-changing radial solutions. For strongly coupled systems, we describe the profile of the radial solutions…