Adaptively sketched Bregman projection methods for linear systems
From MaRDI portal
Publication:5076003
DOI10.1088/1361-6420/AC5F76OpenAlexW4220933353MaRDI QIDQ5076003FDOQ5076003
Authors: Ziyang Yuan, Lu Zhang, Hongxia Wang, Hui Zhang 
Publication date: 12 May 2022
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.14456
Recommendations
- Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition
- Randomized iterative methods for linear systems
- Linear convergence of the randomized sparse Kaczmarz method
- Sparse sampling Kaczmarz–Motzkin method with linear convergence
- A weighted randomized sparse Kaczmarz method for solving linear systems
Cites Work
- A randomized Kaczmarz algorithm with exponential convergence
- Title not available (Why is that?)
- Title not available (Why is that?)
- Randomized methods for linear constraints: convergence rates and conditioning
- Convex analysis and monotone operator theory in Hilbert spaces
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Randomized iterative methods for linear systems
- Greedy and randomized versions of the multiplicative Schwarz method
- On Kaczmarz's projection iteration as a direct solver for linear least squares problems
- AIR tools II: algebraic iterative reconstruction methods, improved implementation
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- An accelerated randomized Kaczmarz algorithm
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- Linear convergence of the randomized sparse Kaczmarz method
- Randomized sparse block Kaczmarz as randomized dual block-coordinate descent
- Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions
- Sparse sampling Kaczmarz–Motzkin method with linear convergence
- Stochastic reformulations of linear systems: algorithms and convergence theory
- On Adaptive Sketch-and-Project for Solving Linear Systems
- A new Kaczmarz-type method and its acceleration for nonlinear ill-posed problems
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
- A projective averaged Kaczmarz iteration for nonlinear ill-posed problems
Cited In (8)
- A randomized sparse Kaczmarz solver for sparse signal recovery via minimax-concave penalty
- A weighted randomized sparse Kaczmarz method for solving linear systems
- The sparse Kaczmarz method with surrogate hyperplane for the regularized basis pursuit problem
- On greedy multi-step inertial randomized Kaczmarz method for solving linear systems
- Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition
- A surrogate hyperplane Bregman-Kaczmarz method for solving linear inverse problems
- A greedy average block sparse Kaczmarz method for sparse solutions of linear systems
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
This page was built for publication: Adaptively sketched Bregman projection methods for linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5076003)
