相关论文: Polyhedral results for two classes of submodular s…

Computing mixed volume of convex polytopes is an important problem in computational algebraic geometry. This paper establishes sufficient conditions under which the mixed volume of several convex polytopes exactly equals the normalized…

The $\texttt{IntegerHull}$ function is part of Maple's $\texttt{PolyhedralSets}$ library, which calculates the integer hull of a given polyhedral set. This algorithm works by translating the supporting hyperplanes of the facets of the input…

In this article, we survey the primary research on polyhedral computing methods for constrained linear control systems. Our focus is on the modeling power of convex optimization, featured to design set-based robust and optimal controllers.…

Many results in mass partitions are proved by lifting $\mathbb{R}^d$ to a higher-dimensional space and dividing the higher-dimensional space into pieces. We extend such methods to use lifting arguments to polyhedral surfaces. Among other…

We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…

Implicitly described domains are a well established tool in the simulation of time dependent problems, e.g. using level-set methods. In order to solve partial differential equations on such domains, a range of numerical methods was…

We study combinatorial inequalities for various classes of set systems: matroids, polymatroids, poset antimatroids, and interval greedoids. We prove log-concavity inequalities for counting certain weighted feasible words, which generalize…

We investigate two new optimization problems -- minimizing a submodular function subject to a submodular lower bound constraint (submodular cover) and maximizing a submodular function subject to a submodular upper bound constraint…

In this paper, we mainly study subtransversality and two types of strong CHIP (given via Fr\'echet and limiting normal cones) for a collection of finitely many closed sets. We first prove characterizations of Asplund spaces in terms of…

We study the convex hull property for systems of partial differential equations. This is a generalisation of the maximum principle for a single equation. We show that the convex hull property holds for a class of elliptic and parabolic…

We propose an enhancement to Benders decomposition (BD) that generates valid inequalities for the convex hull of the Benders reformulation, addressing the limitation that classical BD cuts are typically tight only for the continuous…

The dual space of the C*-algebra of bounded uniformly continuous functions on a uniform space carries several natural topologies. One of these is the topology of uniform convergence on bounded uniformly equicontinuous sets, or the UEB…

Quadratically constrained quadratic programs (QCQPs) are a fundamental class of optimization problems well-known to be NP-hard in general. In this paper we study sufficient conditions for a convex hull result that immediately implies that…

We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…

We consider the problem of maximizing submodular functions; while this problem is known to be NP-hard, several numerically efficient local search techniques with approximation guarantees are available. In this paper, we propose a novel…

We consider two well-known problems: upper bounding the volume of lower dimensional ellipsoids contained in convex bodies given their John ellipsoid, and lower bounding the volume of ellipsoids containing projections of convex bodies given…

The Bernstein polynomial basis sees significant use owing to its unique properties, particularly in the field of optimal control. However, the basis is known to have a slow rate of convergence to the function it approximates. With this in…

We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…

We consider an extension of the set covering problem (SCP) introducing (i)~multicover and (ii)~generalized upper bound (GUB)~constraints. For the conventional SCP, the pricing method has been introduced to reduce the size of instances, and…

Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…