An Iterative Procedure for Obtaining $I$-Projections onto the Intersection of Convex Sets

  • Dykstra R
N/ACitations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

A frequently occurring problem is to find a probability distribution lying within a set E which minimizes the I-divergence between it and a given distribution R. This is referred to as the I-projection of R onto E. Csiszar (1975) has shown that when E = âˆ{\copyright}t 1 Ei is a finite intersection of closed, linear sets, a cyclic, iterative procedure which projects onto the individual Ei must converge to the desired I-projection on E, provided the sample space is finite. Here we propose an iterative procedure, which requires only that the Ei be convex (and not necessarily linear), which under general conditions will converge to the desired I-projection of R onto âˆ{\copyright}t 1 Ei.

Cite

CITATION STYLE

APA

Dykstra, R. L. (2007). An Iterative Procedure for Obtaining $I$-Projections onto the Intersection of Convex Sets. The Annals of Probability, 13(3). https://doi.org/10.1214/aop/1176992918

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free