A weighted randomized sparse Kaczmarz method for solving linear systems

DOI10.1007/s40314-022-02105-9OpenAlexW4308545478MaRDI QIDQ2099537

Hui Zhang, Lu Zhang, Ziyang Yuan, Hong-Xia Wang

Publication date: 24 November 2022

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-022-02105-9

zbMATH Keywords

linear convergenceBregman projectionKaczmarz methodBregman distancesparse solutionweighted sampling rule

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Iterative numerical methods for linear systems (65F10)

Uses Software

• SparseMatrix
• PDCO

Cites Work

• Unnamed Item
• Unnamed Item
• Randomized Kaczmarz solver for noisy linear systems
• A randomized Kaczmarz algorithm with exponential convergence
• Introductory lectures on convex optimization. A basic course.
• Linear convergence of the randomized sparse Kaczmarz method
• Solving the system of nonsingular tensor equations via randomized Kaczmarz-like method
• On randomized partial block Kaczmarz method for solving huge linear algebraic systems
• Atomic Decomposition by Basis Pursuit
• Randomized Extended Kaczmarz for Solving Least Squares
• The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations
• The university of Florida sparse matrix collection
• Sparse and Redundant Representations
• Variational Analysis
• Exact Regularization of Polyhedral Norms
• A weighted randomized Kaczmarz method for solving linear systems
• An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems
• Adaptively sketched Bregman projection methods for linear systems
• Phase retrieval via randomized Kaczmarz: theoretical guarantees
• Regularized Kaczmarz Algorithms for Tensor Recovery

This page was built for publication: A weighted randomized sparse Kaczmarz method for solving linear systems