AbstractThis paper provides an effective uniform rate of metastability (in the sense of Tao) on the strong convergence of Halpern iterations of nonexpansive mappings in CAT(0) spaces. The extraction of this rate from an ineffective proof due to Saejung is an instance of the general proof mining program which uses tools from mathematical logic to uncover hidden computational content from proofs. This methodology is applied here for the first time to a proof that uses Banach limits and hence makes a substantial reference to the axiom of choice
AbstractThe purpose of this work is to modify the Halpern-type iteration algorithm to have strong co...
We provide in a unified way quantitative forms of strong convergence results for numerous it-erative...
The dominated convergence theorem implies that if (fn) is a sequence of functions on a probability s...
Motivated by Halpern's result, we prove strong convergence theorem of an iterative sequence in C...
Under weaker conditions on parameters, we prove strong convergence theorems of Halpern type iteratio...
In this paper we apply proof mining techniques to compute, in the setting of CAT(κ) spaces (with κ&g...
In this paper we obtain new effective results on the Halpern iterations of nonexpansive mappings usi...
In this paper we apply proof mining techniques to compute, in the setting of CAT(κ) spaces (with κ ...
Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any m...
AbstractThis paper is another case study in the program of logically analyzing proofs to extract new...
In this paper, we introduced a new mapping given by a finite family of multivalued monotone mappings...
AbstractIn this paper, we note that the main convergence theorem in Zhang et al. (2011) [21] is inco...
Abstract The purpose of this paper is to consider that a modified Halpern's iterative sequence con...
The ongoing program of `proof mining' aims to extract new, quantitative information in the form of b...
The ongoing program of `proof mining' aims to extract new, quantitative information in the form of b...
AbstractThe purpose of this work is to modify the Halpern-type iteration algorithm to have strong co...
We provide in a unified way quantitative forms of strong convergence results for numerous it-erative...
The dominated convergence theorem implies that if (fn) is a sequence of functions on a probability s...
Motivated by Halpern's result, we prove strong convergence theorem of an iterative sequence in C...
Under weaker conditions on parameters, we prove strong convergence theorems of Halpern type iteratio...
In this paper we apply proof mining techniques to compute, in the setting of CAT(κ) spaces (with κ&g...
In this paper we obtain new effective results on the Halpern iterations of nonexpansive mappings usi...
In this paper we apply proof mining techniques to compute, in the setting of CAT(κ) spaces (with κ ...
Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any m...
AbstractThis paper is another case study in the program of logically analyzing proofs to extract new...
In this paper, we introduced a new mapping given by a finite family of multivalued monotone mappings...
AbstractIn this paper, we note that the main convergence theorem in Zhang et al. (2011) [21] is inco...
Abstract The purpose of this paper is to consider that a modified Halpern's iterative sequence con...
The ongoing program of `proof mining' aims to extract new, quantitative information in the form of b...
The ongoing program of `proof mining' aims to extract new, quantitative information in the form of b...
AbstractThe purpose of this work is to modify the Halpern-type iteration algorithm to have strong co...
We provide in a unified way quantitative forms of strong convergence results for numerous it-erative...
The dominated convergence theorem implies that if (fn) is a sequence of functions on a probability s...