Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters (Q4351445): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Block-iterative projection methods for parallel computation of solutions to convex feasibility problems / rank
 
Normal rank
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: Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of projections for finding the common point of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence results for an accelerated nonlinear Cimmino algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition through formalization in a product space / rank
 
Normal rank

Latest revision as of 18:24, 27 May 2024

scientific article; zbMATH DE number 1053398
Language Label Description Also known as
English
Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters
scientific article; zbMATH DE number 1053398

    Statements

    Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters (English)
    0 references
    16 December 1997
    0 references
    0 references
    parallel projection method
    0 references
    convex feasibility problem
    0 references
    successive approximation
    0 references
    block-iterative projection method
    0 references
    Hilbert space
    0 references
    0 references
    0 references