Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems

DOI10.1137/15M1045223zbMath1361.90045arXiv1510.06823OpenAlexW3103639684WikidataQ59241421 ScholiaQ59241421MaRDI QIDQ2954171

Jonathan M. Borwein, Matthew K. Tam, Guoyin Li

Publication date: 12 January 2017

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.06823

zbMATH Keywords

convergence rateHölder regularityfixed point iterationDouglas-Rachford algorithmaveraged operatorsemi-algebraic

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Best approximation, Chebyshev systems (41A50) Rate of convergence, degree of approximation (41A25)

Related Items

Quantitative analysis of a subgradient-type method for equilibrium problems ⋮ Primal necessary characterizations of transversality properties ⋮ Implicit error bounds for Picard iterations on Hilbert spaces ⋮ Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems ⋮ On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery ⋮ Inverting incomplete Fourier transforms by a sparse regularization model and applications in seismic wavefield modeling ⋮ Unnamed Item ⋮ Convergence rate analysis for fixed-point iterations of generalized averaged nonexpansive operators ⋮ Error bounds, facial residual functions and applications to the exponential cone ⋮ A Sequential Constraint Method for Solving Variational Inequality over the Intersection of Fixed Point Sets ⋮ Quasi-Nonexpansive Iterations on the Affine Hull of Orbits: From Mann's Mean Value Algorithm to Inertial Methods ⋮ Deep neural network structures solving variational inequalities ⋮ Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property ⋮ Convergence analysis of the generalized Douglas-Rachford splitting method under Hölder subregularity assumptions ⋮ Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators ⋮ Linear convergence rates for extrapolated fixed point algorithms ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 ⋮ Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples ⋮ Convergence rates for boundedly regular systems ⋮ Regular Sequences of Quasi-Nonexpansive Operators and Their Applications ⋮ Finitely convergent iterative methods with overrelaxations revisited ⋮ Convergence properties of dynamic string-averaging projection methods in the presence of perturbations ⋮ Convergence Rate Analysis of Inertial Krasnoselskii–Mann Type Iteration with Applications ⋮ The Relevance of a Metric Condition on a Pair of Operators in Common Fixed Point Theory ⋮ Transversality properties: primal sufficient conditions ⋮ Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators ⋮ Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings ⋮ Linear Convergence of Projection Algorithms ⋮ Error bounds for the method of simultaneous projections with infinitely many subspaces ⋮ Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm ⋮ Convergence rate analysis of an iterative algorithm for solving the multiple-sets split equality problem ⋮ Moduli of regularity and rates of convergence for Fejér monotone sequences ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators ⋮ Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections ⋮ Amenable Cones Are Particularly Nice ⋮ Lipschitz Certificates for Layered Network Structures Driven by Averaged Activation Operators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• Semi-algebraic functions have small subdifferentials
• Linear and strong convergence of algorithms involving averaged nonexpansive operators
• Recent results on Douglas-Rachford methods for combinatorial optimization problems
• About \([q\)-regularity properties of collections of sets]
• Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
• Local linear convergence for alternating and averaged nonconvex projections
• Remarks on piecewise-linear algebra
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Tight global linear convergence rate bounds for Douglas-Rachford splitting
• Global error bounds for piecewise convex polynomials
• A cyclic Douglas-Rachford iteration scheme
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
• Extrapolation algorithm for affine-convex feasibility problems
• Linear convergence of the Douglas–Rachford method for two closed sets
• Proximal point algorithm, Douglas-Rachford algorithm and alternating projections: a case study
• The Douglas–Rachford Algorithm in the Absence of Convexity
• DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS
• Convergence Rate Analysis of the Forward-Douglas-Rachford Splitting Scheme
• On Weak Convergence of the Douglas–Rachford Method
• On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Maximum entropy and feasibility methods for convex and nonconvex inverse problems
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Projection methods: an annotated bibliography of books and reviews
• Characterizing arbitrarily slow convergence in the method of alternating projections
• Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Some continuity properties of polyhedral multifunctions
• Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• On Projection Algorithms for Solving Convex Feasibility Problems
• Hölder Metric Subregularity with Applications to Proximal Point Method
• Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
• Error bounds and metric subregularity
• Norm convergence of realistic projection and reflection methods
• The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems
• Convergence Rate Analysis of Several Splitting Schemes
• Alternating Projections on Manifolds
• Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
• The method of projections for finding the common point of convex sets
• Convex analysis and monotone operator theory in Hilbert spaces