Dykstra's alternating projection algorithm for two sets

Bauschke, Heinz H. and Borwein, Jonathan M. (1994) Dykstra's alternating projection algorithm for two sets. J. Approx Theory, 79 . pp. 418-443.

Download (767Kb) | Preview


    We analyze Dykstra′s algorithm for two arbitrary closed convex sets in a Hilbert space. Our technique also applies to von Neumann′s algorithm. Various convergence results follow. An example allows one to compare qualitative and quantitative behaviour of the two algorithms. We discuss the case of finitely many sets.

    Item Type: Article
    Subjects: UNSPECIFIED
    Faculty: UNSPECIFIED
    Depositing User: Mrs Naghmana Tehseen
    Date Deposited: 14 Jan 2015 11:24
    Last Modified: 14 Jan 2015 11:24

    Actions (login required)

    View Item