The rate of convergence for the method of alternating projections. II
From MaRDI portal
Publication:1353696
DOI10.1006/jmaa.1997.5202zbMath0890.65053OpenAlexW2052610157MaRDI QIDQ1353696
Publication date: 6 July 1998
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1997.5202
Related Items
A Deterministic Kaczmarz Algorithm for Solving Linear Systems, The rate of convergence in the method of alternating projections, String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases, A generalization of the Friedrichs angle and the method of alternating projections, Solving systems of phaseless equations via Kaczmarz methods: a proof of concept study, The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets, The combination technique and some generalisations, Non-optimality of the greedy algorithm for subspace orderings in the method of alternating projections, Alternating projections on nontangential manifolds, Linear Convergence of Randomized Kaczmarz Method for Solving Complex-Valued Phaseless Equations, Stochastic gradient descent: where optimization meets machine learning, Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma, On the Meany inequality with applications to convergence analysis of several row-action iteration methods, Linear convergence of the randomized sparse Kaczmarz method, 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, Generalized consistent sampling in abstract Hilbert spaces, Characterizing arbitrarily slow convergence in the method of alternating projections, A new projection method for finding the closest point in the intersection of convex sets, Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings, Quadratic optimization of fixed points of nonexpansive mappings in hubert space, OLS with multiple high dimensional category variables, Randomized Kaczmarz solver for noisy linear systems, Accelerating the convergence of the method of alternating projections, The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets, Faster Randomized Block Kaczmarz Algorithms, A weighted randomized Kaczmarz method for solving linear systems, On the method of reflections, 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, On the rate of convergence of the alternating projection method in finite dimensional spaces, Developing Kaczmarz method for solving Sylvester matrix equations, Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections, On the angle and the minimal angle between subspaces
Cites Work
- Error bounds for the method of alternating projections
- On the convergence of von Neumann's alternating projection algorithm for two sets
- On the von Neumann alternating algorithm in Hilbert space
- Practical and mathematical aspects of the problem of reconstructing objects from radiographs
- Generalized Image Restoration by the Method of Alternating Orthogonal Projections
- Theory of Reproducing Kernels
- Functional Operators (AM-22), Volume 2
- Étude sur les variétés et les opérateurs de Julia, avec quelques applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
