Abstract
Let {Ci| 1≤i≤m} be a finite family of closed convex subsets of Rn, and assume that their intersection C=⋂{Ci| 1≤i≤m} is not empty. In this paper we propose a general Dykstra-type sequential algorithm for finding the Bregman projection of a given point r∈Rn onto C and show that it converges in several important special cases.
| Original language | English |
|---|---|
| Pages (from-to) | 407-420 |
| Number of pages | 14 |
| Journal | Communications in Applied Analysis |
| Volume | 2 |
| Issue number | 3 |
| State | Published - 1998 |