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

01/19/2020
by   Heinz H. Bauschke, et al.
0

A popular method for finding the projection onto the intersection of two closed convex subsets in Hilbert space is Dykstra's algorithm. In this paper, we provide sufficient conditions for Dykstra's algorithm to converge rapidly, in finitely many steps. We also analyze the behaviour of Dykstra's algorithm applied to a line and a square. This case study reveals stark similarities to the method of alternating projections. Moreover, we show that Dykstra's algorithm may stall for an arbitrarily long time. Finally, we present some open problems.

READ FULL TEXT
research
04/05/2021

Alternating projections with applications to Gerchberg-Saxton error reduction

We consider convergence of alternating projections between non-convex se...
research
06/06/2021

Method of Alternating Projection for the Absolute Value Equation

A novel approach for solving the general absolute value equation Ax+B|x|...
research
02/12/2018

Convergence Analysis of Alternating Nonconvex Projections

We consider the convergence properties for alternating projection algori...
research
03/23/2020

Fast Alternating Projections on Manifolds Based on Tangent Spaces

In this paper, we study alternating projections on nontangential manifol...
research
08/09/2021

The projection onto the cross

We consider the set of pairs of orthogonal vectors in Hilbert space, whi...
research
03/12/2019

Linear Encodings for Polytope Containment Problems

The polytope containment problem is deciding whether a polytope is a con...

Please sign up or login with your details

Forgot password? Click here to reset