A relaxed randomized averaging block extended Bregman-Kaczmarz method for combined optimization problems
From MaRDI portal
Cites work
- A fast block nonlinear Bregman-Kaczmarz method with averaging for nonlinear sparse signal recovery
- A randomized Kaczmarz algorithm with exponential convergence
- A surrogate hyperplane Bregman-Kaczmarz method for solving linear inverse problems
- A surrogate hyperplane Kaczmarz method with oblique projection 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
- 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 Kaczmarz algorithms
- 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
- Minimal error momentum Bregman-Kaczmarz
- Modern regularization methods for inverse problems
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- On multi-step randomized extended Kaczmarz method for solving large sparse inconsistent linear systems
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- Randomized block Kaczmarz method with projection for solving least squares
- Randomized extended average block Kaczmarz for solving least squares
- Randomized extended Kaczmarz for solving least squares
- 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
- Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss-Seidel algorithms.
- Variational analysis
This page was built for publication: A relaxed randomized averaging block extended Bregman-Kaczmarz method for combined optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296915)