A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications (Q2313782)

From MaRDI portal
Revision as of 02:23, 15 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128133839, #quickstatements; #temporary_batch_1726362513169)
scientific article
Language Label Description Also known as
English
A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
scientific article

    Statements

    A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications (English)
    0 references
    0 references
    0 references
    0 references
    23 July 2019
    0 references
    split feasibility problem
    0 references
    CQ algorithm
    0 references
    inertial technique
    0 references
    self-adaptive algorithm
    0 references
    weak convergence
    0 references
    strong convergence
    0 references
    Lasso problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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