A note on an alternative iterative method for nonexpansive mappings
In this note we point out that results on the asymptotic behaviour of an alternative iterative method are corollaries of corresponding results on the well-known Halpern iteration.
arXiv subjects
Publications and source records attributed to Adriana Nicolae.
In this note we point out that results on the asymptotic behaviour of an alternative iterative method are corollaries of corresponding results on the well-known Halpern iteration.
In this paper we apply proof mining techniques to compute, in the setting of CAT$(κ)$ spaces (with $κ>0$), effective and highly uniform rates of asymptotic regularity and metastability for a nonlinear generalization of the ergodic averages, known as the Halpern iteration. In this way, we obtain a uniform quantitative version of a nonlinear extension of the classical von Neumann mean ergodic theorem.
In this paper we provide a unified treatment of some convex minimization problems, which allows for a better understanding and, in some cases, improvement of results in this direction proved recently in spaces of curvature bounded above. For this purpose, we analyze the asymptotic behavior of compositions of finitely many firmly nonexpansive mappings in the setting of $p$-uniformly convex geodesic spaces focusing on asymptotic regularity and convergence results.
This paper deals with the study of parameter dependence of extensions of Lipschitz mappings from the point of view of continuity. We show that if assuming appropriate curvature bounds for the spaces, the multivalued extension operators that assign to every nonexpansive (resp. Lipschitz) mapping all its nonexpansive extensions (resp. Lipschitz extensions with the same Lipschitz constant) are lower semi-continuous and admit continuous selections. Moreover, we prove that Lipschitz mappings can be extended continuously even when imposing the condition that the image of the extension belongs to the closure of the convex hull of the image of the original mapping. When the target space is hyperconvex one can obtain in fact nonexpansivity.
Various results based on some convexity assumptions (involving the exponential map along with affine maps, geodesics and convex hulls) have been recently established on Hadamard manifolds. In this paper we prove that these conditions are mutually equivalent and they hold if and only if the Hadamard manifold is isometric to the Euclidean space. In this way, we show that some results in the literature obtained on Hadamard manifolds are actually nothing but their well known Euclidean counterparts.
We further study averaged and firmly nonexpansive mappings in the setting of geodesic spaces with a main focus on the asymptotic behavior of their Picard iterates. We use methods of proof mining to obtain an explicit quantitative version of a generalization to geodesic spaces of result on the asymptotic behavior of Picard iterates for firmly nonexpansive mappings proved by Reich and Shafrir. From this result we obtain effective uniform bounds on the asymptotic regularity for firmly nonexpansive mappings. Besides this, we derive effective rates of asymptotic regularity for sequences generated by two algorithms used in the study of the convex feasibility problem in a nonlinear setting.
We study the nonexpansivity of reflection mappings in geodesic spaces and apply our findings to the averaged alternating reflection algorithm employed in solving the convex feasibility problem for two sets in a nonlinear context. We show that weak convergence results from Hilbert spaces find natural counterparts in spaces of constant curvature. Moreover, in this particular setting, one obtains strong convergence.
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 point $x \in A \cup B$ such that $d(x,Tx)=\text{dist}(A,B)$. In this work, we extend the results given in [A.A. Eldred, W.A. Kirk, P. Veeramani, Proximal normal structure and relatively nonexpansive mappings, Studia Math., 171 (2005), 283-293] for relatively nonexpansive mappings in Banach spaces to more general metric spaces. Namely, we give existence results of best proximity points for cyclic and noncyclic relatively nonexpansive mappings in the context of Busemann convex reflexive metric spaces. Moreover, particular results are proved in the setting of CAT(0) and uniformly convex geodesic spaces. Finally, we show that proximal normal structure is a sufficient but not necessary condition for the existence in $A \times B$ of a pair of best proximity points.
This paper provides uniform bounds on the asymptotic regularity for iterations associated to a finite family of nonexpansive mappings. We obtain our quantitative results in the setting of $(r,δ)$-convex spaces, a class of geodesic spaces which generalizes metric spaces with a convex geodesic bicombing.
Let $A$ and $X$ be nonempty, bounded and closed subsets of a geodesic metric space $(E,d)$. The minimization (resp. maximization) problem denoted by $\min(A,X)$ (resp. $\max(A,X)$) consists in finding $(a_0,x_0) \in A \times X$ such that $d(a_0,x_0) = \inf\{d(a,x) : a \in A, x \in X\}$ (resp. $d(a_0,x_0) = \sup\{d(a,x) : a \in A, x \in X\}$). We study the well-posedness of these problems in different geodesic spaces considering the set $A$ fixed. Let $P_{b,cl,cv}(E)$ be the space of all nonempty, bounded, closed and convex subsets of $E$ endowed with the Pompeiu-Hausdorff distance. We show that in a space with a convex metric, curvature bounded below and the geodesic extension property, the family of sets in $P_{b,cl,cv}(E)$ for which $\max(A,X)$ is well-posed is a dense $G_δ$-set in $P_{b,cl,cv}(E)$. We give a similar result for $\min(A,X)$ without needing the geodesic extension property. Besides, we analyze the situations when one set or both sets are compact and prove some results specific to CAT$(0)$ spaces. We also prove a variant of the Drop theorem in geodesic spaces with a convex metric and apply it to obtain an optimization result for convex functions.