Several acceleration schemes for solving the multiple-sets split feasibility problem
From MaRDI portal
Publication:445822
DOI10.1016/j.laa.2012.05.018zbMath1261.65065MaRDI QIDQ445822
Publication date: 27 August 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2012.05.018
algorithm; convergence; numerical experiments; multiple-sets split feasibility problem; halfspace-relaxation; self-adaptive projection
Related Items
Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size, Split common fixed point problem of nonexpansive semigroup, A Levenberg-Marquardt method for solving the tensor split feasibility problem, An inertial extrapolation method for multiple-set split feasibility problem
Cites Work
- Unnamed Item
- Unnamed Item
- An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
- On the convergence of a class of outer approximation algorithms for convex programs
- A multiprojection algorithm using Bregman projections in a product space
- Inexact implicit methods for monotone general variational inequalities
- A new halfspace-relaxation projection method for the split feasibility problem
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- The multiple-sets split feasibility problem and its applications for inverse problems
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A relaxed projection method for variational inequalities
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- The relaxed CQ algorithm solving the split feasibility problem
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A note on the CQ algorithm for the split feasibility problem
