Modified halfspace-relaxation projection methods for solving the split feasibility problem (Q447563): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2012/483479 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2164701766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiprojection algorithm using Bregman projections in a product space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new halfspace-relaxation projection method for the split feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed projection method for variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the <i>CQ</i> algorithm for the split feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relaxed CQ algorithm solving the split feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modification of the extra-gradient method for solving variational inequalities and certain optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4110807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of two kinds of prediction-correction methods for monotone variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the basic theorem of complementarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of unsmooth functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiple-sets split feasibility problem and its applications for inverse problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-adaptive projection method for solving the multiple-sets split feasibility problem / rank
 
Normal rank

Latest revision as of 15:09, 5 July 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
    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

    Identifiers