A new halfspace-relaxation projection method for the split feasibility problem
From MaRDI portal
Publication:2472374
Let \(C\) and \(Q\) be nonempty closed convex in \(\mathbb R^{n}\) and \(\mathbb R^{m}\), respectively, and \(A\) an \(m\times n\) real matrix. The problem, to find \( x\in C\) with \(Ax\in Q\) if such \(x\) exists, is called the split feasibility problem(SPF). The authors propose a new halfspace-relaxation projection method for the SFP. The method is implemented very easily and is proven to be fully convergent to the solution for the case where the solution set of the SFP is nonempty.
Recommendations
- Modified halfspace-relaxation projection methods for solving the split feasibility problem
- A splitting-relaxed projection method for solving the split feasibility problem
- A half-space projection algorithm for the split feasibility problem
- A novel relaxed projective method for split feasibility problems
- The relaxed inexact projection methods for the split feasibility problem
- A relaxed projection method using a new linesearch for the split feasibility problem
- Projection-type methods for solving the split feasibility problem
- A new relaxed projection method to solve the multiple-sets split feasibility problem
- scientific article; zbMATH DE number 7621497
- Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces
Cites work
- A class of projection and contraction methods for monotone variational inequalities
- A multiprojection algorithm using Bregman projections in a product space
- A note on the CQ algorithm for the split feasibility problem
- A relaxed projection method for variational inequalities
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- scientific article; zbMATH DE number 3094904 (Why is no real title available?)
- Iterative oblique projection onto convex sets and the split feasibility problem
- Minimization of unsmooth functionals
- Modified Projection-Type Methods for Monotone Variational Inequalities
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
Cited in
(56)- A new simultaneous iterative method with a parameter for solving the extended split equality problem and the extended split equality fixed point problem
- On the computation of the step-size for the CQ-like algorithms for the split feasibility problem
- The split feasibility problem and its solution algorithm
- On descent-projection method for solving the split feasibility problems
- A simultaneous iteration algorithm for solving extended split equality fixed point problem
- Analysis on Newton projection method for the split feasibility problem
- New inertial relaxed CQ algorithms for solving split feasibility problems in Hilbert spaces
- Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
- An alternating iteration algorithm for solving the split equality fixed point problem with L-Lipschitz and quasi-pseudo-contractive mappings
- Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
- Full convergence of an approximate projection method for nonsmooth variational inequalities
- Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
- The subgradient double projection method for variational inequalities in a Hilbert space
- Mixed simultaneous iterative algorithms for the extended multiple-set split equality common fixed-point problem with Lipschitz quasi-pseudocontractive operators
- General method for solving the split common fixed point problem
- New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
- Inertial accelerated algorithms for solving a split feasibility problem
- Hybrid CQ projection algorithm with line-search process for the split feasibility problem
- A simultaneous iterative method for split equality problems of two finite
- A splitting-relaxed projection method for solving the split feasibility problem
- An Iterative Algorithm for Split Common Fixed-Point Problem for Demicontractive Mappings
- A half-space projection algorithm for the split feasibility problem
- An explicit algorithm for monotone variational inequalities
- Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces
- Projection methods for the linear split feasibility problems
- Regularization method for the approximate split equality problem in infinite-dimensional Hilbert spaces
- An improved method for solving multiple-sets split feasibility problem
- Several acceleration schemes for solving the multiple-sets split feasibility problem
- Modified halfspace-relaxation projection methods for solving the split feasibility problem
- Strong convergence theorems for a nonexpansive mapping and its applications for solving the split feasibility problem
- Relaxed inertial accelerated algorithms for solving split equality feasibility problem
- A simultaneous Bregman projection methods for solving mixed split equality problems and fixed point problems in \(p\)-uniformly convex and uniformly smooth Banach spaces
- The ball-relaxed CQ algorithms for the split feasibility problem
- An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
- An iterative viscosity approximation method for the split common fixed-point problem
- Weak and strong convergence theorems for the split common fixed point problem with demicontractive operators
- Strong convergence theorems for an implicit iterative algorithm for the split common fixed point problem
- scientific article; zbMATH DE number 7621497 (Why is no real title available?)
- A double projection algorithm with inertial effects for solving split feasibility problems and applications to image restoration
- The split feasibility problem with polynomials
- The selective projection method for convex feasibility and split feasibility problems
- The semi-algebraic split feasibility problem and its semi-definite relaxation
- Split feasibility and fixed point problems
- A self-adaptive projection-type method for nonlinear multiple-sets split feasibility problem
- New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem
- The relaxed inexact projection methods for the split feasibility problem
- A new relaxed method for the split feasibility problem in Hilbert spaces
- A moving ball projection algorithm for the split feasibility problem
- A novel relaxed method for the split feasibility problem in Hilbert spaces
- An efficient simultaneous method for the constrained multiple-sets split feasibility problem
- Modified inertial projection algorithm for multiple-sets split feasibility problems
- An improved random projection-type algorithm for solving multiple-sets split feasibility problems with application to medical radiotherapy
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- A new relaxed projection method for solving the split feasibility problem with multiple output sets
- Gradient projection method with a new step size for the split feasibility problem
- Convergence of direct methods for paramonotone variational inequalities
This page was built for publication: A new halfspace-relaxation projection method for the split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2472374)
