A relaxed projection method using a new linesearch for the split feasibility problem

DOI10.3934/math.2021163OpenAlexW3120299564MaRDI QIDQ2146639

Nattawut Pholasa, Yeol Je Cho, Prasit Cholamjiak, Suparat Kesornprom, Suthep Suantai

Publication date: 17 June 2022

Published in: AIMS Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/math.2021163

zbMATH Keywords

signal recoveryHilbert spacesplit feasibility problemlinesearch\(CQ\)-algorithm

Mathematics Subject Classification ID

Fixed-point theorems (47H10) Fixed-point and coincidence theorems (topological aspects) (54H25)

Related Items

A double projection algorithm with inertial effects for solving split feasibility problems and applications to image restoration ⋮ Novel forward-backward algorithms for optimization and applications to compressive sensing and image inpainting ⋮ A self-adaptive relaxed primal-dual iterative algorithm for solving the split feasibility and the fixed point problem

Cites Work

• Unnamed Item
• A Berry-Esseen type bound for the kernel density estimator based on a weakly dependent and randomly left truncated data
• ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
• New trends in general variational inequalities
• Perturbation techniques for nonexpansive mappings with applications
• A multiprojection algorithm using Bregman projections in a product space
• On solving proximal split feasibility problems and applications
• Some developments in general variational inequalities
• Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization
• Inertial accelerated algorithms for solving a split feasibility problem
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Solving the split feasibility problem without prior knowledge of matrix norms
• The multiple-sets split feasibility problem and its applications for inverse problems
• 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
• The relaxed CQ algorithm solving the split feasibility problem
• A note on the CQ algorithm for the split feasibility problem
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: A relaxed projection method using a new linesearch for the split feasibility problem