Error bounds for the method of alternating projections
From MaRDI portal
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
- 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?)
- A General Solution of a Problem in Linear Prediction of Stationary Processes
- Generalized Image Restoration by the Method of Alternating Orthogonal Projections
- 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
(56)- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version
- A generalization of the Friedrichs angle and the method of alternating projections
- The circumcentered-reflection method achieves better rates than alternating projections
- Non-optimality of the greedy algorithm for subspace orderings in the method of alternating projections
- On the Meany inequality with applications to convergence analysis of several row-action iteration methods
- 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
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
- Accelerating the convergence of the method of alternating projections
- scientific article; zbMATH DE number 7739 (Why is no real title available?)
- Error bounds for the method of simultaneous projections with infinitely many subspaces
- The rate of convergence in the method of alternating projections
- Unconstrained optimization techniques for the acceleration of alternating projection methods
- On angles, projections and iterations
- Circumcentering the Douglas-Rachford method
- A method for approximating the solution set of a system of convex inequalities by polytopes
- Convergence rates of two-component MCMC samplers
- The alternating algorithm in a uniformly convex and uniformly smooth Banach space
- Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
- On the method of reflections
- The method of subspace corrections
- The optimal error bound for the method of simultaneous projections
- On the rate of convergence of the alternating projection method in finite dimensional spaces
- OLS with multiple high dimensional category variables
- Functions with prescribed best linear approximations
- Oblique projections: Formulas, algorithms, and error bounds
- The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
- Alternating projections on nontangential manifolds
- Weaker hypotheses for the general projection algorithm with corrections
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
- 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
- The method of alternating projections and the method of subspace corrections in Hilbert space
- Subspaces, angles and pairs of orthogonal projections
- Low-rank nonnegative tensor approximation via alternating projections and sketching
- The rate of convergence for the method of alternating projections. II
- Nullspaces and frames
- Generalized consistent sampling in abstract Hilbert spaces
- A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
- Ritt operators and convergence in the method of alternating projections
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
- Implicit error bounds for Picard iterations on Hilbert spaces
- Characterizing arbitrarily slow convergence in the method of alternating projections
- The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
- Successive approximate algorithm for best approximation from a polyhedron
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
- Strong convergence of expected-projection methods in hilbert spaces
- Error analysis of algorithms for computing the projection of a point onto a linear manifold
- Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
- 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
- Low rank pure quaternion approximation for pure quaternion matrices
- 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
- Polynomial estimates for the method of cyclic projections in Hilbert spaces
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)
