Related papers: Max-plus convexity in Riesz spaces

We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…

We introduce the notion of (almost isometric) local retracts in metric space as a natural non-linear version of the concepts of locally complemented and almost isometric ideals from Banach spaces. We prove that given two metric spaces…

We propose the concepts of vicinal mappings and firmly vicinal mappings in metric spaces. We obtain fixed point and convergence theorems for these mappings in complete geodesic spaces with curvature bounded above by one and apply our…

We consider \textit{additive spaces}, consisting of two intervals of unit length or two general probability measures on ${\mathbb R}^1$, positioned on the axes in ${\mathbb R}^2$, with a natural additive measure $\rho$. We study the…

Each convex combination of extreme points of a compact convex set represents a certain point of the convex set. Barycentric coordinates provide solutions to the inverse problem of expressing an element of a compact convex set as a convex…

Given a degeneration of compact projective complex manifolds $X$ over the punctured disc, with meromorphic singularities, and a relatively ample line bundle $L$ on $X$, we study spaces of plurisubharmonic metrics on $L$, with particular…

For a convex body $K\subset\mathbb{R}^d$ the mean distance $\Delta(K)=\mathbb{E}|X_1-X_2|$ is the expected Euclidean distance of two independent and uniformly distributed random points $X_1,X_2\in K$. Optimal lower and upper bounds for…

We introduce the notion of trace convexity for functions and respectively, for subsets of a compact topological space. This notion generalizes both classical convexity of vector spaces, as well as Choquet convexity for compact metric…

We prove an existence theorem for convex hypersurfaces of prescribed Gauss curvature in the complement of a compact set in Euclidean space which are close to a cone.

In this paper we introduce the notion of an almost preserved extreme point (APEP) of a set as a weakening of the concept of preserved extreme points, and we systematically study such points. As a main result, we prove that a Banach space…

The Lipschitz extension modulus $e(M)$ of a metric space $M$ is the infimum over $L\ge 1$ such that for any Banach space $Z$ and any $C\subset M$, any 1-Lipschitz function $f:C\to Z$ can be extended to an $L$-Lipschitz function $F:M\to Z$.…

The Max-Cut polytope appears in the formulation of many difficult combinatorial optimization problems. These problems can also be formulated as optimization problems over the so-called trigonometric approximation which possesses an…

The max-plus algebra $\mathbb{R}\cup \{-\infty \}$ is defined in terms of a combination of the following two operations: addition, $a \oplus b := \max(a,b)$, and multiplication, $a \otimes b := a + b$. In this study, we propose a new method…

Given a finite set $E$ and an operator $\sigma:2^{E}\longrightarrow2^{E}$, two sets $X,Y\subseteq E$ are \textit{cospanning} if $\sigma\left( X\right) =\sigma\left( Y\right) $. Corresponding \textit{cospanning equivalence relations} were…

Let $ SM_n(\mathbb{R})^g$ denote $g$-tuples of $n \times n$ real symmetric matrices. Given tuples $X=(X_1, \dots, X_g) \in SM_{n_1}(\mathbb{R})^g$ and $Y=(Y_1, \dots, Y_g) \in SM_{n_2}(\mathbb{R})^g$, a matrix convex combination of $X$ and…

We consider an optimization problem in a convex space $E$ with an affine objective function, subject to $J$ constraints in the forms of inequalities on some other affine functions, where $J$ is a given nonnegative integer. Under suitable…

We discuss the notions of circumradius, inradius, diameter, and minimum width in generalized Minkowski spaces (that is, with respect to gauges), i.e., we measure the "size" of a given convex set in a finite-dimensional real vector space…

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

We study the space of orthogonally additive $n$-homogeneous polynomials on $C(K)$. There are two natural norms on this space. First, there is the usual supremum norm of uniform convergence on the closed unit ball. As every orthogonally…

In this paper, we generalize the concept of unbounded norm (un) convergence: let $X$ be a normed lattice and $Y$ a vector lattice such that $X$ is an order dense ideal in $Y$; we say that a net $(y_\alpha)$ un-converges to $y$ in $Y$ with…