scientific article; zbMATH DE number 7333659

zbMath1461.65166MaRDI QIDQ5858976

Prasit Cholamjiak, Suparat Kesornprom, Nattawut Pholasa

Publication date: 15 April 2021

Full work available at URL: http://thaijmath.in.cmu.ac.th/index.php/thaijmath/article/view/3108

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hilbert spacefixed point problemweak and strong convergencemultiple-sets split feasibility problemrelaxed CQ algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Programming in abstract spaces (90C48)

Related Items (7)

A new approximation scheme for solving various split inverse problems ⋮ Ball-relaxed projection algorithms for multiple-sets split feasibility problem ⋮ Modified inertial algorithms for inclusion problems with numerical experiments and application to image restoration ⋮ Unnamed Item ⋮ An inertial extrapolation method for multiple-set split feasibility problem ⋮ The zeros of monotone operators for the variational inclusion problem in Hilbert spaces ⋮ Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets

Cites Work

• Unnamed Item
• Unnamed Item
• Strong convergence of a self-adaptive method for the split feasibility problem in Banach spaces
• Approximation methods for common fixed points of nonexpansive mappings in Hilbert spaces
• Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
• A multiprojection algorithm using Bregman projections in a product space
• An inertial forward-backward splitting method for solving inclusion problems in Hilbert spaces
• Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
• Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
• A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
• 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
• Self-adaptive projection methods for the multiple-sets 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 variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• Convergence of iterative schemes for solving fixed point problems for multi-valued nonself mappings and equilibrium problems
• A self-adaptive projection method for solving the multiple-sets split feasibility problem
• 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
• Modified Hybrid Steepest Method for the Split Feasibility Problem in Image Recovery of Inverse Problems
• Nonlinear iterative methods for solving the split common null point problem in Banach spaces

This page was built for publication: