63 citations · 81 across the 10 of their papers we have counts for
13 papers
Quantitative limit theorems for generalized Pólya urns with applications to random tree models
Morenikeji Neri, Pedro Pinto
We establish novel quantitative limit theorems for the asymptotic distribution of colours in a generalized Pólya urn. Concretely, we construct explicit rates of convergence for the…
On the finitary content of Dykstra's cyclic projections algorithm
Pedro Pinto
We study the asymptotic behaviour of the well-known Dykstra's algorithm through the lens of proof-theoretical techniques. We provide an elementary proof for the convergence of Dyks…
On computational properties of Cauchy problems generated by accretive operators
Pedro Pinto, Nicholas Pischke
In this paper, we provide quantitative versions of results on the asymptotic behavior of nonlinear semigroups generated by an accretive operator due to O. Nevanlinna and S. Reich a…
Rates of asymptotic regularity for the alternating Halpern-Mann iteration
Laurentiu Leustean, Pedro Pinto
In this paper we extend to -hyperbolic spaces the quantitative asymptotic regularity results for the alternating Halpern-Mann iteration obtained by Dinis and the second author…
Strong convergence for the alternating Halpern-Mann iteration in CAT(0) spaces
Bruno Dinis, Pedro Pinto
In this paper we consider, in the general context of CAT(0) spaces, an iterative schema which alternates between Halpern and Krasnoselskii-Mann style iterations. We prove, under su…
Quantitative translations for viscosity approximation methods in hyperbolic spaces
Ulrich Kohlenbach, Pedro Pinto
In the setting of hyperbolic spaces, we show that the convergence of Browder-type sequences and Halpern iterations respectively entail the convergence of their viscosity version wi…
Effective metastability for a method of alternating resolvents
Bruno Dinis, Pedro Pinto
A generalized method of alternating resolvents was introduced by Boikanyo and Moro{\c s}anu as a way to approximate common zeros of two maximal monotone operators. In this paper we…
On the convergence of algorithms with Tikhonov regularization terms
Bruno Dinis, Pedro Pinto
We consider the strongly convergent modified versions of the Krasnosel'ski\uı-Mann, the forward-backward and the Douglas-Rachford algorithms with Tikhonov regularization terms, int…
Quantitative results on a Halpern-type proximal point algorithm
Laurentiu Leustean, Pedro Pinto
We apply proof mining methods to analyse a result of Boikanyo and Moroşanu on the strong convergence of a Halpern-type proximal point algorithm. As a consequence, we obtain quantit…
A rate of metastability for the Halpern type Proximal Point Algorithm
Pedro Pinto
Using proof-theoretical techniques, we analyze a proof by H.-K. Xu regarding a result of strong convergence for the Halpern type proximal point algorithm. We obtain a rate of metas…
Quantitative results on the multi-parameters Proximal Point Algorithm
Bruno Dinis, Pedro Pinto
We give a quantitative analysis of a theorem due to Fenghui Wang and Huanhuan Cui concerning the convergence of a multi-parametric version of the proximal point algorithm. Wang and…
Metastability of the proximal point algorithm with multi-parameters
Bruno Dinis, Pedro Pinto
In this article we use techniques of proof mining to analyse a result, due to Yonghong Yao and Muhammad Aslam Noor, concerning the strong convergence of a generalized proximal poin…
On the removal of weak compactness arguments in proof mining
Fernando Ferreira, Laurentiu Leustean, Pedro Pinto
The main observation of this paper is that some sequential weak compactness arguments in Hilbert space theory can be replaced by Heine/Borel compactness arguments (for the strong t…