Related papers: Formal Adventures in Convex and Conical Spaces

In Guo and Peng's article [Spherically convex sets and spherically convex functions, J. Convex Anal. 28 (2021), 103--122], one defines the notions of spherical convex sets and functions on "general curved surfaces" in $\mathbb{R}^{n}$…

In this paper, we introduce the concept of nearly convex set-valued mappings and investigate fundamental properties of these mappings. Additionally, we establish a geometric approach for generalized differentiation of nearly convex…

An orbitope is the convex hull of an orbit of a point under the action of a compact group. We derive bounds on volumes of sections of polar bodies of orbitopes, extending our previously developed methods. As an application we realize the…

We consider nonconvex real valued functions whose truncations are either quasiconvex or even convex starting with a certain level. Among them, the $C^2$-smooth functions whose level sets are all completely contained in the positive definite…

The standard convex closed hull of a set is defined as the intersection of all images, under the action of a group of rigid motions, of a half-space containing the given set. In this paper we propose a generalisation of this classical…

Convex optimization is a vibrant and successful area due to the existence of a variety of efficient algorithms that leverage the rich structure provided by convexity. Convexity of a smooth set or a function in a Euclidean space is defined…

We prove that every pointed closed convex set in $\mathbb{R}^n$ is the intersection of all the rational closed halfspaces that contain it. This generalizes a previous result by the authors for compact convex sets.

The highly influential framework of conceptual spaces provides a geometric way of representing knowledge. Instances are represented by points and concepts are represented by regions in a (potentially) high-dimensional space. Based on our…

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

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…

Normed spaces appear to have very little going for them: aside from the hackneyed linear structure, you get a norm whose only virtue, aside from separating points, is the Triangle Inequality. What could you possibly prove with that? As it…

In decision-making problems under uncertainty, probabilistic constraints are a valuable tool to express safety of decisions. They result from taking the probability measure of a given set of random inequalities depending on the decision…

In the present paper, classical tools of convex analysis are used to study the solution set to a certain class of set-inclusive generalized equations. A condition for the solution existence and global error bounds is established, in the…

We suggest a concept of generalized `angles' in arbitrary real normed vector spaces. We give for each real number a definition of an `angle' by means of the shape of the unit ball. They all yield the well known Euclidean angle in the…

We show convexity of solutions to a class of convex variational problems in the Gauss and in the Wiener space. An important tool in the proof is a representation formula for integral functionals in this infinite dimensional setting, that…

We will use different way (in this work) from the existing methods in the literature which speaking in the separation of convex sets was carried out by hyperplanes. We are examining the behavior of convex set which is the domain of convex…

For many applications, we need to use techniques to represent convex shapes and objects. In this work, we use level set method to represent shapes and find a necessary and sufficient condition on the level set function to guarantee the…

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…

The faces of a convex set owe their relevance to an interplay between convexity and topology that is systematically studied in the work of Rockafellar. Infinite-dimensional convex sets are excluded from this theory as their relative…

We study the convex-hull problem in a probabilistic setting, motivated by the need to handle data uncertainty inherent in many applications, including sensor databases, location-based services and computer vision. In our framework, the…