Related papers: Best proximity points for proximal contractions
In this article we discuss a possibility to implement a well-known scheme of proof for contraction mapping theorems in a situation, when convergence, families of Cauchy sequences, and contractiveness of mappings are defined axiomatically.…
We present a new approach to approximate nearest-neighbor queries in fixed dimension under a variety of non-Euclidean distances. We are given a set $S$ of $n$ points in $\mathbb{R}^d$, an approximation parameter $\varepsilon > 0$, and a…
In this paper, we give an overview of some results concerning best and random approximation of convex bodies by polytopes. We explain how both are linked and see that random approximation is almost as good as best approximation.
In this present article, we get sufficient conditions for the existence and uniqueness of fixed points and common fixed points for single and double mapping satisfying various contractive conditions within the partially ordered…
It is well-known that an algorithm exists which approximates the NP-complete problem of Set Cover within a factor of ln(n), and it was recently proven that this approximation ratio is optimal unless P = NP. This optimality result is the…
We prove a fixpoint theorem for contractions on Cauchy-complete quantale-enriched categories. It holds for any quantale whose underlying lattice is continuous, and applies to contractions whose control function is sequentially…
Closely packed conformations of helices formed on the ideal rope are considered. The pitch versus radius relations which define a closely packed helix are determined. The relations stem from the turn-to-turn distance and curvature limiting…
In the literature, various types of points and meager sets whose complements are connected have been studied, such as colocally connected points, non-weak cut points/sets, non-block points/sets, shore points/sets, etc. We extend that study,…
We highlight a certain compactness of Sidon sets and $B_2[g]$-sets and provide several applications. Notably, we prove the existence of such sets that maximize certain functions. In particular, we show the existence of a Sidon set whose…
We provide a generalization of the reduction and Robertson positive maps in matrix algebras. They give rise to a new class of optimal entanglement witnesses. Their structural physical approximation is analyzed. As a byproduct we provide a…
This paper introduce a new class of operators and contraction mapping for a cyclical map T on G-metric spaces and the approximately fixed point properties. Also,we prove two general lemmas regarding approximate fixed Point of cyclical…
Structural approximations to positive, but not completely positive maps are approximate physical realizations of these non-physical maps. They find applications in the design of direct entanglement detection methods. We show that many of…
We present a minimax optimal solution to the problem of estimating a compact, convex set from finitely many noisy measurements of its support function. The solution is based on appropriate regularizations of the least squares estimator.…
A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…
We consider various notions of completeness in symplectic topology and ask two related questions. Does a complete open symplectic manifold remain complete after excising a subset? Can two sets be made arbitrarily far apart by adjusting the…
This article is devoted to one particular case of using universal accelerated proximal envelopes to obtain computationally efficient accelerated versions of methods used to solve various optimization problem setups. In this paper, we…
In this paper, we firstly character the structures of symmetries $J$ such that a projection $P$ is $J$-contractive. Then the minimal and maximal elements of the symmetries $J$ with $P^{\ast}JP\leqslant J$(or $JP\geqslant0)$ are given.…
\emph{A maximal distance minimizer} for a given compact set $M \subset \mathbb{R}^2$ and some given $r > 0$ is a set having the minimal length (one-dimensional Hausdorff measure) over the class of closed connected sets $\Sigma \subset…
Recent years have witnessed increasing interest in optimization proxies, i.e., machine learning models that approximate the input-output mapping of parametric optimization problems and return near-optimal feasible solutions. Following…
An exact upper bound on the sum of squared nearest-neighbor distances between points in a rectangle is given.