Related papers: A note on best proximity point for proximal contra…
This work investigates the properties of the proximity operator for quasar-convex functions and establishes the convergence of the proximal point algorithm to a global minimizer with a particular focus on its convergence rate. In…
We augment the dimension of the Euclidean space by one and the Picard iteration of a contraction by a simple iteration on the real line such that the resulting iteration becomes monotone increasing and bounded with respect to the order…
The classical theorem of Bishop-Phelps asserts that, for a Banach space X, the norm-achieving functionals in X* are dense in X*. Bela Bollobas's extension of the theorem gives a quantitative description of just how dense the norm-achieving…
We consider a class of generalized nonexpansive mappings introduced by Karapinar [5] and seen as a generalization of Suzuki (C)-condition. We prove some weak and strong convergence theorems for approximating fixed points of such mappings…
A Strong Convergence Theorem for finite families of Bregman Demimetric Mappings in a Banach Space under a New Shrinking projection Method
A polarity notion for sets in a Banach space is introduced in such a way that the second polar of a set coincides with the smallest strongly convex set with respect to R that contains it. Strongly convex sets are characterized in terms of…
The main purpose of this note is to show that the question posed in the paper of Sinha D.P. and Karn A.K.("Compact operators which factor through subspaces of $l_p$ Math. Nachr. 281, 2008, 412-423; see the very end of that paper) has a…
Locality-sensitive hashing (LSH), introduced by Indyk and Motwani in STOC '98, has been an extremely influential framework for nearest neighbor search in high-dimensional data sets. While theoretical work has focused on the approximate…
We develop a sketching algorithm to find the point on the convex hull of a dataset, closest to a query point outside it. Studying the convex hull of datasets can provide useful information about their geometric structure and their…
In 1926, H. Busch formulated a theorem for one single charged particle moving along a region with a longitudinal magnetic field [H. Busch, Berechnung der Bahn von Kathodenstrahlen in axial symmetrischen electromagnetischen Felde, Z. Phys.…
Based on the idea of randomizing the traditional space theory of functional analysis, random functional analysis has been developed as functional analysis over random metric spaces, random normed modules and random locally convex modules.…
We study the problem of estimating the fixed point of a contractive operator defined on a separable Banach space. Focusing on a stochastic query model that provides noisy evaluations of the operator, we analyze a variance-reduced stochastic…
In this paper, we develop a parameterized proximal point algorithm (P-PPA) for solving a class of separable convex programming problems subject to linear and convex constraints. The proposed algorithm is provable to be globally convergent…
The current paper studies the problem of minimizing a loss $f(\boldsymbol{x})$ subject to constraints of the form $\boldsymbol{D}\boldsymbol{x} \in S$, where $S$ is a closed set, convex or not, and $\boldsymbol{D}$ is a matrix that fuses…
For a Banach space $X$ by $Conv_H(X)$ we denote the space of non-empty closed convex subsets of $X$, endowed with the Hausdorff metric. We prove that for any closed convex set $C\subset X$ and its metric component $H_C=\{A\in…
We propose a unifying approach to many approximation properties studied in the literature from the 1930s up to our days. To do so, we say that a Banach space E has the (I,J,{\tau})-approximation property if E-valued operators belonging to…
The nearest-neighbor rule is a well-known classification technique that, given a training set P of labeled points, classifies any unlabeled query point with the label of its closest point in P. The nearest-neighbor condensation problem aims…
We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of…
We prove that any correspondence (multi-function) mapping a metric space into a Banach space that satisfies a certain pointwise Lipschitz condition, always has a continuous selection that is pointwise Lipschitz on a dense set of its domain.…
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…