Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems (Q4846044): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the behavior of a block-iterative projection method for solving convex feasibility problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak and norm convergence of a parallel projection method in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel projection method based on sequential most remote set in convex feasibility problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong convergence of projection-like methods in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition through formalization in a product space / rank
 
Normal rank

Latest revision as of 15:27, 23 May 2024

scientific article; zbMATH DE number 788654
Language Label Description Also known as
English
Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems
scientific article; zbMATH DE number 788654

    Statements

    10 October 1996
    0 references
    convex feasibility problem
    0 references
    block-iterative projection method
    0 references
    parallel projection method with variable weights
    0 references
    one variable relaxation coefficient
    0 references
    intersection of a finite number of closed convex sets in a given Hilbert space
    0 references
    semi-alternating sequential projection method
    0 references
    0 references
    Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references