Iterative Averaging of Entropic Projections for Solving Stochastic Convex Feasibility Problems

被引：0
|
作者：
Dan Butnariu
Yair Censor
Simeon Reich
机构：
[1] University of Haifa,Department of Mathematics and Computer Science
[2] The Technion–Israel Institute of Technology,Department of Mathematics
来源：
Computational Optimization and Applications | 1997年 / 8卷
关键词：
stochastic convex feasibility problem; Bregman projection; entropic projection; modulus of local convexity; very convex function;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The problem considered in this paper is that of finding a point which iscommon to almost all the members of a measurable family of closed convexsubsets of R++n, provided that such a point exists.The main results show that this problem can be solved by an iterative methodessentially based on averaging at each step the Bregman projections withrespect to f(x)=∑i=1nxi· ln xi ofthe current iterate onto the given sets.
引用
收藏
页码：21 / 39
页数：18
相关论文
共 50 条
12345