Related papers: Polynomial hulls and an optimization problem

Consider the closed convex hull $K$ of a monomial curve given parametrically as $(t^{m_1},\ldots,t^{m_n})$, with the parameter $t$ varying in an interval $I$. We show, using constructive arguments, that $K$ admits a lifted semidefinite…

We study a natural extension to the well-known convex hull problem by introducing multiplicity: if we are given a set of convex polygons, and we are allowed to partition the set into multiple components and take the convex hull of each…

We study sets defined as the intersection of a rank-1 constraint with different choices of linear side constraints. We identify different conditions on the linear side constraints, under which the convex hull of the rank-1 set is polyhedral…

It is known that the complex Grassmannian of $k$-dimensional subspaces can be identified with the set of projection matrices of rank $k$. It is also classically known that the convex hull of this set is the set of Hermitian matrices with…

We establish that for any non-empty, compact set $K\subset\mathbb{R}_{\mathrm{sym}}^{3\times 3}$ the $1$- and $\infty$-symmetric div-quasiconvex hulls $K^{(1)}$ and $K^{(\infty)}$ coincide. This settles a conjecture in a recent work of…

A programming tactic involving polyhedra is reported that has been widely applied in the polyhedral analysis of (constraint) logic programs. The method enables the computations of convex hulls that are required for polyhedral analysis to be…

This article provides an overview of our joint work on binary polynomial optimization over the past decade. We define the multilinear polytope as the convex hull of the feasible region of a linearized binary polynomial optimization problem.…

The projective hull X^ of a subset X in complex projective space P^n is an analogue of the classical polynomial hull of a set in C^n. If X is contained in an affine chart C^n on P^n, then the affine part of X^ is the set of points x in C^n…

This is a survey on tropical polytopes from the combinatorial point of view and with a focus on algorithms. Tropical convexity is interesting because it relates a number of combinatorial concepts including ordinary convexity, monomial…

Let G be a complex reductive Lie group acting on a compact K\"ahler manifold X and assume that the action of a maximal compact subgroup K of G is Hamiltonian. For each extreme point of the convex hull of the momentum map image, there is an…

This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…

It is an old question how massive polynomial hulls of Cantor sets in $\mathbb{C}^n$ can be. In contrast to expectation e.g. Rudin, Vitushkin and Henkin showed on examples that it can be rather massive. Motivated by problems of holomorphic…

Let C be a real nonsingular affine curve of genus one, embedded in affine n-space, whose set of real points is compact. For any polynomial f which is nonnegative on C(R), we prove that there exist polynomials f_i with f \equiv \sum_i f_i^2…

We study the polyhedral convex hull structure of a mixed-integer set which arises in a class of cardinality-constrained concave submodular minimization problems. This class of problems has an objective function in the form of $f(a^\top x)$,…

We treat the boundary problem for complex varieties with isolated singularities, of complex dimension greater than or equal to 3, non necessarily compact, which are contained in strongly convex, open subsets of a complex Hilbert space H. We…

In this paper, we consider the polyhedral structure of the unit commitment polytope. In particular, we provide the convex hull results for the problem under the following different settings: 1) the convex hulls for the integrated…

For a planar point set $P$, its convex hull is the smallest convex polygon that encloses all points in $P$. The construction of the convex hull from an array $I_P$ containing $P$ is a fundamental problem in computational geometry. By…

Convex hulls are useful as tight bounding proxies for a variety of tasks including collision detection, ray intersection, and distance computation. Unfortunately, the complexity of polyhedral convex hulls grows linearly with their input. We…

In this paper we present two frameworks in which global maximization of a bounded hessian function over a strongly convex set can be reduced to convex optimization. The first presented framework is a continuation of one of our previous…

In the article "Construction of the continuous hull for the combinatorics of a regular pentagonal tiling of the plane" we constructed the continuous hull for the combinatorics of "A regular pentagonal tiling of the plane", and in the…