Error bounds for the method of alternating projections

DOI10.1007/BF02551235MaRDI QIDQ1120959zbMATH OpenFDO

Authors Selahattin Kayalar, Howard L. Weinert

Publication date 1988

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

Full work available at URL https://doi.org/10.1007/BF02551235

zbMATH Keywords

algebraic reconstructionerror boundmedical and geophysical image reconstructionmethod of alternating projections

Mathematics Subject Classification ID

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

Recommendations

• The rate of convergence for the method of alternating projections. II
• scientific article; zbMATH DE number 3919670
• The optimal error bound for the method of simultaneous projections
• Accelerating the convergence of the method of alternating projections
• Error bounds for the method of simultaneous projections with infinitely many subspaces

Cites work

• A General Solution of a Problem in Linear Prediction of Stationary Processes
• Generalized Image Restoration by the Method of Alternating Orthogonal Projections
• scientific article; zbMATH DE number 3776305 (Why is no real title available?)
• scientific article; zbMATH DE number 3230744 (Why is no real title available?)
• scientific article; zbMATH DE number 3085987 (Why is no real title available?)
• New Results on the Interpolation Problem for Continuous-Time Stationary Increments Processes
• On rings of operators. Reduction theory
• On the Alternating Projections Theorem and Bivariate Stationary Stochastic Processes
• On the factorization of matrices
• On the von Neumann alternating algorithm in Hilbert space
• Projection method for solving a singular system of linear equations and its applications
• The angles between the null spaces of X rays
• Theory of Reproducing Kernels

Cited in

(60)

• A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
• Error analysis of algorithms for computing the projection of a point onto a linear manifold
• Oblique projections: Formulas, algorithms, and error bounds
• A method for approximating the solution set of a system of convex inequalities by polytopes
• Successive approximate algorithm for best approximation from a polyhedron
• Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
• The rate of convergence for the method of alternating projections. II
• Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
• Implicit error bounds for Picard iterations on Hilbert spaces
• Circumcentering the Douglas-Rachford method
• Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
• On the Meany inequality with applications to convergence analysis of several row-action iteration methods
• The numerical range and the spectrum of a product of two orthogonal projections
• On the method of reflections
• The circumcentered-reflection method achieves better rates than alternating projections
• Error bounds for the method of simultaneous projections with infinitely many subspaces
• Convergence rates of two-component MCMC samplers
• On angles, projections and iterations
• Worst-case complexity of cyclic coordinate descent: O(n^2) gap with randomized version
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
• Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces
• 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
• On the rate of convergence of the alternating projection method in finite dimensional spaces
• Nullspaces and frames
• Ritt operators and convergence in the method of alternating projections
• Low-rank nonnegative tensor approximation via alternating projections and sketching
• Weaker hypotheses for the general projection algorithm with corrections
• The rate of convergence in the method of alternating projections
• Unconstrained optimization techniques for the acceleration of alternating projection methods
• Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
• Subspaces, angles and pairs of orthogonal projections
• Characterizing arbitrarily slow convergence in the method of alternating projections
• Alternating projections on nontangential manifolds
• scientific article; zbMATH DE number 7739 (Why is no real title available?)
• The alternating algorithm in a uniformly convex and uniformly smooth Banach space
• The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
• The method of alternating projections and the method of subspace corrections in Hilbert space
• Accelerating the convergence of the method of alternating projections
• Strong convergence of expected-projection methods in hilbert spaces
• Generalized consistent sampling in abstract Hilbert spaces
• Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
• Low rank pure quaternion approximation for pure quaternion matrices
• The method of subspace corrections
• Polynomial estimates for the method of cyclic projections in Hilbert spaces
• 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
• Stochastic gradient descent: where optimization meets machine learning
• Analysis of two-component Gibbs samplers using the theory of two projections
• Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
• Local convergence of the error-reduction algorithm for real-valued objects
• Coordinate-update algorithms can efficiently detect infeasible optimization problems
• Douglas–Rachford is the best projection method in its family
• On the boundedness of infinite products of relaxed projections: perturbations resilience and dynamic string-averaging
• OLS with multiple high dimensional category variables
• A generalization of the Friedrichs angle and the method of alternating projections
• 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
• Functions with prescribed best linear approximations
• The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets

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

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