The problem of split convex feasibility and its alternating approximation algorithms (Q272506): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Iterative oblique projection onto convex sets and the split feasibility problem / 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: Moudafi's open question and simultaneous iterative algorithm for general split equality variational inclusion problems and general split equality optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed alternating CQ-algorithm for convex feasibility problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5419228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On split common fixed point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relaxed CQ algorithm solving the split feasibility problem / rank
 
Normal rank

Latest revision as of 20:32, 11 July 2024

scientific article
Language Label Description Also known as
English
The problem of split convex feasibility and its alternating approximation algorithms
scientific article

    Statements

    Identifiers

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