Linear and strong convergence of algorithms involving averaged nonexpansive operators

DOI10.1016/j.jmaa.2014.06.075zbMath1297.65060arXiv1402.5460OpenAlexW2962704982MaRDI QIDQ401327

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

Publication date: 26 August 2014

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

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

zbMATH Keywords

convergenceprojectionconvex feasibility problembounded linear regularityDouglas-Rachford algorithmnumerical comparisonnonexpansive operatoraveraged nonexpansive mappingBorwein-Tam method

Mathematics Subject Classification ID

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

Related Items

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 ⋮ Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems ⋮ A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ Convergence rates with inexact non-expansive operators ⋮ Implicit error bounds for Picard iterations on Hilbert spaces ⋮ Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry ⋮ Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems ⋮ Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging ⋮ Circumcentering the Douglas-Rachford method ⋮ Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination ⋮ On the circumcentered-reflection method for the convex feasibility problem ⋮ Convergence rate of a gradient projection method for solving variational inequalities ⋮ Quadratic growth conditions and uniqueness of optimal solution to Lasso ⋮ On the linear convergence of the circumcentered-reflection method ⋮ The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ Union averaged operators with applications to proximal algorithms for MIN-convex functions ⋮ Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems ⋮ Convergence rates for the relaxed Peaceman-Rachford splitting method on a monotone inclusion problem ⋮ Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency ⋮ Deep neural network structures solving variational inequalities ⋮ 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 ⋮ Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property ⋮ Various Notions of Nonexpansiveness Coincide for Proximal Mappings of Functions ⋮ Convergence analysis of the generalized Douglas-Rachford splitting method under Hölder subregularity assumptions ⋮ Outer approximation methods for solving variational inequalities in Hilbert space ⋮ Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour ⋮ Linear convergence rates for extrapolated fixed point algorithms ⋮ Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations ⋮ 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 ⋮ On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces ⋮ New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses ⋮ Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators ⋮ Linear convergence of the Douglas–Rachford method for two closed sets ⋮ Constraint reduction reformulations for projection algorithms with applications to wavelet construction ⋮ Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators ⋮ 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 ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ Best approximation mappings in Hilbert spaces ⋮ Iteration process for fixed point problems and zeros of maximal monotone operators ⋮ Projection methods for high numerical aperture phase retrieval ⋮ Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons ⋮ Conical averagedness and convergence analysis of fixed point algorithms ⋮ Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Restricted normal cones and the method of alternating projections: theory
• Iterative methods for fixed point problems in Hilbert spaces
• Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
• Robinson's implicit function theorem and its extensions
• The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
• Metric subregularity and the proximal point method
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Strong Abadie CQ, ACQ, calmness and linear regularity
• 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
• Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• On Projection Algorithms for Solving Convex Feasibility Problems
• A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space
• Convergence of the Proximal Point Method for Metrically Regular Mappings
• Generalized Solutions for the Sum of Two Maximally Monotone Operators
• Convex analysis and monotone operator theory in Hilbert spaces
• Best approximation in inner product spaces