scientific article
From MaRDI portal
Publication:3694559
zbMath0575.65049MaRDI QIDQ3694559
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
convergenceHilbert spacealternating projection methodalternating method of von Neumannerror factormethod of Kacmarz
Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50)
Related Items
A Deterministic Kaczmarz Algorithm for Solving Linear Systems, The rate of convergence in the method of alternating projections, Distributed continuous-time approximate projection protocols for shortest distance optimization problems, String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases, Generalizations of the projection method with applications to SOR theory for Hermitian positive semidefinite linear systems, A gentle guide to the basics of two projections theory, A generalization of the Friedrichs angle and the method of alternating projections, 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, The combination technique and some generalisations, The optimal error bound for the method of simultaneous projections, The exponential convergence rate of Kaczmarz's algorithm and an acceleration strategy for ART, Alternating projections on nontangential manifolds, Linear Convergence of Randomized Kaczmarz Method for Solving Complex-Valued Phaseless Equations, Randomized optimal consensus of multi-agent systems, Low-rank nonnegative tensor approximation via alternating projections and sketching, The method of alternating projections and the method of subspace corrections in Hilbert space, Convergence of random sleep algorithms for optimal consensus, On the Meany inequality with applications to convergence analysis of several row-action iteration methods, On subspace distances determined by the Frobenius norm, A method for approximating the solution set of a system of convex inequalities by polytopes, Randomized block Kaczmarz method with projection for solving least squares, An Alternating Procedure for Operators on Uniformly Convex and Uniformly Smooth Banach Spaces, Characterizing arbitrarily slow convergence in the method of alternating projections, Constrained best approximation in Hilbert space. II, Functions with prescribed best linear approximations, Accelerating the convergence of the method of alternating projections, The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets, A weighted randomized Kaczmarz method for solving linear systems, On the method of reflections, Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities, Acceleration schemes for the method of alternating projections, Error bounds for the method of simultaneous projections with infinitely many subspaces, On the regularization effect of stochastic gradient descent applied to least-squares, 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, Ritt operators and convergence in the method of alternating projections
