Related papers: Polynomial hulls and an optimization problem

We say that a subset of C^n is hypoconvex if its complement is the union of complex hyperplanes. Let D be the closed unit disk in C, T the unit circle. We prove two conjectures of Helton and Marshall. (See ``Frequency domain design and…

The paper is concerned with the boundary behaviour of polynomially and rationally convex hulls in pseudoconvex domains in $\mathbb{C}^n$. As an application, it is shown that every connected polynomially or rationally convex compact set with…

We consider the convex quadratic optimization problem with indicator variables and arbitrary constraints on the indicators. We show that a convex hull description of the associated mixed-integer set in an extended space with a quadratic…

In this paper, we study the mixed-integer nonlinear set given by a separable quadratic constraint on continuous variables, where each continuous variable is controlled by an additional indicator. This set occurs pervasively in optimization…

We prove that if a compact set E in complex Euclidean space is contained in an arc J, then there is a choice of J whose polynomial hull is the union of J and the polynomial hull of E. This strengthens an earlier result of the author. We…

Binary polynomial optimization is equivalent to the problem of minimizing a linear function over the intersection of the multilinear set with a polyhedron. Many families of valid inequalities for the multilinear set are available in the…

This paper presents a new algorithm for the convex hull problem, which is based on a reduction to a combinatorial decision problem POLYTOPE-COMPLETENESS-COMBINATORIAL, which in turn can be solved by a simplicial homology computation. Like…

With the goal of obtaining strong relaxations for binary polynomial optimization problems, we introduce the pseudo-Boolean polytope defined as the convex hull of the set of binary points satisfying a collection of equations containing…

We prove that every polynomially convex arc is contained in a polynomially convex simple closed curve. We also establish results about polynomial hulls of arcs and curves that are locally rectifiable outside a polynomially convex subset.

Let V be a semialgebraic set parameterized by quadratic polynomials over a quadratic set T. This paper studies semidefinite representation of its convex hull by projections of spectrahedra (defined by linear matrix inequalities). When T is…

Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…

We study properties of convex hulls of (co)adjoint orbits of compact groups, with applications to invariant theory and tensor product decompositions. The notion of partial convex hulls is introduced and applied to define two numerical…

We describe an algorithm for computing the convex hull of a finite collection of points in the affine building of SL_d(K), for K a field with discrete valuation. These convex hulls describe the relations among a finite collection of…

It is shown that there exist arcs and simple closed curves in ${\mathbb C}^3$ with nontrivial polynomial hulls that contain no analytic discs. It is also shown that in any bounded Runge domain of holomorphy in ${\mathbb C}^N$ ($N \geq 2$)…

Several results concerning pairs of polynomially convex sets whose union is not even rationally convex are given. It is shown that there is no restriction on how two spaces can be embedded in some $\C^N$ so as to be polynomially convex but…

In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general case, since any subset sum problem can be solved upon…

Let $P$ be a crossing-free polygon and $\mathcal C$ a set of shortcuts, where each shortcut is a directed straight-line segment connecting two vertices of $P$. A shortcut hull of $P$ is another crossing-free polygon that encloses $P$ and…

We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves some…