A fast Bregman projection method for linearly constrained optimization problems
From MaRDI portal
Cites work
- A greedy average block sparse Kaczmarz method for sparse solutions of linear systems
- A surrogate hyperplane Bregman-Kaczmarz method for solving linear inverse problems
- A surrogate hyperplane Kaczmarz method for solving consistent linear equations
- AIR tools II: algebraic iterative reconstruction methods, improved implementation
- Accelerated linearized Bregman method
- Accelerated optimization for machine learning. First-order algorithms. With forewords by Michael I. Jordan, Zongben Xu and Zhi-Quan Luo
- 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 Iterative Regularization Method for Total Variation-Based Image Restoration
- Bregman Iterative Algorithms for $\ell_1$-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
- Fast approximation of matrix coherence and statistical leverage
- Fast linearized Bregman iteration for compressive sensing and sparse denoising
- Input sparsity time low-rank approximation via ridge leverage score sampling
- Linear convergence of the randomized sparse Kaczmarz method
- Linearized Bregman Iterations for Frame-Based Image Deblurring
- Minimal error momentum Bregman-Kaczmarz
- Numerical aspects of the nonstationary modified linearized Bregman algorithm
- On Adaptive Sketch-and-Project for Solving Linear Systems
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- On fast greedy block Kaczmarz methods for solving large consistent linear systems
- On the limited memory BFGS method for large scale optimization
- Randomized iterative methods for linear systems
- Randomized sparse block Kaczmarz as randomized dual block-coordinate descent
- Stochastic reformulations of linear systems: algorithms and convergence theory
- The University of Florida sparse matrix collection
- The linearized Bregman method via split feasibility problems: analysis and generalizations
- The sparse Kaczmarz method with surrogate hyperplane for the regularized basis pursuit problem
- Two-Point Step Size Gradient Methods
This page was built for publication: A fast Bregman projection method for linearly constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6947524)
