New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses (Q2789608): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Yair Censor / rank
Normal rank
 
Property / author
 
Property / author: Yair Censor / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: UNLocBoX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2267827750 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1512.00409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block-iterative projection methods for parallel computation of solutions to convex feasibility problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results on Douglas-Rachford methods for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of a non-convex Douglas-Rachford iteration / 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: Finding best approximation pairs relative to two closed convex sets in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space / 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: Compositions and convex combinations of asymptotically regular firmly nonexpansive mappings are also asymptotically regular / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and strong convergence of algorithms involving averaged nonexpansive operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the local convergence of the Douglas-Rachford algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The composition of projections onto closed convex sets in Hilbert space is asymptotically regular / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Douglas–Rachford Algorithm in the Absence of Convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cyclic Douglas-Rachford iteration scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the behavior of a block-iterative projection method for solving convex feasibility problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative methods for fixed point problems in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Diagonally Relaxed Orthogonal Projection Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the string averaging method for sparse common fixed‐point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence and perturbation resilience of dynamic string-averaging projection methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Splitting Methods in Signal Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving monotone inclusions via compositions of nonexpansive averaged operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Weak Convergence of the Douglas–Rachford Method / rank
 
Normal rank

Latest revision as of 12:17, 11 July 2024

scientific article
Language Label Description Also known as
English
New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses
scientific article

    Statements

    New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses (English)
    0 references
    0 references
    0 references
    2 March 2016
    0 references
    algorithmic structures
    0 references
    convex feasibility problem
    0 references
    string-averaging
    0 references
    block-iterative
    0 references
    firmly nonexpansive
    0 references
    quasi-nonexpansive
    0 references
    strictly Fejér monotone
    0 references
    Douglas-Rachford
    0 references
    strong convergence
    0 references
    m-set-Douglas-Rachford operator
    0 references
    0 references

    Identifiers