On the rate of convergence of the alternating projection method in finite dimensional spaces

DOI10.1016/j.jmaa.2004.12.050zbMath1074.65059OpenAlexW2020004242MaRDI QIDQ2566096

Aurel Galantai

Publication date: 22 September 2005

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2004.12.050

zbMATH Keywords

rate of convergenceorthogonal projectionsalternating projection method

Mathematics Subject Classification ID

Numerical solutions to equations with linear operators (65J10) Rate of convergence, degree of approximation (41A25) Numerical linear algebra (65Fxx)

Related Items (18)

A Deterministic Kaczmarz Algorithm for Solving Linear Systems ⋮ An accelerated randomized Kaczmarz algorithm ⋮ Solving systems of phaseless equations via Kaczmarz methods: a proof of concept study ⋮ Linear Convergence of Randomized Kaczmarz Method for Solving Complex-Valued Phaseless Equations ⋮ Approximate Solutions of Linear Systems at a Universal Rate ⋮ Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency ⋮ Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma ⋮ Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version ⋮ Two-subspace projection method for coherent overdetermined systems ⋮ Randomized block Kaczmarz method with projection for solving least squares ⋮ Alternating projection method for sparse model updating problems ⋮ Randomized Kaczmarz solver for noisy linear systems ⋮ A weighted randomized Kaczmarz method for solving linear systems ⋮ On the regularization effect of stochastic gradient descent applied to least-squares ⋮ A randomized Kaczmarz algorithm with exponential convergence ⋮ Surrounding the solution of a linear system of equations from all sides ⋮ An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems ⋮ Developing Kaczmarz method for solving Sylvester matrix equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalizations of the projection method with applications to SOR theory for Hermitian positive semidefinite linear systems
• Error bounds for the method of alternating projections
• The angles between the null spaces of X rays
• The rate of convergence for the method of alternating projections. II
• Algebraic and numerical techniques for the computation of matrix determinants
• On the von Neumann alternating algorithm in Hilbert space
• A Bessel-Schwarz inequality for Gramians and related bounds for determinants
• On rings of operators. Reduction theory
• Practical and mathematical aspects of the problem of reconstructing objects from radiographs
• On Projection Algorithms for Solving Convex Feasibility Problems
• Numerical Methods for Computing Angles Between Linear Subspaces
• On the Geometry of Subspaces in Euclideann-Spaces
• A Matrix Inequality
• The Convergence of Linear Stationary Iterative Processes for Solving Singular Unstructured Systems of Linear Equations
• Theory of Reproducing Kernels

This page was built for publication: On the rate of convergence of the alternating projection method in finite dimensional spaces