Modified halfspace-relaxation projection methods for solving the split feasibility problem (Q447563): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q58698835, #quickstatements; #temporary_batch_1705502051474 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58698835 / rank | |||
Normal rank |
Revision as of 16:36, 17 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Modified halfspace-relaxation projection methods for solving the split feasibility problem |
scientific article |
Statements
Modified halfspace-relaxation projection methods for solving the split feasibility problem (English)
0 references
4 September 2012
0 references
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.
0 references