Convergence rate analysis for averaged fixed point iterations in the presence of Hölder regularity

Abstract

In this paper, we establish sublinear and linear convergence of fixed point iterations generated by averaged operators in a Hilbert space. Our results are achieved under a bounded Hölder regularity assumption which generalizes the well-known notion of bounded linear regularity. As an application of our results, we provide a convergence rate analysis for Krasnoselskii-Mann iterations, the cyclic projection algorithm, and the Douglas-Rachford feasibility algorithm along with some variants. In the important case in which the underlying sets are convex sets described by convex polynomials in a finite dimensional space, we show that the Hölder regularity properties are automatically satisfied, from which sublinear convergence follows.

34 pages, 1 figure

References in corpus (2)

• Error Bounds and Metric Subregularity
• Projection Methods: An Annotated Bibliography of Books and Reviews

Cited by in corpus (13)

• Computing the Self-Consistent Field in Kohn-Sham Density Functional Theory
• Quantitative convergence analysis of iterated expansive, set-valued mappings
• Adaptive Douglas-Rachford splitting algorithm for the sum of two operators
• Convergence Properties of Dynamic String Averaging Projection Methods in the Presence of Perturbations
• Linear Convergence of Projection Algorithms
• Transversality Properties: Primal Sufficient Conditions
• Error bounds, facial residual functions and applications to the exponential cone
• Amenable cones are particularly nice
• Convergence analysis under consistent error bounds
• Quantitative analysis of a subgradient-type method for equilibrium problems
• Trilevel and Multilevel Optimization using Monotone Operator Theory
• Eigenvalue programming beyond matrices
• Concrete convergence rates for common fixed point problems under Karamata regularity