Adaptively sketched Bregman projection methods for linear systems

DOI10.1088/1361-6420/AC5F76MaRDI QIDQ5076003zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Bregman distanceBregman projectionKaczmarz methodsampling rulesketch-and-project

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

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 new Kaczmarz-type method and its acceleration for nonlinear ill-posed problems
• A projective averaged Kaczmarz iteration for nonlinear ill-posed problems
• A randomized Kaczmarz algorithm with exponential convergence
• AIR tools II: algebraic iterative reconstruction methods, improved implementation
• An accelerated randomized Kaczmarz algorithm
• Convex analysis and monotone operator theory in Hilbert spaces
• Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
• Greedy and randomized versions of the multiplicative Schwarz method
• scientific article; zbMATH DE number 1046019 (Why is no real title available?)
• scientific article; zbMATH DE number 3027894 (Why is no real title available?)
• Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions
• Linear convergence of the randomized sparse Kaczmarz method
• On Adaptive Sketch-and-Project for Solving Linear Systems
• On greedy randomized Kaczmarz method for solving large sparse linear systems
• On Kaczmarz's projection iteration as a direct solver for linear least squares problems
• On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
• Paved with good intentions: analysis of a randomized block Kaczmarz method
• Randomized iterative methods for linear systems
• Randomized methods for linear constraints: convergence rates and conditioning
• Randomized sparse block Kaczmarz as randomized dual block-coordinate descent
• Sparse sampling Kaczmarz–Motzkin method with linear convergence
• Stochastic reformulations of linear systems: algorithms and convergence theory

Cited in

(13)

• A weighted randomized sparse Kaczmarz method for solving linear systems
• Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
• Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition
• Adaptively Sketched Bregman Projection Methods for Linear Systems
• A greedy average block sparse Kaczmarz method for sparse solutions of linear systems
• A randomized sparse Kaczmarz solver for sparse signal recovery via minimax-concave penalty
• 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
• A surrogate hyperplane Bregman-Kaczmarz method for solving linear inverse problems
• On pseudoinverse-free randomized methods for linear systems: unified framework and acceleration
• A greedy randomized average block projection method for linear feasibility problems
• A fast Bregman projection method for linearly constrained optimization problems
• Quantile-based random sparse Kaczmarz for corrupted and noisy linear systems

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)