Related papers: An interval version of separation by semispaces in…
A family of $k$ point sets in $d$ dimensions is well-separated if the convex hulls of any two disjoint subfamilies can be separated by a hyperplane. Well-separation is a strong assumption that allows us to conclude that certain kinds of…
In this paper, we generalize the chance optimization problems and introduce constrained volume optimization where enables us to obtain convex formulation for challenging problems in systems and control. We show that many different problems…
We give necessary and sufficient conditions under which a density matrix acting on a two-fold tensor product space is separable. Our conditions are given in terms of quantum conditional information transmission.
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$.
A convex envelope for the problem of finding the best approximation to a given matrix with a prescribed rank is constructed. This convex envelope allows the usage of traditional optimization techniques when additional constraints are added…
Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…
The aim of the present paper is to investigate the half-spaces in the convexity structure of all quasiorders on a given set and to use them in an alternative approach to classical order dimension. The main result states that linear orders…
In this paper we consider the problem of minimizing area subject to a volume constraint in a given convex set.
We study a specific convex maximization problem in n-dimensional space. The conjectured solution is proved to be a vertex of the polyhedral feasible region, but only a partial proof of local maximality is known. Integer sequences with…
The divergence minimization problem plays an important role in various fields. In this note, we focus on differentiable and strictly convex divergences. For some minimization problems, we show the minimizer conditions and the uniqueness of…
We consider a symmetric matrix, the entries of which depend linearly on some parameters. The domains of the parameters are compact real intervals. We investigate the problem of checking whether for each (or some) setting of the parameters,…
In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general case, since any subset sum problem can be solved upon…
We consider a Gaussian sequence model that contains ill-posed inverse problems as special cases. We assume that the associated operator is partially unknown in the sense that its singular functions are known and the corresponding singular…
In this work, we carry out structural and algorithmic studies of a problem of barrier forming: selecting theminimum number of straight line segments (barriers) that separate several sets of mutually disjoint objects in the plane. The…
In this paper we study a sufficient conditions for continuous and almost continuous extensions of f to space X for an image space Y with different separation axioms.
Segmenting an image into multiple components is a central task in computer vision. In many practical scenarios, prior knowledge about plausible components is available. Incorporating such prior knowledge into models and algorithms for image…
Let $X=\mathcal{M}(A)$ be an affinoid space and let $f,g \in A$. We study the sets of connected components of the spaces defined by an inequality of the form $|f|\le r|g|$, with $r\ge 0$. We prove that there exists a finite partition of…
Theorem 1 of [14], a minimax result for functions $f:X\times Y\to {\bf R}$, where $Y$ is a real interval, was partially extended to the case where $Y$ is a convex set in a Hausdorff topological vector space ([15], Theorem 3.2). In doing…
We study several separation axioms for $X$-top-lattices (i.e. a lattice $L$ for which a given subset $X\subseteq L\backslash \{1\}$ admits a \emph{% Zariski-like topology}). Such spaces are $T_{0}$ and usually far away from being $T_{2}.$…
A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…