The linearized Bregman method via split feasibility problems: analysis and generalizations
From MaRDI portal
Abstract: The linearized Bregman method is a method to calculate sparse solutions to systems of linear equations. We formulate this problem as a split feasibility problem, propose an algorithmic framework based on Bregman projections and prove a general convergence result for this framework. Convergence of the linearized Bregman method will be obtained as a special case. Our approach also allows for several generalizations such as other objective functions, incremental iterations, incorporation of non-gaussian noise models or box constraints.
Recommendations
- Analysis and generalizations of the linearized Bregman method
- Accelerated linearized Bregman method
- Linearized Krylov subspace Bregman iteration with nonnegativity constraint
- Linearized Bregman iterations for compressed sensing
- Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
Cited in
(45)- A fast Bregman projection method for linearly constrained optimization problems
- Strong convergence of split equality variational inequality, variational inclusion, and multiple sets fixed point problems in Hilbert spaces with application
- A fast averaged Kaczmarz iteration with convex penalty for inverse problems in Hilbert spaces
- Learning theory of randomized sparse Kaczmarz method
- A weighted randomized sparse Kaczmarz method for solving linear systems
- A randomized sparse Kaczmarz solver for sparse signal recovery via minimax-concave penalty
- Faster randomized block sparse Kaczmarz by averaging
- Analysis and generalizations of the linearized Bregman method
- Minimal error momentum Bregman-Kaczmarz
- Accelerated linearized Bregman method
- Accelerating Sparse Recovery by Reducing Chatter
- Revisiting linearized Bregman iterations under Lipschitz-like convexity condition
- Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions
- 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
- The split Bregman algorithm applied to PDE-constrained optimization problems with total variation regularization
- The two-point gradient methods for nonlinear inverse problems based on Bregman projections
- Bregman methods for large-scale optimization with applications in imaging
- Quantile-based random sparse Kaczmarz for corrupted and noisy linear systems
- Convergence analysis of the nonlinear Kaczmarz method for systems of nonlinear equations with componentwise convex mappings and applications to image reconstruction in multispectral CT
- Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
- A data-driven Kaczmarz iterative regularization method with non-smooth constraints for ill-posed problems
- Regularized Kaczmarz Algorithms for Tensor Recovery
- Acceleration and restart for the randomized Bregman-Kaczmarz method
- Stochastic dual coordinate descent with adaptive heavy ball momentum for linearly constrained convex optimization
- Faster randomized block Kaczmarz algorithms
- Split Bregman algorithms for multiple measurement vector problem
- Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems
- A dynamical system method for solving the split convex feasibility problem
- A projected homotopy perturbation method for nonlinear inverse problems in Banach spaces
- Strong convergence of split equality Ky Fan inequality problem
- A Bregman–Kaczmarz method for nonlinear systems of equations
- A surrogate hyperplane Bregman-Kaczmarz method for solving linear inverse problems
- An iteration regularization method with general convex penalty for nonlinear inverse problems in Banach spaces
- A dynamical system with fixed-time convergence for solving the split feasibility problem and applications to signal recovery
- Convergence of two-stage method with Bregman divergence for solving variational inequalities
- On the choice of Lagrange multipliers in the iterated Tikhonov method for linear ill-posed equations in Banach spaces
- Sparse sampling Kaczmarz–Motzkin method with linear convergence
- An MM Algorithm for Split Feasibility Problems
- Power of _1-norm regularized Kaczmarz algorithms for high-order tensor recovery
- Convergence analysis of an iterative algorithm for fixed point problems and split feasibility problems in certain Banach spaces
- Bregman Itoh-Abe methods for sparse optimisation
- A subspace-accelerated split Bregman method for sparse data recovery with joint _1-type regularizers
- A greedy average block sparse Kaczmarz method for sparse solutions of linear systems
- Linear convergence of the randomized sparse Kaczmarz method
This page was built for publication: The linearized Bregman method via split feasibility problems: analysis and generalizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876840)
