The split feasibility problem and its solution algorithm

DOI10.1155/2018/4123168MaRDI QIDQ1720866zbMATH OpenOpenAlexFDO

Authors Biao Qu, Binghua Liu

Publication date 8 February 2019

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2018/4123168

Mathematics Subject Classification ID

Numerical linear algebra (65F99) Numerical mathematical programming methods (65K05) Convex programming (90C25)

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.

Recommendations

• Projection algorithm for split feasibility problem
• A new iterative method for the split feasibility problem
• A modified algorithm for solving the split feasibility problem
• A projection method for solving the sparsity split feasibility problem
• On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem

Cites work

• A multiprojection algorithm using Bregman projections in a product space
• A new halfspace-relaxation projection method for the split feasibility problem
• A note on the CQ algorithm for the split feasibility problem
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Analysis on Newton projection method for the split feasibility problem
• Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization
• Convergence of the gradient projection method for generalized convex minimization
• Convergence theorems for inertial KM-type algorithms
• scientific article; zbMATH DE number 3441150 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 2121575 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• Iterative oblique projection onto convex sets and the split feasibility problem
• Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• On the computation of the step-size for the CQ-like algorithms for the split feasibility problem
• Solving the split feasibility problem without prior knowledge of matrix norms
• The multiple-sets split feasibility problem and its applications for inverse problems
• The relaxed CQ algorithm solving the split feasibility problem
• The strong convergence of a three-step algorithm for the split feasibility problem

Cited in

(19)

• An MM Algorithm for Split Feasibility Problems
• Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
• A Levenberg-Marquardt method for solving the tensor split feasibility problem
• Solving the market split problem via branch-and-cut
• Optimization for Inconsistent Split Feasibility Problems
• Projection algorithm for split feasibility problem
• A gradient algorithm for finding minimum-norm solution of the split feasibility problem
• scientific article; zbMATH DE number 4218375 (Why is no real title available?)
• A modified algorithm for solving the split feasibility problem
• An unconstrained optimization approach to the split feasibility problem
• scientific article; zbMATH DE number 954657 (Why is no real title available?)
• A Strong Convergence Theorem for Solving the Split Equality Fixed Point Problem
• scientific article; zbMATH DE number 7598016 (Why is no real title available?)
• A projection method for solving the sparsity split feasibility problem
• scientific article; zbMATH DE number 6285844 (Why is no real title available?)
• Two inertial-type algorithms for solving the split feasibility problem
• On a robust approach to ``split feasibility problems: solvability and global error bound conditions
• Stability analysis of split equality and split feasibility problems
• Effective branching splitting method under cost constraint

This page was built for publication: The split feasibility problem and its solution algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1720866)