Related papers: Best Proximity Point Results for Perimetric Contra…
This paper combines two ingredients in order to get a rather surprising result on one of the most studied, elegant and powerful tools for solving convex feasibility problems, the method of alternating projections (MAP). Going back to names…
We give an alternative definition of relative hyperbolicity based on properties of closest-point projections on peripheral subgroups. We also derive a distance formula for relatively hyperbolic groups, similar to the one for mapping class…
We prove a formula for the minimum distance of two-point codes on a Hermitian curve.
We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between any two points along the edges of the resulting network. Problems of this type have received considerable attention…
Considering the Teichm\"uller space of a surface equipped with Thurston's Lipschitz metric, we study geodesic segments whose endpoints have bounded combinatorics. We show that these geodesics are cobounded, and that the closest-point…
We obtain existence and convergence theorems on two variants of the proximal point algorithm for proper lower semicontinuous convex functions in complete geodesic spaces with curvature bounded above.
The point placement problem is to determine the positions of a set of $n$ distinct points, P = {p1, p2, p3, ..., pn}, on a line uniquely, up to translation and reflection, from the fewest possible distance queries between pairs of points.…
In \cite{cheung2019optimally}, the authors presented two finite element methods for approximating second order boundary value problems on polytopial meshes with optimal accuracy without having to utilize curvilinear mappings. This was done…
In this article, we investigate some fixed point results satisfying a new generalized $\Delta$-implicit contractive condition in ordered complete multiplicative $\mathbf{G}_\mathcal{M}-$metric space. Also, some new definitions and fixed…
Given $A$ and $B$ two nonempty subsets in a metric space, a mapping $T : A \cup B \rightarrow A \cup B$ is relatively nonexpansive if $d(Tx,Ty) \leq d(x,y) \text{for every} x\in A, y\in B.$ A best proximity point for such a mapping is a…
Our work explores fusions, the multidimensional counterparts of mean-preserving contractions and their extreme and exposed points. We reveal an elegant geometric/combinatorial structure for these objects. Of particular note is the…
The proximal point algorithm is a widely used tool for solving a variety of convex optimization problems such as finding zeros of maximally monotone operators, fixed points of nonexpansive mappings, as well as minimizing convex functions.…
In view of the great performance of circumcentered isometry methods for solving the best approximation problem, in this work we further investigate the locally proper circumcenter mapping and circumcentered method. Various examples of…
In this paper we introduce three Markovian couplings of Brownian motions on smooth Riemannian manifolds without boundary which sit at the crossroad of two concepts. The first concept is the one of shy coupling put forward in…
This paper proposes a new graph proximity measure. This measure is a derivative of network reliability. By analyzing its properties and comparing it against other proximity measures through graph examples, we demonstrate that it is more…
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 study the convergence of specific inexact alternating projections for two non-convex sets in a Euclidean space. The $\sigma$-quasioptimal metric projection ($\sigma \geq 1$) of a point $x$ onto a set $A$ consists of points in $A$ the…
A flag is a sequence of nested subspaces of a given ambient space F_q^n over a finite field F_q. In network coding, a flag code is a set of flags, all of them with the same sequence of dimensions, the type vector. In this paper, we…
We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.
Perspective functions arise explicitly or implicitly in various forms in applied mathematics and in statistical data analysis. To date, no systematic strategy is available to solve the associated, typically nonsmooth, optimization problems.…