Related papers: Separation of Convex Sets via Barrier Cones

In this paper, we propose a new deep neural network classifier that simultaneously maximizes the inter-class separation and minimizes the intra-class variation by using the polyhedral conic classification function. The proposed method has…

In this paper we study different aspects of the representation of weak*-compact convex sets of the bidual $X^{**}$ of a separable Banach space $X$ via a nested sequence of closed convex bounded sets of $X$.

It is shown that a separated sequence of points in the unit disc of the complex plane is in fact uniformly separated, if there exists a certain intermediate sequence whose separated subsequences are uniformly separated. This property is…

We introduce the property of countable separation for a locally convex Hausdorff space $X$ and relate it to the existence of a metrizable coarser topology. Building on this, we demonstrate how the separability of $X$ is equivalent to the…

In this paper we study a class of convex sets which are called closed pseudo-cones and study a new duality of this class. It turns out that the duality characterizes closed pseudo-cones and is essentially the only possible abstract duality…

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…

The present work concerns generalized convex sets in the real multi-dimensional Euclidean space, known as weakly $1$-convex and weakly $1$-semiconvex sets. An open set is called weakly $1$-convex (weakly $1$-semiconvex) if, through every…

Polyhedral convex set optimization problems are the simplest optimization problems with set-valued objective function. Their role in set optimization is comparable to the role of linear programs in scalar optimization. Vector linear…

In the setting of step two Carnot groups, we show a "cone property" for horizontally convex sets. Namely we prove that, given a horizontally convex set $C$, a pair of points $P\in \partial C$ and $Q\in $ int $C$, both belonging to a…

This paper establishes several new facts on generalized polyhedral convex sets and shows how they can be used in vector optimization. Among other things, a scalarization formula for the efficient solution sets of generalized vector…

We investigate how to glue hyperconvex (or injective) metric spaces such that the resulting space remains hyperconvex. We give two new criteria, saying that on the one hand gluing along strongly convex subsets and on the other hand gluing…

A closure system with the anti-exchange axiom is called a convex geometry. One geometry is called a sub-geometry of the other if its closed sets form a sublattice in the lattice of closed sets of the other. We prove that convex geometries…

In this paper we analyze theoretical properties of bi-objective convex-quadratic problems. We give a complete description of their Pareto set and prove the convexity of their Pareto front. We show that the Pareto set is a line segment when…

In this paper some concepts of convex analysis on hyperbolic space are studied. We first study properties of the intrinsic distance, for instance, we present the spectral decomposition of its Hessian. Next, we study the concept of convex…

Functions with uniform sublevel sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used in multicriteria optimization, decision theory, mathematical…

We consider the nonconvex set $\mathcal S_n = \{(x,X,z): X = x x^T, \; x (1-z) =0,\; x \geq 0,\; z \in \{0,1\}^n\}$, which is closely related to the feasible region of several difficult nonconvex optimization problems such as the best…

A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…

A separable space is strongly sequentially separable if, for each countable dense set, every point in the space is a limit of a sequence from the dense set. We consider this and related properties, for the spaces of continous and Borel…

Solving linear programs is often a challenging task in distributed settings. While there are good algorithms for solving packing and covering linear programs in a distributed manner (Kuhn et al.~2006), this is essentially the only class of…

We prove that a well-distributed subset of R^2 can have a separated distance set only if the distance is induced by a polygon.