On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces (Q288232)

From MaRDI portal
Revision as of 13:30, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
scientific article

    Statements

    On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 May 2016
    0 references
    alternating projections
    0 references
    convex feasibility problem
    0 references
    convex set
    0 references
    Douglas-Rachford algorithm
    0 references
    epigraph
    0 references
    finite convergence
    0 references
    method of reflection-projection
    0 references
    monotone operator
    0 references
    partial inverse
    0 references
    polyhedral set
    0 references
    projector
    0 references
    Slater's condition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers