Distributed computation of fixed points of infinity-nonexpansive maps

被引:4
作者
Borkar, VS [1 ]
机构
[1] INDIAN INST SCI,DEPT COMP SCI & AUTOMAT,BANGALORE 560012,KARNATAKA,INDIA
来源
PROCEEDINGS OF THE INDIAN ACADEMY OF SCIENCES-MATHEMATICAL SCIENCES | 1996年 / 106卷 / 03期
关键词
distributed algorithm; fixed point computation; infinity-nonexpansive map; tapering stepsize; controlled Markov chains;
D O I
10.1007/BF02867437
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The distributed implementation of an algorithm for computing fixed points of an infinity-nonexpansive map is shown to converge to the set of fixed points under very general conditions.
引用
收藏
页码:289 / 300
页数:12
相关论文
共 5 条
[1]  
Bertsekas Dimitri P., 1989, PARALLEL DISTRIBUTED
[2]   MANAGING INTERPROCESSOR DELAYS IN DISTRIBUTED RECURSIVE ALGORITHMS [J].
BORKAR, VS ;
PHANSALKAR, VV .
SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 1994, 19 :995-1003
[3]  
BORKAR VS, 1993, NEW ANALOG PARALLEL
[4]   CONVERGENT ACTIVATION DYNAMICS IN CONTINUOUS-TIME NETWORKS [J].
HIRSCH, MW .
NEURAL NETWORKS, 1989, 2 (05) :331-349
[5]  
Neveu J., 1975, Discrete Parameter Martingales