A new CQ algorithm for solving split feasibility problems in Hilbert spaces

DOI10.1007/s40840-018-0614-0OpenAlexW2791227280MaRDI QIDQ2272641

Suthep Suantai, Prasit Cholamjiak, Nguyen The Vinh

Publication date: 20 September 2019

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-018-0614-0

zbMATH Keywords

strong convergenceweak convergencevariational inequalityminimum-norm solutionsplit feasibility problemgradient projection method

Mathematics Subject Classification ID

Convex programming (90C25) Fixed-point theorems (47H10)

Related Items

A new approximation scheme for solving various split inverse problems ⋮ An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces ⋮ An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem ⋮ An inertial self-adaptive algorithm for the generalized split common null point problem in Hilbert spaces ⋮ New Self-Adaptive Algorithms and Inertial Self-Adaptive Algorithms for the Split Variational Inclusion Problems in Hilbert Space ⋮ Relaxed successive projection algorithm with strong convergence for the multiple-sets split equality problem ⋮ Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators ⋮ An intermixed method for solving the combination of mixed variational inequality problems and fixed-point problems ⋮ Self-adaptive algorithms for solving split feasibility problem with multiple output sets ⋮ Inertial self-adaptive parallel extragradient-type method for common solution of variational inequality problems ⋮ New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem ⋮ A novel projection method for split feasibility problems with applications to compressive sensing ⋮ An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net ⋮ Generalized Halpern iteration with new control conditions and its application ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Solving the split feasibility problem and the fixed point problem of left Bregman firmly nonexpansive mappings via the dynamical step sizes in Banach spaces ⋮ New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces ⋮ Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Strong convergence of alternated inertial \(CQ\) relaxed method with application in signal recovery ⋮ Split common fixed point problems for demicontractive operators ⋮ An inertial triple-projection algorithm for solving the split feasibility problem

Cites Work

• Unnamed Item
• Solving the variational inequality problem defined on intersection of finite level sets
• Strong convergence theorems for the split variational inclusion problem in Hilbert spaces
• Regularized methods for the split feasibility problem
• Cyclic algorithms for split feasibility problems in Hilbert spaces
• An extragradient method for solving split feasibility and fixed point problems
• Implicit and explicit algorithms for solving the split feasibility problem
• Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
• Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
• A multiprojection algorithm using Bregman projections in a product space
• Iterative methods for finding the minimum-norm solution of the standard monotone variational inequality problems with applications in Hilbert spaces
• Inertial accelerated algorithms for solving a split feasibility problem
• The regularized CQ algorithm without \textit{a priori} knowledge of operator norm for solving the split feasibility problem
• Polyak's gradient method for split feasibility problem constrained by level sets
• 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
• Iterative Algorithms for Nonlinear Operators
• Solving the split feasibility problem without prior knowledge of matrix norms
• The multiple-sets split feasibility problem and its applications for inverse problems
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• The relaxed CQ algorithm solving the split feasibility problem
• Split Feasibility and Fixed Point Problems
• A note on the CQ algorithm for the split feasibility problem

This page was built for publication: A new CQ algorithm for solving split feasibility problems in Hilbert spaces