The Dykstra algorithm with Bregman projections

Yair Censor, Simeon Reich

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)407-420
Number of pages14
JournalCommunications in Applied Analysis
Issue number3
StatePublished - 1998


Dive into the research topics of 'The Dykstra algorithm with Bregman projections'. Together they form a unique fingerprint.

Cite this