A novel relaxed projective method for split feasibility problems
From MaRDI portal
Recommendations
- Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
- The relaxed inexact projection methods for the split feasibility problem
- Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
- A new iterative method for the split feasibility problem
- Modified halfspace-relaxation projection methods for solving the split feasibility problem
Cites work
- scientific article; zbMATH DE number 3441150 (Why is no real title available?)
- A multiprojection algorithm using Bregman projections in a product space
- A note on the CQ algorithm for the split feasibility problem
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Inexact implicit methods for monotone general variational inequalities
- Iterative methods for the split feasibility problem and the fixed point problem in Banach spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- Modified alternating direction methods for the modified multiple-sets split feasibility problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- Several solution methods for the split feasibility problem
- Solving the split feasibility problem without prior knowledge of matrix norms
- Strong convergence of a self-adaptive method for the split feasibility problem in Banach spaces
- The relaxed CQ algorithm solving the split feasibility problem
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
Cited in
(20)- Semidefinite relaxation algorithm for solving tensor split feasibility problem
- Self-adaptive projection algorithms for solving the split equality problems
- Split feasibility handled by a single-projection three-step iteration with comparative analysis
- A half-space projection algorithm for the split feasibility problem
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- Strong convergence of the modified projection and contraction methods for split feasibility problem
- General splitting methods with linearization for the split feasibility problem
- Relaxed extragradient algorithms for the split feasibility problem
- Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
- Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
- An alternating directions method for structured split feasibility problems
- Modified halfspace-relaxation projection methods for solving the split feasibility problem
- Double projection algorithms for solving the split feasibility problems
- A relaxed projection method using a new linesearch for the split feasibility problem
- A novel projection method for split feasibility problems with applications to compressive sensing
- A new halfspace-relaxation projection method for the split feasibility problem
- The relaxed inexact projection methods for the split feasibility problem
- A relaxed projection method for split variational inequalities
- scientific article; zbMATH DE number 7621497 (Why is no real title available?)
- Self adaptive inertial relaxed CQ algorithms for solving split feasibility problem with multiple output sets
This page was built for publication: A novel relaxed projective method for split feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384735)
