A new halfspace-relaxation projection method for the split feasibility problem
From MaRDI portal
Publication:2472374
DOI10.1016/j.laa.2007.03.002zbMath1135.65022OpenAlexW1970239850MaRDI QIDQ2472374
Publication date: 21 February 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2007.03.002
Related Items
Hybrid CQ projection algorithm with line-search process for the split feasibility problem ⋮ Gradient projection method with a new step size for the split feasibility problem ⋮ A simultaneous iterative method for split equality problems of two finite ⋮ A new simultaneous iterative method with a parameter for solving the extended split equality problem and the extended split equality fixed point problem ⋮ An explicit algorithm for monotone variational inequalities ⋮ A double projection algorithm with inertial effects for solving split feasibility problems and applications to image restoration ⋮ A self-adaptive projection-type method for nonlinear multiple-sets split feasibility problem ⋮ Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces ⋮ Inertial accelerated algorithms for solving a split feasibility problem ⋮ On the computation of the step-size for the CQ-like algorithms for the split feasibility problem ⋮ Regularization method for the approximate split equality problem in infinite-dimensional Hilbert spaces ⋮ An improved method for solving multiple-sets split feasibility problem ⋮ On descent-projection method for solving the split feasibility problems ⋮ An Iterative Algorithm for Split Common Fixed-Point Problem for Demicontractive Mappings ⋮ New hybrid inertial CQ projection algorithms with line-search process for the 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 ⋮ The split feasibility problem and its solution algorithm ⋮ 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 ⋮ Full convergence of an approximate projection method for nonsmooth variational inequalities ⋮ Strong convergence theorems for an implicit iterative algorithm for the split common fixed point problem ⋮ The ball-relaxed CQ algorithms for the split feasibility problem ⋮ A simultaneous iteration algorithm for solving extended split equality fixed point problem ⋮ 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 ⋮ An efficient simultaneous method for the constrained multiple-sets split feasibility problem ⋮ Analysis on Newton projection method for the split feasibility problem ⋮ Convergence of direct methods for paramonotone variational inequalities ⋮ ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem ⋮ New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces ⋮ Mixed simultaneous iterative algorithms for the extended multiple-set split equality common fixed-point problem with Lipschitz quasi-pseudocontractive operators ⋮ 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 ⋮ 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 ⋮ Split Feasibility and Fixed Point Problems ⋮ General method for solving the split common fixed point problem ⋮ New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- A multiprojection algorithm using Bregman projections in a product space
- A class of projection and contraction methods for monotone variational inequalities
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- 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
- On Projection Algorithms for Solving Convex Feasibility Problems
- Modified Projection-Type Methods for Monotone Variational Inequalities
- The relaxed CQ algorithm solving the split feasibility problem
- Minimization of unsmooth functionals
- A note on the CQ algorithm for the split feasibility problem
