Convergence of a randomized Douglas-Rachford method for linear system
From MaRDI portal
Publication:827570
DOI10.3934/naco.2020045zbMath1456.65021OpenAlexW3091765983MaRDI QIDQ827570
Publication date: 13 January 2021
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2020045
Numerical mathematical programming methods (65K05) Convex programming (90C25) Stochastic programming (90C15) Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Greedy and randomized versions of the multiplicative Schwarz method
- Randomized block Kaczmarz method with projection for solving least squares
- Projection methods for linear systems
- Block-iterative methods for consistent and inconsistent linear equations
- A randomized Kaczmarz algorithm with exponential convergence
- On the convergence of von Neumann's alternating projection algorithm for two sets
- On convergence rate of the randomized Kaczmarz method
- A cyclic Douglas-Rachford iteration scheme
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- An Algorithm for Restricted Least Squares Regression
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- On Projection Algorithms for Solving Convex Feasibility Problems
- Functional Operators (AM-22), Volume 2
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Convergence of a randomized Douglas-Rachford method for linear system
