Related papers: Lower bounds for cube-ideal set-systems

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.…

Let I=(x^{v_1},...,x^{v_q} be a square-free monomial ideal of a polynomial ring K[x_1,...,x_n] over an arbitrary field K and let A be the incidence matrix with column vectors {v_1},...,{v_q}. We will establish some connections between…

In applications throughout science and engineering one is often faced with the challenge of solving an ill-posed inverse problem, where the number of available measurements is smaller than the dimension of the model to be estimated. However…

We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and…

In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…

We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…

This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…

Topological mapping of a large physical system on a graph, and its decomposition using universal measures is proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by…

The theory of intrinsic volumes of convex cones has recently found striking applications in areas such as convex optimization and compressive sensing. This article provides a self-contained account of the combinatorial theory of intrinsic…

Let C be a clutter and let A be its incidence matrix. If the linear system x>=0;xA<=1 has the integer rounding property, we give a description of the canonical module and the a-invariant of certain normal subrings associated to C. If the…

We study the minimization of a rank-one quadratic with indicators and show that the underlying set function obtained by projecting out the continuous variables is supermodular. Although supermodular minimization is, in general, difficult,…

Chv\'{a}tal and Klincsek (1980) gave an $O(n^3)$-time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set $P$ of $n$ points in the plane. This paper examines a generalization of the problem,…

Let $C$ be a proper convex cone generated by a compact set which supports a measure $\mu$. A construction due to A.Barvinok, E.Veomett and J.B. Lasserre produces, using $\mu$, a sequence $(P_k)_{k\in \mathbb{N}}$ of nested spectrahedral…

The MaxCut SDP is one of the most well-known semidefinite programs, and it has many favorable properties. One of its nicest geometric/duality properties is the fact that the vertices of its feasible region correspond exactly to the cuts of…

In this thesis we are interested in studying algebraic properties of monomial algebras, that can be linked to combinatorial structures, such as graphs and clutters, and to optimization problems. A goal here is to establish bridges between…

The cut polytope ${\rm CUT}(n)$ is the convex hull of the cut vectors in a complete graph with vertex set $\{1,\ldots,n\}$. It is well known in the area of combinatorial optimization and recently has also been studied in a direct relation…

We study the complexity of the Hitting Set problem in set systems (hypergraphs) that avoid certain sub-structures. In particular, we characterize the classical and parameterized complexity of the problem when the Vapnik-Chervonenkis…

In this paper, we develop a unified framework for studying constrained robust optimal control problems with adjustable uncertainty sets. In contrast to standard constrained robust optimal control problems with known uncertainty sets, we…

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…

We consider the complex cut polytope: the convex hull of Hermitian rank 1 matrices $xx^{\mathrm{H}}$, where the elements of $x \in \mathbb{C}^n$ are $m$th unit roots. These polytopes have applications in ${\text{MAX-3-CUT}}$, digital…