The selective projection method for convex feasibility and split feasibility problems
From MaRDI portal
Recommendations
- The combination projection method for solving convex feasibility problems
- A new halfspace-relaxation projection method for the split feasibility problem
- A splitting-relaxed projection method for solving the split feasibility problem
- Block-iterative surrogate projection methods for convex feasibility problems
- Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
Cited in
(21)- The combination projection method for solving convex feasibility problems
- A modified successive projection method for Mann's iteration process
- Optimal parameter selections for a general Halpern iteration
- General splitting methods with linearization for the split feasibility problem
- New inertial relaxed CQ algorithms for solving split feasibility problems in Hilbert spaces
- A Levenberg-Marquardt method for solving the tensor split feasibility problem
- An existence-uniqueness theorem and alternating contraction projection methods for inverse variational inequalities
- Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization
- Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
- The strong convergence of Douglas-Rachford methods for the split feasibility problem
- Relaxed projection and contraction methods for solving Lipschitz continuous monotone variational inequalities
- A new self-adaptive method for the split equality common fixed-point problem of quasi-nonexpansive mappings
- Two projection algorithms for a class of split feasibility problems with jointly constrained Nash equilibrium models
- Perturbed iterative methods for a general family of operators: convergence theory and applications
- An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
- Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method
- Optimal selections of stepsizes and blocks for the block-iterative ART
- An alternated inertial general splitting method with linearization for the split feasibility problem
- Pre-conditioning CQ algorithm for solving the split feasibility problem and its application to image restoration problem
- Krasnoselskii-Mann iterations: inertia, perturbations and approximation
- A new relaxed projection method for solving the split feasibility problem with multiple output sets
This page was built for publication: The selective projection method for convex feasibility and split feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5142522)
