Error bounds for the method of alternating projections
From MaRDI portal
Publication:1120959
DOI10.1007/BF02551235zbMATH Open0673.65036MaRDI QIDQ1120959FDOQ1120959
Howard L. Weinert, Selahattin Kayalar
Publication date: 1988
Published in: MCSS. Mathematics of Control, Signals, and Systems (Search for Journal in Brave)
error boundmethod of alternating projectionsalgebraic reconstructionmedical and geophysical image reconstruction
Numerical optimization and variational techniques (65K10) Control/observation systems in abstract spaces (93C25) Numerical solutions to equations with linear operators (65J10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On rings of operators. Reduction theory
- Theory of Reproducing Kernels
- Projection method for solving a singular system of linear equations and its applications
- On the factorization of matrices
- The angles between the null spaces of X rays
- Generalized Image Restoration by the Method of Alternating Orthogonal Projections
- On the von Neumann alternating algorithm in Hilbert space
- New Results on the Interpolation Problem for Continuous-Time Stationary Increments Processes
- On the Alternating Projections Theorem and Bivariate Stationary Stochastic Processes
- A General Solution of a Problem in Linear Prediction of Stationary Processes
Cited In (56)
- 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
- Comparing the methods of alternating and simultaneous projections for two subspaces
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
- Analysis of two-component Gibbs samplers using the theory of two projections
- Stochastic gradient descent: where optimization meets machine learning
- Polynomial estimates for the method of cyclic projections in Hilbert spaces
- Accelerating the convergence of the method of alternating projections
- The alternating algorithm in a uniformly convex and uniformly smooth Banach space
- Ritt operators and convergence in the method of alternating projections
- Nullspaces and frames
- Functions with prescribed best linear approximations
- A generalization of the Friedrichs angle and the method of alternating projections
- Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods
- Oblique projections: Formulas, algorithms, and error bounds
- On the Meany inequality with applications to convergence analysis of several row-action iteration methods
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
- Error analysis of algorithms for computing the projection of a point onto a linear manifold
- Convergence rates of two-component MCMC samplers
- A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
- Implicit error bounds for Picard iterations on Hilbert spaces
- The numerical range and the spectrum of a product of two orthogonal projections
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
- Circumcentering the Douglas-Rachford method
- Weaker hypotheses for the general projection algorithm with corrections
- The circumcentered-reflection method achieves better rates than alternating projections
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
- Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
- The optimal error bound for the method of simultaneous projections
- Low Rank Pure Quaternion Approximation for Pure Quaternion Matrices
- OLS with multiple high dimensional category variables
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
- The rate of convergence in the method of alternating projections
- Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- A method for approximating the solution set of a system of convex inequalities by polytopes
- The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
- Successive approximate algorithm for best approximation from a polyhedron
- On the rate of convergence of the alternating projection method in finite dimensional spaces
- Low-rank nonnegative tensor approximation via alternating projections and sketching
- Error bounds for the method of simultaneous projections with infinitely many subspaces
- Characterizing arbitrarily slow convergence in the method of alternating projections
- The method of subspace corrections
- Generalized consistent sampling in abstract Hilbert spaces
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
- Strong convergence of expected-projection methods in hilbert spaces
- Subspaces, angles and pairs of orthogonal projections
- On angles, projections and iterations
- Title not available (Why is that?)
- The method of alternating projections and the method of subspace corrections in Hilbert space
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version
- The rate of convergence for the method of alternating projections. II
- The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
- Non-optimality of the greedy algorithm for subspace orderings in the method of alternating projections
- On the method of reflections
- Alternating projections on nontangential manifolds
- Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
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)