Linear and strong convergence of algorithms involving averaged nonexpansive operators

DOI10.1016/J.JMAA.2014.06.075zbMATH Open1297.65060arXiv1402.5460OpenAlexW2962704982MaRDI QIDQ401327FDOQ401327

Authors: Heinz H. Bauschke, Dominikus Noll, Hung M. Phan 

Publication date: 26 August 2014

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Abstract: We introduce regularity notions for averaged nonexpansive operators. Combined with regularity notions of their fixed point sets, we obtain linear and strong convergence results for quasicyclic, cyclic, and random iterations. New convergence results on the Borwein-Tam method (BTM) and on the cylically anchored Douglas-Rachford algorithm (CADRA) are also presented. Finally, we provide a numerical comparison of BTM, CADRA and the classical method of cyclic projections for solving convex feasibility problems.

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

Recommendations

• Convergence rate analysis for averaged fixed point iterations in common fixed point problems
• Conical averagedness and convergence analysis of fixed point algorithms
• Successive Averages of Firmly Nonexpansive Mappings
• Regular Sequences of Quasi-Nonexpansive Operators and Their Applications
• A cyclic Douglas-Rachford iteration scheme

zbMATH Keywords

convergenceprojectionconvex feasibility problembounded linear regularityDouglas-Rachford algorithmnonexpansive operatornumerical comparisonaveraged nonexpansive mappingBorwein-Tam method

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15)

Cites Work

• On Projection Algorithms for Solving Convex Feasibility Problems
• Convex analysis and monotone operator theory in Hilbert spaces
• Title not available (Why is that?)
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• Title not available (Why is that?)
• On the convergence of von Neumann's alternating projection algorithm for two sets
• The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Robinson's implicit function theorem and its extensions
• Iterative methods for fixed point problems in Hilbert spaces
• Best approximation in inner product spaces
• 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
• About regularity of collections of sets
• Restricted normal cones and the method of alternating projections: theory
• Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
• A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space
• The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
• Metric subregularity and the proximal point method
• Strong Abadie CQ, ACQ, calmness and linear regularity
• Title not available (Why is that?)
• Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
• Convergence of the Proximal Point Method for Metrically Regular Mappings
• Generalized solutions for the sum of two maximally monotone operators

Cited In (50)

• Various Notions of Nonexpansiveness Coincide for Proximal Mappings of Functions
• Regular Sequences of Quasi-Nonexpansive Operators and Their Applications
• Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations
• An improved relaxed inertial projection algorithm for solving the minimum-norm solution of variational inequality and fixed point problems
• Regularity of sets under a reformulation in a product space with reduced dimension
• Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
• Iteration process for fixed point problems and zeros of maximal monotone operators
• Linear convergence rates for extrapolated fixed point algorithms
• On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces
• Linear convergence of projection algorithms
• On the order of the operators in the Douglas-Rachford algorithm
• On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
• Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
• Convergence rate analysis for averaged fixed point iterations in common fixed point problems
• Weak, strong, and linear convergence of a double-layer fixed point algorithm
• Convergence rate of a gradient projection method for solving variational inequalities
• Union averaged operators with applications to proximal algorithms for MIN-convex functions
• Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination
• Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators
• Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators
• Finitely convergent iterative methods with overrelaxations revisited
• Deep neural network structures solving variational inequalities
• A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
• Convergence analysis of Douglas-Rachford splitting method for ``strongly + weakly convex programming
• Convergence analysis of the generalized Douglas-Rachford splitting method under Hölder subregularity assumptions
• Conical averagedness and convergence analysis of fixed point algorithms
• Implicit error bounds for Picard iterations on Hilbert spaces
• SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
• Convergence rates with inexact non-expansive operators
• Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
• Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry
• Circumcentering the Douglas-Rachford method
• Outer approximation methods for solving variational inequalities in Hilbert space
• Best approximation mappings in Hilbert spaces
• Convergence rates for boundedly regular systems
• Linear convergence of the Douglas-Rachford method for two closed sets
• Local linear convergence of the ADMM/Douglas-Rachford algorithms without strong convexity and application to statistical imaging
• Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property
• Constraint reduction reformulations for projection algorithms with applications to wavelet construction
• Projection methods for high numerical aperture phase retrieval
• Quadratic growth conditions and uniqueness of optimal solution to Lasso
• The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
• Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour
• On the linear convergence of the circumcentered-reflection method
• On the circumcentered-reflection method for the convex feasibility problem
• Error bounds for the method of simultaneous projections with infinitely many subspaces
• Convergence rates for the relaxed Peaceman-Rachford splitting method on a monotone inclusion problem
• New Douglas-Rachford algorithmic structures and their convergence analyses
• Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
• Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency

This page was built for publication: Linear and strong convergence of algorithms involving averaged nonexpansive operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q401327)