The ball-relaxed gradient-projection algorithm for split feasibility problem (Q2138186): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1727129
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Xiao-Xiao Liu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2022/9991466 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4223576731 / 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: Iterative oblique projection onto convex sets and the split feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified treatment of some iterative algorithms in signal processing and image reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong convergence of two algorithms for the split feasibility problem in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem / 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: Extra-gradient methods for solving split feasibility and fixed point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the split feasibility problem without prior knowledge of matrix norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ball-relaxed CQ algorithms for the split feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and monotone operator theory in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Averaged mappings and the gradient-projection algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: New inertial relaxed method for solving split feasibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong convergence result for proximal split feasibility problem in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative approximation of solutions for proximal split feasibility problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence analysis for proximal split feasibility problems and fixed point problems / rank
 
Normal rank

Latest revision as of 22:41, 28 July 2024

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
    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
    0 references