On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections (Q2228383)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections
scientific article

    Statements

    On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 February 2021
    0 references
    The authors provide sufficient conditions for a rapid convergence of Dykstra's algorithm which finds the projection onto the intersection of two closed convex subsets in a Hilbert space. The behaviour of Dykstra's algorithm is verified on a set of a line and a square. The authors show that Dykstra's algorithm may stall for an arbitrarily long time. Finally, they present some open problems.
    0 references
    convex set
    0 references
    Dykstra's algorithm
    0 references
    method of alternating projections
    0 references
    projection
    0 references

    Identifiers