Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces

DOI10.1007/s11590-013-0619-4zbMath1320.90103OpenAlexW2002418833MaRDI QIDQ2448177

Qiao-Li Dong, Songnian He, Yonghong Yao

Publication date: 30 April 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-013-0619-4

zbMATH Keywords

projection methodsplit feasibility problemCQ methodinverse strongly monotonerelaxed projection methods

Mathematics Subject Classification ID

Programming in abstract spaces (90C48)

Related Items

Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis ⋮ An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces ⋮ Linear approximation method for solving split inverse problems and its applications ⋮ Note on the modified relaxation CQ algorithm for the split feasibility problem ⋮ A new iterative method with alternated inertia for the split feasibility problem ⋮ An alternated inertial general splitting method with linearization for the split feasibility problem ⋮ General splitting methods with linearization for the split feasibility problem ⋮ ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem ⋮ Several iterative algorithms for solving the split common fixed point problem of directed operators with applications ⋮ Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces ⋮ Iterative methods for solving the split common fixed point problem of demicontractive mappings in Hilbert spaces ⋮ Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization ⋮ Two projection algorithms for a class of split feasibility problems with jointly constrained Nash equilibrium models ⋮ The strong convergence of Douglas-Rachford methods for the split feasibility problem ⋮ New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cyclic algorithms for split feasibility problems in Hilbert spaces
• The relaxed inexact projection methods for the split feasibility problem
• Implicit and explicit algorithms for solving the split feasibility problem
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• A multiprojection algorithm using Bregman projections in a product space
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
• Two-Metric Projection Methods for Constrained Optimization
• The multiple-sets split feasibility problem and its applications for inverse problems
• Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
• 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
• The relaxed CQ algorithm solving the split feasibility problem
• A note on the CQ algorithm for the split feasibility problem
• Weak and strong convergence theorems for fixed points of asymptotically nonexpansive mappings