{'fraction_non_alphanumeric': 0.0205799812909261, 'fraction_numerical': 0.007483629560336763, 'mean_word_length': 5.484848484848484, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
ITERATIVE METHODS FOR APPROXIMATION OF FIXED POINTS AND THEIR APPLICATIONS

In this article, we deal with iterative methods for approximation of fixed points and their applications. We first discuss fixed point theorems for a nonexpansive mapping or a family of nonexpansive mappings. In particular, we state a fixed point theorem which answered affirmatively a problem posed during the Conference on Fixed Point Theory and Applications held at CIRM, Marseille-Luminy, 1989. Then we discuss nonlinear ergodic theorems of Baillon's type for nonlinear semigroups of nonexpansive mappings. In particular, we state nonlinear ergodic theorems which answered affirmatively the problem posed during the Second World Congress on Nonlinear Analysts, Athens, Greece, 1996. Next, we deal with weak and strong convergence theorems of Mann's type and Halpern's type in a Banach space. Finally, using these results, we consider the feasibility problem by convex combinations of nonexpansive retractions and the convex minimization problem of finding a minimizer of a convex function.