The ball-relaxed gradient-projection algorithm for split feasibility problem (Q2138186)

From MaRDI portal
Revision as of 09:41, 29 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1727129)
scientific article
Language Label Description Also known as
English
The ball-relaxed gradient-projection algorithm for split feasibility problem
scientific article

    Statements

    The ball-relaxed gradient-projection algorithm for split feasibility problem (English)
    0 references
    0 references
    0 references
    11 May 2022
    0 references
    Summary: In this paper, we concern with the split feasibility problem (SFP) whenever the convex sets involved are composed of level sets. By applying gradient-projection algorithm which is used to solve constrained convex minimization problem of a real valued convex function, we construct two new algorithms for the split feasibility problem and prove that both of them are convergent weakly to a solution of the feasibility problem. In the end, as an application, we obtain a new algorithm for solving the split equality problem.
    0 references
    gradient-projection algorithm
    0 references
    split feasibility problem: weak convergence
    0 references

    Identifiers

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