Related papers: Bregman distances and Chebyshev sets
A generalization of the Lebesgue number lemma is obtained. It is proved that, if each countably infinite locally finite open cover of a chainable metric space $X$ has a Lebesgue number, then $X$ is totally bounded. A property of metric…
Extending results of Suss and Hadwiger (proved by them for the case of convex bodies and positive ratios), we show that compact (respectively, closed) convex sets in the Euclidean space of dimension n are homothetic provided for any given…
We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise…
In this paper, we study the problem of finding the Euclidean distance to a convex cone generated by a set of discrete points in $\mathbb{R}^n_+$. In particular, we are interested in problems where the discrete points are the set of feasible…
We say that a metric space $(X,d)$ possesses the \emph{Banach Fixed Point Property (BFPP)} if every contraction $f:X\to X$ has a fixed point. The Banach Fixed Point Theorem says that every complete metric space has the BFPP. However, E.…
Let $X$ be a finite-dimensional normed space and let $Y \subseteq X$ be its proper linear subspace. The set of all minimal projections from $X$ to $Y$ is a convex subset of the space all linear operators from $X$ to $X$ and we can consider…
A well-known result says that the Euclidean unit ball is the unique fixed point of the polarity operator. This result implies that if, in $\mathbb{R}^n$, the unit ball of some norm is equal to the unit ball of the dual norm, then the norm…
Contraction theory for dynamical systems on Euclidean spaces is well-established. For contractive (resp. semi-contractive) systems, the distance (resp. semi-distance) between any two trajectories decreases exponentially fast. For partially…
Brehm's extension theorem states that a non-expansive map on a finite subset of a Euclidean space can be extended to a piecewise-linear map on the entire space. In this note, it is verified that the proof of the theorem is constructive…
We prove a series of results on the size of distance sets corresponding to sets in the Euclidean space. These distances are generated by bounded convex sets and the results depend explicitly on the geometry of these sets. We also use a…
We prove that a closed convex subset $C$ of a real Hilbert space $X$ has the fixed point property for $(c)$-mappings if and only if $C$ is bounded. Some convergence results about the iterations are obtained.
Let $S\subset \mathbb{R}^d$ $(d\geq 2)$. A set $S$ is said to be $m$-point convex, if for every $m$ distinct points in $S$, at least one of the line-segments determined by them lies in $S$. We also say that $S$ has property $P_m$. Let…
A metric space $\mathrm{M}=(M;\de)$ is {\em homogeneous} if for every isometry $f$ of a finite subspace of $\mathrm{M}$ to a subspace of $\mathrm{M}$ there exists an isometry of $\mathrm{M}$ onto $\mathrm{M}$ extending $f$. A metric space…
An open convex set in real projective space is called divisible if there exists a discrete group of projective automorphisms which acts co-compactly. There are many examples of such sets and a theorem of Benoist implies that many of these…
We consider the problem of minimizing the sum of two convex functions: one is differentiable and relatively smooth with respect to a reference convex function, and the other can be nondifferentiable but simple to optimize. We investigate a…
The constrained minimization (respectively maximization) of directed distances and of related generalized entropies is a fundamental task in information theory as well as in the adjacent fields of statistics, machine learning, artificial…
An open set in C^n is pseudoconvex if and only if its intersection with every affine subspace of complex dimension two as seen as an open set in C^2 is pseudoconvex.
The 2-sets convex feasibility problem aims at finding a point in the intersection of two closed convex sets $A$ and $B$ in a normed space $X$. More generally, we can consider the problem of finding (if possible) two points in $A$ and $B$,…
A convex subset X of a linear topological space is called compactly convex if there is a continuous compact-valued map $\Phi:X\to exp(X)$ such that $[x,y]\subset\Phi(x)\cup \Phi(y)$ for all $x,y\in X$. We prove that each convex subset of…
A subset M of a normed linear space X is said to be a {\it strict sun} if, for every point $x\in X\setminus M$, the set of its nearest points from~$M$ is non-empty and if $y\in M$ is a nearest point from M to x, then y is a nearest point…