Pages that link to "Item:Q2876840"
From MaRDI portal
The following pages link to The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations (Q2876840):
Displaying 25 items.
- An MM Algorithm for Split Feasibility Problems (Q150985) (← links)
- Linear convergence of the randomized sparse Kaczmarz method (Q1717238) (← links)
- Strong convergence of split equality Ky Fan inequality problem (Q1800609) (← links)
- A weighted randomized sparse Kaczmarz method for solving linear systems (Q2099537) (← links)
- Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems (Q2168919) (← links)
- Bregman Itoh-Abe methods for sparse optimisation (Q2203362) (← links)
- An iteration regularization method with general convex penalty for nonlinear inverse problems in Banach spaces (Q2315857) (← links)
- Convergence of two-stage method with Bregman divergence for solving variational inequalities (Q2320219) (← links)
- A dynamical system method for solving the split convex feasibility problem (Q2666702) (← links)
- Convergence analysis of an iterative algorithm for fixed point problems and split feasibility problems in certain Banach spaces (Q2790882) (← links)
- Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions (Q2821800) (← links)
- Learning Theory of Randomized Sparse Kaczmarz Method (Q4686926) (← links)
- On the choice of Lagrange multipliers in the iterated Tikhonov method for linear ill-posed equations in Banach spaces (Q4991489) (← links)
- The two-point gradient methods for nonlinear inverse problems based on Bregman projections (Q5000586) (← links)
- Revisiting linearized Bregman iterations under Lipschitz-like convexity condition (Q5058656) (← links)
- Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee (Q5088832) (← links)
- A Fast Averaged Kaczmarz Iteration with Convex Penalty for Inverse Problems in Hilbert Spaces (Q5094632) (← links)
- Accelerating Sparse Recovery by Reducing Chatter (Q5143291) (← links)
- Faster Randomized Block Kaczmarz Algorithms (Q5203967) (← links)
- Regularized Kaczmarz Algorithms for Tensor Recovery (Q5860371) (← links)
- A projected homotopy perturbation method for nonlinear inverse problems in Banach spaces (Q6085044) (← links)
- A data-driven Kaczmarz iterative regularization method with non-smooth constraints for ill-posed problems (Q6086874) (← links)
- Faster randomized block sparse Kaczmarz by averaging (Q6109882) (← links)
- Sparse sampling Kaczmarz–Motzkin method with linear convergence (Q6139724) (← links)
- A Bregman–Kaczmarz method for nonlinear systems of equations (Q6492445) (← links)