The rate of linear convergence of the Douglas�Rachford algorithm for subspaces is the cosine of the Friedrichs angle
-
Autores: Heinz H. Bauschke
, J. Y. Bello Cruz, Tran T.A. Nghia, Hung M. Phan, Xianfu Wang
- Localización: Journal of approximation theory, ISSN 0021-9045, Vol. 185, Nº 1, 2014, págs. 63-79
- Idioma: inglés
- DOI: 10.1016/j.jat.2014.06.002
- Enlaces
-
Resumen
The Douglas�Rachford splitting algorithm is a classical optimization method that has found many applications. When specialized to two normal cone operators, it yields an algorithm for finding a point in the intersection of two convex sets. This method for solving feasibility problems has attracted a lot of attention due to its good performance even in nonconvex settings.
In this paper, we consider the Douglas�Rachford algorithm for finding a point in the intersection of two subspaces. We prove that the method converges strongly to the projection of the starting point onto the intersection. Moreover, if the sum of the two subspaces is closed, then the convergence is linear with the rate being the cosine of the Friedrichs angle between the subspaces. Our results improve upon existing results in three ways: First, we identify the location of the limit and thus reveal the method as a best approximation algorithm; second, we quantify the rate of convergence, and third, we carry out our analysis in general (possibly infinite-dimensional) Hilbert space. We also provide various examples as well as a comparison with the classical method of alternating projections.
