Finding projections onto the intersection of convex sets in hilbert spaces (Q4845181): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Image recovery by convex combinations of projections / 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: Relaxed outer projections, weighted averages and convex feasibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cyclic projection algorithm via duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A successive projection method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5631335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of Han's method for convex programming with quadratic objective / rank
 
Normal rank

Latest revision as of 16:06, 23 May 2024

scientific article; zbMATH DE number 792669
Language Label Description Also known as
English
Finding projections onto the intersection of convex sets in hilbert spaces
scientific article; zbMATH DE number 792669

    Statements

    Finding projections onto the intersection of convex sets in hilbert spaces (English)
    0 references
    4 September 1995
    0 references
    parallel iterative method
    0 references
    shortest distance projection
    0 references
    closed convex sets in a real Hilbert space
    0 references
    weights
    0 references
    relaxation coefficient
    0 references
    0 references

    Identifiers

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