Modified halfspace-relaxation projection methods for solving the split feasibility problem
type: Item
instance of: scholarly article
title: Modified halfspace-relaxation projection methods for solving the split feasibility problem
zbMATH Open document ID: 1246.65071
DOI: 10.1155/2012/483479
author: Min Li
published in: Advances in Operations Research
publication date: 2012-09-04T00:00:00Z
review text: Summary: This paper presents modified halfspace-relaxation projection (HRP) methods for solving the split feasibility problem (SFP). Incorporating with the techniques of identifying the optimal step length with positive lower bounds, the new methods improve the efficiencies of the HRP method [\textit{B. Qu} and \textit{N. Xiu}, Linear Algebra Appl. 428, No. 5--6, 1218--1229 (2008; Zbl 1135.65022)]. Some numerical results are reported to verify the computational preference.
Mathematics Subject Classification ID: 65F30
zbMATH DE Number: 6076656
Wikidata QID: Q58698835
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2012/483479
OpenAlex ID: W2164701766
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: A new halfspace-relaxation projection method for the split feasibility problem
cites work: A relaxed projection method for variational inequalities
cites work: A note on the CQ algorithm for the split feasibility problem
cites work: The relaxed CQ algorithm solving the split feasibility problem
cites work: A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
cites work: Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
cites work: Q4110807
cites work: Comparison of two kinds of prediction-correction methods for monotone variational inequalities
cites work: On the basic theorem of complementarity
cites work: Convex Analysis
cites work: Minimization of unsmooth functionals
cites work: The multiple-sets split feasibility problem and its applications for inverse problems
cites work: A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
cites work: A self-adaptive projection method for solving the multiple-sets split feasibility problem
DBLP publication ID: journals/advor/Li12
description: scientific article; zbMATH DE number 6076656