A surrogate hyperplane Bregman-Kaczmarz method for solving linear inverse problems
From MaRDI portal
Recommendations
- Adaptive Bregman-Kaczmarz: an approach to solve linear inverse problems with independent noise exactly
- A surrogate hyperplane Kaczmarz method for solving consistent linear equations
- The sparse Kaczmarz method with surrogate hyperplane for the regularized basis pursuit problem
- A residual-based surrogate hyperplane extended Kaczmarz algorithm for large least squares problems
- Linear convergence of the randomized sparse Kaczmarz method
Cites work
- A randomized Kaczmarz algorithm with exponential convergence
- A weighted randomized sparse Kaczmarz method for solving linear systems
- Acceleration and restart for the randomized Bregman-Kaczmarz method
- Adaptive Bregman-Kaczmarz: an approach to solve linear inverse problems with independent noise exactly
- Adaptively sketched Bregman projection methods for linear systems
- An Optimal Scheduled Learning Rate for a Randomized Kaczmarz Algorithm
- Atomic decomposition by basis pursuit
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- Compressed sensing
- Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
- Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems
- Faster randomized block sparse Kaczmarz by averaging
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- Linear convergence of the randomized sparse Kaczmarz method
- Linearized Bregman iterations for compressed sensing
- Modern regularization methods for inverse problems
- On a Generalization of an Inequality of L. V. Kantorovich
- Randomized sparse block Kaczmarz as randomized dual block-coordinate descent
- Solving ill-posed inverse problems using iterative deep neural networks
- Solving inverse problems using data-driven models
- Sparse and redundant representations. From theory to applications in signal and image processing.
- The linearized Bregman method via split feasibility problems: analysis and generalizations
- The sparse Kaczmarz method with surrogate hyperplane for the regularized basis pursuit problem
Cited in
(12)- The sparse Kaczmarz method with surrogate hyperplane for the regularized basis pursuit problem
- Adaptive Bregman-Kaczmarz: an approach to solve linear inverse problems with independent noise exactly
- Preconditioned linearized Bregman method with Golub-Kahan bidiagonalization for frame-based image deblurring
- Two accelerated residual-based iterative methods and their convergence analyses
- A surrogate hyperplane Kaczmarz method with oblique projection for solving linear systems
- A fast Bregman projection method for linearly constrained optimization problems
- Randomized block residual steepest descent method with k-means clustering for large sparse linear systems
- Surrogate hyperplane regularized iterative methods for sparse and structured solutions of factorized linear systems
- A residual-based randomized Kaczmarz method for solving linear feasibility problems
- On the improved residual-based surrogate hyperplane Kaczmarz method for solving linear systems
- On the adaptively inexact sketched Newton-Raphson methods for nonlinear systems of equations
- Residual-based surrogate hyperplane double and triple Kaczmarz algorithms for solving extended normal equations
This page was built for publication: A surrogate hyperplane Bregman-Kaczmarz method for solving linear inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645935)