The split feasibility problem and its solution algorithm
type: Item
instance of: scholarly article
title: The split feasibility problem and its solution algorithm
zbMATH Open document ID: 1427.90221
DOI: 10.1155/2018/4123168
author: Biao Qu
author: Binghua Liu
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: The split feasibility problem arises in many fields in the real world, such as signal processing, image reconstruction, and medical care. In this paper, we present a solution algorithm called memory gradient projection method for solving the split feasibility problem, which employs a parameter and two previous iterations to get the next iteration, and its step size can be calculated directly. It not only improves the flexibility of the algorithm, but also avoids computing the largest eigenvalue of the related matrix or estimating the Lipschitz constant in each iteration. Theoretical convergence results are established under some suitable conditions.
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65F99
zbMATH DE Number: 7018915
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/4123168
OpenAlex ID: W2783623994
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: A unified treatment of some iterative algorithms in signal processing and image reconstruction
cites work: Iterative oblique projection onto convex sets and the split feasibility problem
cites work: On Projection Algorithms for Solving Convex Feasibility Problems
cites work: The strong convergence of a three-step algorithm for the split feasibility problem
cites work: Solving the split feasibility problem without prior knowledge of matrix norms
cites work: Convergence theorems for inertial KM-type algorithms
cites work: A note on the CQ algorithm for the split feasibility problem
cites work: A new halfspace-relaxation projection method for the split feasibility problem
cites work: On the computation of the step-size for the CQ-like algorithms for the split feasibility problem
cites work: Analysis on Newton projection method for the split feasibility problem
cites work: The relaxed CQ algorithm solving the split feasibility problem
cites work: Q4767830
cites work: Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
cites work: Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization
cites work: Convergence of the gradient projection method for generalized convex minimization
cites work: Q5638112
cites work: Q4830373
cites work: Q4821526
cites work: The multiple-sets split feasibility problem and its applications for inverse problems
description: scientific article; zbMATH DE number 7018915