Composite projection algorithms for the split feasibility problem
From MaRDI portal
Recommendations
- The constrained multiple-sets split feasibility problem and its projection algorithms
- Projection-type methods for solving the split feasibility problem
- Projection algorithm for split feasibility problem
- A new iterative method for the split feasibility problem
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
Cited in
(13)- A splitting primal-dual proximity algorithm for solving composite optimization problems
- Modified Krasnoselski-Mann type iterative algorithm with strong convergence for hierarchical fixed point problem and split monotone variational inclusions
- Hybrid steepest descent method for solving the split fixed point problem in Banach spaces
- A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems
- Hybrid iterative algorithms for the split common fixed point problems
- A new split inverse problem and an application to least intensity feasible solutions
- Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration
- Solving the split feasibility problem without prior knowledge of matrix norms
- Preconditioning methods for solving a general split feasibility problem
- Projection algorithms for the solution of split feasibility problem with 1-norm constraints
- Projection algorithm for split feasibility problem
- The constrained multiple-sets split feasibility problem and its projection algorithms
- Projection-type methods for solving the split feasibility problem
This page was built for publication: Composite projection algorithms for the split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256426)