13 research outputs found

    Conical averagedness and convergence analysis of fixed point algorithms

    Get PDF
    We study a conical extension of averaged nonexpansive operators and the role it plays in convergence analysis of fixed point algorithms. Various properties of conically averaged operators are systematically investigated, in particular, the stability under relaxations, convex combinations and compositions. We derive conical averagedness properties of resolvents of generalized monotone operators. These properties are then utilized in order to analyze the convergence of the proximal point algorithm, the forward–backward algorithm, and the adaptive Douglas–Rachford algorithm. Our study unifies, improves and casts new light on recent studies of these topics. © 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature
    corecore