Related papers: Rates of asymptotic regularity for Halpern iterati…
The concept of asymptotically nonexpansive mappings is an important generalization of the class of nonexpansive mappings. Implicit midpoint procedures are extremely fundamental for solving equations involving nonlinear operators. This paper…
A generalization of a viscosity generalized Halpern iteration scheme is analyzed. It is proven that the solution converges asymptotically strongly to a unique fixed point of an asymptotically nonexpansive mapping which drives the iteration…
This paper seeks to advance the theory of nonexpansive mappings by introducing and exploring a novel class of nonexpansive type mappings, which we aptly designate as perimetric nonexpansive mappings. We establish that the collection of…
In this study, we introduce a new iterative processes to approximate common fixed points of an infinite family of quasi-nonexpansive mappings and obtain a strongly convergent iterative sequence to the common fixed points of these mappings…
Current performance bounds for randomized iterative methods are often considered tight under per-iteration analyses, yet they are notoriously loose in practice. We derive asymptotic performance bounds that narrow this theory-practice gap,…
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…
In this paper we establish an estimate for the rate of convergence of the Krasnosel'ski\v{\i}-Mann iteration for computing fixed points of non-expansive maps. Our main result settles the Baillon-Bruck conjecture [3] on the asymptotic…
This paper provides a fixed point theorem and iterative construction of a common fixed point for a general class of nonlinear mappings in the setup of uniformly convex hyperbolic spaces. We translate a multi-step iteration, essentially due…
We study Krasnoselskii-Mann style iterative algorithms for approximating fixpoints of asymptotically weakly contractive mappings, with a focus on providing generalised convergence proofs along with explicit rates of convergence. More…
We propose the class of uniformly convex $W$-hyperbolic spaces with monotone modulus of uniform convexity ($UCW$-hyperbolic spaces for short) as an appropriate setting for the study of nonexpansive iterations. $UCW$-hyperbolic spaces are a…
We investigate the asymptotic distributions of coordinates of regression M-estimates in the moderate $p/n$ regime, where the number of covariates $p$ grows proportionally with the sample size $n$. Under appropriate regularity conditions, we…
We analytically compute asymptotic expansions of a 1-dimensional sub-manifold of stable and unstable manifolds in a 4-dimensional symplectic mapping by using the method called asymptotic expansions beyond all orders. This method enables us…
We study local asymptotic normality of M-estimates of convex minimization in an infinite dimensional parameter space. The objective function of M-estimates is not necessary differentiable and is possibly subject to convex constraints. In…
This paper explores the asymptotic behaviour of the radii of convexity and uniform convexity for normalized Bessel functions with respect to large order. We provide detailed asymptotic expansions for these radii and establish recurrence…
We study a stochastically perturbed version of the well-known Krasnoselski--Mann iteration for computing fixed points of nonexpansive maps in finite dimensional normed spaces. We discuss sufficient conditions on the stochastic noise and…
In this paper, we study, in a nonlinear setting, the asymptotic behaviour of a generalized viscosity approximation method associated with a countable family of nonexpansive mappings satisfying resolvent-like conditions. We apply proof…
Regularized kernel methods such as, e.g., support vector machines and least-squares support vector regression constitute an important class of standard learning algorithms in machine learning. Theoretical investigations concerning…
Parametric high-dimensional regression analysis requires the usage of regularization terms to get interpretable models. The respective estimators can be regarded as regularized M-functionals which are naturally highly nonlinear. We study…
Asymptotic efficiency theory is one of the pillars in the foundations of modern mathematical statistics. Not only does it serve as a rigorous theoretical benchmark for evaluating statistical methods, but it also sheds light on how to…
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…