The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations
From MaRDI portal
Publication:2876840
DOI10.1137/130936269zbMath1298.68287arXiv1309.2094OpenAlexW2964222150MaRDI QIDQ2876840
Dirk A. Lorenz, Frank Schöpfer, Stephan Wenger
Publication date: 20 August 2014
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.2094
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10)
Related Items (24)
Revisiting linearized Bregman iterations under Lipschitz-like convexity condition ⋮ Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems ⋮ Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee ⋮ A dynamical system method for solving the split convex feasibility problem ⋮ A Fast Averaged Kaczmarz Iteration with Convex Penalty for Inverse Problems in Hilbert Spaces ⋮ A projected homotopy perturbation method for nonlinear inverse problems in Banach spaces ⋮ A data-driven Kaczmarz iterative regularization method with non-smooth constraints for ill-posed problems ⋮ Faster randomized block sparse Kaczmarz by averaging ⋮ Sparse sampling Kaczmarz–Motzkin method with linear convergence ⋮ Bregman Itoh-Abe methods for sparse optimisation ⋮ Linear convergence of the randomized sparse Kaczmarz method ⋮ Accelerating Sparse Recovery by Reducing Chatter ⋮ Convergence analysis of an iterative algorithm for fixed point problems and split feasibility problems in certain Banach spaces ⋮ Learning Theory of Randomized Sparse Kaczmarz Method ⋮ Faster Randomized Block Kaczmarz Algorithms ⋮ Strong convergence of split equality Ky Fan inequality problem ⋮ An MM Algorithm for Split Feasibility Problems ⋮ Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions ⋮ An iteration regularization method with general convex penalty for nonlinear inverse problems in Banach spaces ⋮ 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 ⋮ The two-point gradient methods for nonlinear inverse problems based on Bregman projections ⋮ Regularized Kaczmarz Algorithms for Tensor Recovery ⋮ A weighted randomized sparse Kaczmarz method for solving linear systems
This page was built for publication: The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations
