Accelerating the convergence of the method of alternating projections
From MaRDI portal
Publication:4417269
DOI10.1090/S0002-9947-03-03136-2zbMath1033.41019MaRDI QIDQ4417269
Heinz H. Bauschke, Sung-Ho Park, Frank Deutsch, Hein S. Hundal
Publication date: 28 July 2003
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Related Items (37)
Alternating projection method for a class of tensor equations ⋮ Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces ⋮ Implicit error bounds for Picard iterations on Hilbert spaces ⋮ Gearhart-Koshy acceleration for affine subspaces ⋮ Affine nonexpansive operators, Attouch-Théra duality and the Douglas-Rachford algorithm ⋮ Variable target value relaxed alternating projection method ⋮ Closed-Form Expressions for Projectors onto Polyhedral Sets in Hilbert Spaces ⋮ The block-wise circumcentered-reflection method ⋮ Comparing the methods of alternating and simultaneous projections for two subspaces ⋮ The Splitting Algorithms by Ryu, by Malitsky–Tam, and by Campoy Applied to Normal Cones of Linear Subspaces Converge Strongly to the Projection onto the Intersection ⋮ The method of alternating projections and the method of subspace corrections in Hilbert space ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ A Donoho-Stark criterion for stable signal recovery in discrete wavelet subspaces ⋮ Projection and proximal point methods: Convergence results and counterexamples. ⋮ Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes ⋮ A computation study on an integrated alternating direction method of multipliers for large scale optimization ⋮ The forward-backward algorithm and the normal problem ⋮ The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle ⋮ Functions with prescribed best linear approximations ⋮ Extrapolation algorithm for affine-convex feasibility problems ⋮ On the linear convergence of circumcentered isometry methods ⋮ Unnamed Item ⋮ Angles between infinite dimensional subspaces with applications to the Rayleigh-Ritz and alternating projectors methods ⋮ An acceleration scheme for Dykstra's algorithm ⋮ On the method of reflections ⋮ Set intersection problems: supporting hyperplanes and quadratic programming ⋮ The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces ⋮ Subgradient projection algorithms for convex feasibility problems in the presence of computational errors ⋮ Stochastic proximal splitting algorithm for composite minimization ⋮ Unnamed Item ⋮ A learning-enhanced projection method for solving convex feasibility problems ⋮ Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods ⋮ Best approximation mappings in Hilbert spaces ⋮ The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem ⋮ On Subgradient Projectors ⋮ Optimal Ordering of Projections using Permutation Matrices and Angles between Projection Subspaces ⋮ Generalized Gearhart-Koshy acceleration for the Kaczmarz method
Cites Work
- On the acceleration of Kaczmarz's method for inconsistent linear systems
- Error bounds for the method of alternating projections
- Acceleration schemes for the method of alternating projections
- The rate of convergence for the method of alternating projections. II
- On the von Neumann alternating algorithm in Hilbert space
- Practical and mathematical aspects of the problem of reconstructing objects from radiographs
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- Theory of Reproducing Kernels
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Accelerating the convergence of the method of alternating projections
