Back to Search Start Over

Optimal Rates of Linear Convergence of Relaxed Alternating Projections and Generalized Douglas-Rachford Methods for Two Subspaces.

Authors :
Bauschke, Heinz
Bello Cruz, J.
Nghia, Tran
Pha, Hung
Wang, Xianfu
Source :
Numerical Algorithms. Sep2016, Vol. 73 Issue 1, p33-76. 44p.
Publication Year :
2016

Abstract

We systematically study the optimal linear convergence rates for several relaxed alternating projection methods and the generalized Douglas-Rachford splitting methods for finding the projection on the intersection of two subspaces. Our analysis is based on a study on the linear convergence rates of the powers of matrices. We show that the optimal linear convergence rate of powers of matrices is attained if and only if all subdominant eigenvalues of the matrix are semisimple. For the convenience of computation, a nonlinear approach to the partially relaxed alternating projection method with at least the same optimal convergence rate is also provided. Numerical experiments validate our convergence analysis [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
10171398
Volume :
73
Issue :
1
Database :
Academic Search Index
Journal :
Numerical Algorithms
Publication Type :
Academic Journal
Accession number :
117604519
Full Text :
https://doi.org/10.1007/s11075-015-0085-4