Error bounds for the method of alternating projections

DOI10.1007/BF02551235zbMath0673.65036MaRDI QIDQ1120959

Howard L. Weinert, Selahattin Kayalar

Publication date: 1988

Published in: MCSS. Mathematics of Control, Signals, and Systems (Search for Journal in Brave)

zbMATH Keywords

error boundmethod of alternating projectionsalgebraic reconstructionmedical and geophysical image reconstruction

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Control/observation systems in abstract spaces (93C25) Numerical solutions to equations with linear operators (65J10)

Related Items (52)

The rate of convergence in the method of alternating projections ⋮ Convergence rates of two-component MCMC samplers ⋮ Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces ⋮ 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 ⋮ A generalization of the Friedrichs angle and the method of alternating projections ⋮ The rate of convergence for the method of alternating projections. II ⋮ The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets ⋮ The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators ⋮ Circumcentering the Douglas-Rachford method ⋮ Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces ⋮ The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case ⋮ Non-optimality of the greedy algorithm for subspace orderings in the method of alternating projections ⋮ The optimal error bound for the method of simultaneous projections ⋮ Oblique projections: Formulas, algorithms, and error bounds ⋮ Alternating projections on nontangential manifolds ⋮ Strong convergence of expected-projection methods in hilbert spaces ⋮ Subspaces, angles and pairs of orthogonal projections ⋮ Polynomial estimates for the method of cyclic projections in Hilbert spaces ⋮ Low-rank nonnegative tensor approximation via alternating projections and sketching ⋮ 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 ⋮ On angles, projections and iterations ⋮ The method of alternating projections and the method of subspace corrections in Hilbert space ⋮ Stochastic gradient descent: where optimization meets machine learning ⋮ On the Meany inequality with applications to convergence analysis of several row-action iteration methods ⋮ Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version ⋮ A method for approximating the solution set of a system of convex inequalities by polytopes ⋮ Low Rank Pure Quaternion Approximation for Pure Quaternion Matrices ⋮ Generalized consistent sampling in abstract Hilbert spaces ⋮ Convergence properties of dynamic string-averaging projection methods in the presence of perturbations ⋮ Characterizing arbitrarily slow convergence in the method of alternating projections ⋮ The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle ⋮ The method of subspace corrections ⋮ OLS with multiple high dimensional category variables ⋮ Functions with prescribed best linear approximations ⋮ The numerical range and the spectrum of a product of two orthogonal projections ⋮ Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces ⋮ Accelerating the convergence of the method of alternating projections ⋮ Analysis of two-component Gibbs samplers using the theory of two projections ⋮ The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets ⋮ On the method of reflections ⋮ The circumcentered-reflection method achieves better rates than alternating projections ⋮ Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems ⋮ Error bounds for the method of simultaneous projections with infinitely many subspaces ⋮ Successive approximate algorithm for best approximation from a polyhedron ⋮ A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin ⋮ Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods ⋮ On the rate of convergence of the alternating projection method in finite dimensional spaces ⋮ Nullspaces and frames ⋮ Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections ⋮ Ritt operators and convergence in the method of alternating projections

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The angles between the null spaces of X rays
• On the von Neumann alternating algorithm in Hilbert space
• Projection method for solving a singular system of linear equations and its applications
• On rings of operators. Reduction theory
• On the factorization of matrices
• New Results on the Interpolation Problem for Continuous-Time Stationary Increments Processes
• Generalized Image Restoration by the Method of Alternating Orthogonal Projections
• On the Alternating Projections Theorem and Bivariate Stationary Stochastic Processes
• A General Solution of a Problem in Linear Prediction of Stationary Processes
• Theory of Reproducing Kernels

This page was built for publication: Error bounds for the method of alternating projections