On the finite termination of the Douglas-Rachford method for the convex feasibility problem (Q2836088): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Convex analysis and monotone operator theory in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite steps algorithm for solving convex feasibility problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting Algorithms for the Sum of Two Nonlinear Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Weak Convergence of the Douglas–Rachford Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Demiclosedness Principles for (Firmly) Nonexpansive Operators / 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: On the convergence of von Neumann's alternating projection algorithm for two sets / 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: On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rate of convergence of Krasnosel'skiĭ-Mann iterations and their connection with sums of Bernoullis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflection-projection method for convex feasibility problems with an obtuse cone / 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: The convexity of \(A\) and \(B\) assures \(\text{int} A + B = \text{int}(A + B)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated reflection projection algorithm and its application to the LMI problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Error Bounds for Convex Conic Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds for eigenvalue and semidefinite matrix inequality systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Matrix Inequalities in System and Control Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds for Linear Matrix Inequalities / rank
 
Normal rank

Latest revision as of 02:20, 13 July 2024

scientific article
Language Label Description Also known as
English
On the finite termination of the Douglas-Rachford method for the convex feasibility problem
scientific article

    Statements

    On the finite termination of the Douglas-Rachford method for the convex feasibility problem (English)
    0 references
    0 references
    0 references
    0 references
    7 December 2016
    0 references
    Douglas-Rachford method
    0 references
    convex feasibility problem
    0 references
    finite termination
    0 references
    Slater condition
    0 references
    metric projection
    0 references
    nonexpansive
    0 references
    error bound
    0 references
    conic feasibility problem
    0 references
    semidefinite feasibility problem
    0 references

    Identifiers

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