Moduli of regularity and rates of convergence for Fejér monotone sequences (Q2317680)

In order to analyze the speed of convergence -- including the linear convergence and finite termination -- for various classes of Fejér monotone sequences which appear in fixed point theory, monotone operator theory, and convex optimization, the authors introduce the concept of modulus of regularity. This concept is useful as it allows the authors to perform a unified approach to several notions such as weak sharp minima, error bounds, metric subregularity, Hölder regularity, etc. On the same basis, they also obtain rates of convergence for Picard iterates, the Mann algorithm, the proximal point algorithm, and the cyclic projection method. As an auxiliary result, they obtain a quantitative version of the well-known fact that, for a convex lower semi-continuous function, the set of minimizers coincides with the set of zeros of its subdifferential and the set of fixed points of its resolvent.