相关论文: Quantitative results on a Halpern-type proximal po…

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 metastability (in the sense of T. Tao) and also a rate of…

We prove an abstract form of the strong convergence of the Halpern-type and Tikhonov-type proximal point algorithms in CAT(0) spaces. In addition, we derive uniform and computable rates of metastability (in the sense of Tao) for these…

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 point algorithm which involves multiple parameters. Yao and…

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 analyse the strong convergence of this algorithm under two…

This Note is inspired by the recent paper by Djafary Rouhani and Moradi [J. Optim. Theory Appl. 172 (2017) 222-235], where a proximal point algorithm proposed by Boikanyo and Moro\c{s}anu [Optim. Lett. 7 (2013) 415-420] is discussed. We…

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 suitable conditions, the strong convergence of this algorithm,…

In this paper we obtain new effective results on the Halpern iterations of nonexpansive mappings using methods from mathematical logic or, more specifically, proof-theoretic techniques. We give effective rates of asymptotic regularity for…

In this paper, relying on methods from proof mining, we provide a quantitative analysis of a theorem due to Xu, stating that an iteration strongly converges to the solution of a well known quadratic optimization problem. Rates of…

In this paper, inspired by Iemoto and Takahashi [S. Iemoto, W. Takahashi, Nonlinear Analysis 71, (2009), 2082-2089], we study the Halpern's method to approximate strongly fixed points of a nonexpansive mapping and of a nonspreading mapping.…

We give a rate of metastability for Halpern's iteration relative to a rate of metastability for the resolvent for nonexpansive mappings in uniformly smooth Banach spaces, extracted from a proof due to Xu. In Hilbert space, the latter is…

In this work, we propose and study a framework of generalized proximal point algorithms associated with a maximally monotone operator. We indicate sufficient conditions on the regularization and relaxation parameters of generalized proximal…

We apply proof mining techniques to obtain quantitative and qualitative results on asymptotic and T-asymptotic regularity for the inexact generalized Halpern iteration, a viscosity-type extension of an iteration recently studied by Kanzow…

In this paper we apply methods of proof mining to obtain a highly uniform effective rate of asymptotic regularity for the Ishikawa iteration associated to nonexpansive self-mappings of convex subsets of a class of uniformly convex geodesic…

In this paper, we use techniques which originate from proof mining to give rates of asymptotic regularity and metastability for a sequence associated to the composition of two firmly nonexpansive mappings.

In this paper we apply proof mining techniques to compute, in the setting of CAT$(\kappa)$ spaces (with $\kappa >0$), effective and highly uniform rates of asymptotic regularity and metastability for a nonlinear generalization of the…

We provide quantitative information in the form of a rate of metastability in the sense of T. Tao and (under a metric regularity assumption) a rate of convergence for an algorithm approximating zeros of differences of maximally monotone…

The Halpern algorithm is a powerful fixed point approximation method for finding the closest point in the fixed point set of a nonexpansive mapping to the initial point. However, in practice, it is not necessarily true that this algorithm…

We use proof mining techniques to obtain a uniform rate of asymptotic regularity for the instance of the parallel algorithm used by L\'opez-Acedo and Xu to find common fixed points of finite families of $k$-strict pseudocontractive…

We provide in a unified way quantitative forms of strong convergence results for numerous iterative procedures which satisfy a general type of Fejer monotonicity where the convergence uses the compactness of the underlying set. These…

In this paper, we introduce two new modified inertial Mann Halpern and viscosity algorithms for solving fixed point problems. We establish strong convergence theorems under some suitable conditions. Finally, our algorithms are applied to…