Polyak's gradient method for split feasibility problem constrained by level sets (Q2413285): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11075-017-0347-4 / rank
Normal rank
 
Property / author
 
Property / author: Feng Hui Wang / rank
Normal rank
 
Property / author
 
Property / author: Feng Hui Wang / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SPGL1 / 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.1007/s11075-017-0347-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2614766129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Projection Algorithms for Solving Convex Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly convergent algorithm for the split common fixed point problem / 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: A multiprojection algorithm using Bregman projections in a product space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity Maps for Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbertian convex feasibility problem: Convergence of projection methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signal Recovery by Proximal Forward-Backward Splitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated projected gradient method for linear inverse problems with sparsity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5341223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed projection method for variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of projections for finding the common point of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5518786 / 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: On split common fixed point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of unsmooth functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative regularization method for the solution of the split feasibility problem in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Image and Signal Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probing the Pareto Frontier for Basis Pursuit Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rings of operators. Reduction theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of CQ algorithm with variable steps for the split equality problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Algorithms for Nonlinear Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem / 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: Properties and iterative methods for the lasso and its variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relaxed CQ algorithm solving the split feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On variable-step relaxed projection algorithm for variational inequalities / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11075-017-0347-4 / rank
 
Normal rank

Latest revision as of 12:05, 18 December 2024

scientific article
Language Label Description Also known as
English
Polyak's gradient method for split feasibility problem constrained by level sets
scientific article

    Statements

    Polyak's gradient method for split feasibility problem constrained by level sets (English)
    0 references
    10 April 2018
    0 references
    split feasibility problem
    0 references
    projection algorithms
    0 references
    CQ algorithm
    0 references
    level sets
    0 references
    0 references
    0 references
    0 references

    Identifiers

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