Related papers: Matrix Convex Sets Without Absolute Extreme Points

We present a framework to obtain valid inequalities for a reverse convex set: the set of points in a polyhedron that lie outside a given open convex set. Reverse convex sets arise in many models, including bilevel optimization and…

Let X be a compact convex set and let ext X stand for the set of extreme points of X. We show that an affine function with the point of continuity property on X satisfies the minimum principle. As a corollary we obtain a generalization of a…

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…

We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalize the correspondence of facets of a polytope to the vertices of the dual polytope to general semi-algebraic convex…

The $K$-hull of a compact set $A\subset\mathbb{R}^d$, where $K\subset \mathbb{R}^d$ is a fixed compact convex body, is the intersection of all translates of $K$ that contain $A$. A set is called $K$-strongly convex if it coincides with its…

This paper presents a novel convex optimization-based method for finding the globally optimal solutions of a class of mixed-integer non-convex optimal control problems. We consider problems with non-convex constraints that restrict the…

We study the problems of testing and learning high-dimensional discrete convex sets. The simplest high-dimensional discrete domain where convexity is a non-trivial property is the ternary hypercube, $\{-1,0,1\}^n$. The goal of this work is…

A matrix convex set is a set of the form $\mathcal{S} = \cup_{n\geq 1}\mathcal{S}_n$ (where each $\mathcal{S}_n$ is a set of $d$-tuples of $n \times n$ matrices) that is invariant under UCP maps from $M_n$ to $M_k$ and under formation of…

In this paper we theoretically show that interior-point methods based on self-concordant barriers possess favorable global complexity beyond their standard application area of convex optimization. To do that we propose first- and…

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…

Low-rank matrix completion consists of computing a matrix of minimal complexity that recovers a given set of observations as accurately as possible. Unfortunately, existing methods for matrix completion are heuristics that, while highly…

Our work explores fusions, the multidimensional counterparts of mean-preserving contractions and their extreme and exposed points. We reveal an elegant geometric/combinatorial structure for these objects. Of particular note is the…

We present a self-contained analysis of a particular family of metrics over the set of non-negative integers. We show that these metrics, which are defined through a nested sequence of optimal transport problems, provide tight estimates for…

We study the integrality gap of convex mixed-integer programs, that is, the difference between the optimal value of such a problem and the optimal value of its continuous relaxation. We study classes of convex sets whose associated…

Let \Gamma be the convex set consisting of all marginal tracial states on the tensor product B \otimes B of the algebra B of nxn matrices over the complex numbers. We find necessary and sufficient conditions for such a state to be extremal…

Convex clustering is a well-regarded clustering method, resembling the similar centroid-based approach of Lloyd's $k$-means, without requiring a predefined cluster count. It starts with each data point as its centroid and iteratively merges…

In this paper, the proximal point algorithm for quasi-convex minimization problem in nonpositive curvature metric spaces is studied. We prove $\Delta$-convergence of the generated sequence to a critical point (which is defined in the text)…

A convex geometry is a closure system satisfying the anti-exchange property. This paper, following the work of K. Adaricheva and M. Bolat (2016) and the Polymath REU 2020 team, continues to investigate representations of convex geometries…

Motivated by the well-known cases of the real Hilbert ball and complete R-trees, being both particular cases of CAT(-1) spaces, we give an affirmative answer to the question of whether the geodesically boundedness property is a necessary…

The goal of this paper is to establish certain inequalities between the numbers of convex polytopes in the d-dimensional space "containing" and "avoiding" zero provided that their vertex sets are subsets of a given finite set of points in…