相关论文: Lifts of convex sets and cone factorizations

In this paper we generalize the factorization theorem of Gouveia, Parrilo and Thomas to a broader class of convex sets. Given a general convex set, we define a slack operator associated to the set and its polar according to whether the…

Yannakakis' theorem relating the extension complexity of a polytope to the size of a nonnegative factorization of its slack matrix is a seminal result in the study of lifts of convex sets. Inspired by this result and the importance of lifts…

This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many convex sets have lifts that are…

In this paper we show how to construct inner and outer convex approximations of a polytope from an approximate cone factorization of its slack matrix. This provides a robust generalization of the famous result of Yannakakis that polyhedral…

Efficient representations of convex sets are of crucial importance for many algorithms that work with them. It is well-known that sometimes, a complicated convex set can be expressed as the projection of a much simpler set in higher…

Factorizations over cones and their duals play central roles for many areas of mathematics and computer science. One of the reasons behind this is the ability to find a representation for various objects using a well-structured family of…

A convex optimization problem in conic form involves minimizing a linear functional over the intersection of a convex cone and an affine subspace. In some cases, it is possible to replace a conic formulation using a certain cone, with a…

In the paper we consider convex cones in infinite-dimensional real vector spaces which are endowed with no topology. The main purpose is to study an internal geometric structure of convex cones and to obtain an analytical description of…

We develop tractable convex relaxations for rank-constrained quadratic optimization problems over $n \times m$ matrices, a setting for which tractable relaxations are typically only available when the objective or constraints admit spectral…

Tree convex sets refer to a collection of sets such that each set in the collection is a subtree of a tree whose nodes are the elements of these sets. They extend the concept of row convex sets each of which is an interval over a total…

We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…

We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…

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…

Symmetry is the essential element of lifted inference that has recently demon- strated the possibility to perform very efficient inference in highly-connected, but symmetric probabilistic models models. This raises the question, whether…

Convex sets appear in various mathematical theories, and are used to define notions such as convex functions and hulls. As an abstraction from the usual definition of convex sets in vector spaces, we formalize in Coq an intrinsic…

Factorization structures occur in toric differential and discrete geometry, and can be viewed in multiple ways, e.g., as objects determining substantial classes of explicit toric Sasaki and K\"ahler geometries, as special coordinates on…

Convex geometry has recently attracted great attention as a framework to formulate general probabilistic theories. In this framework, convex sets and affine maps represent the state spaces of physical systems and the possible dynamics,…

We consider the factorization of a rectangular matrix $X $ into a positive linear combination of rank-one factors of the form $u v^\top$, where $u$ and $v$ belongs to certain sets $\mathcal{U}$ and $\mathcal{V}$, that may encode specific…

The goal of this paper is to derive new classes of valid convex inequalities for quadratically constrained quadratic programs (QCQPs) through the technique of lifting. Our first main result shows that, for sets described by one bipartite…

Let X and Y be finite dimensional normed spaces, F(X,Y) a collection of all mappings from X into Y. A mapping $P\in F(X,Y)$ is said to be piecewise affine if there exists a finite family of convex polyhedral subsets covering X and such that…