Non-optimality of the Greedy Algorithm for subspace orderings in the method of alternating projections
The method of alternating projections involves projecting an element of a Hilbert space cyclically onto a collection of closed subspaces. It is known that the resulting sequence always converges in norm and that one can obtain estimates for the rate of convergence in terms of quantities describing t...
| Автори: | , , , , , |
|---|---|
| Формат: | Journal article |
| Опубліковано: |
Springer Verlag
2017
|