Distributed computation of fixed points of infinity-nonexpansive maps

Borkar, VS (1996) Distributed computation of fixed points of infinity-nonexpansive maps. In: Proceedings of the Indian Academy of Sciences - Mathematical Sciences, 106 (3). pp. 289-300.

Preview

PDF Distributed_computation.pdf - Published Version Download (507kB)

Abstract

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.

Item Type:	Journal Article
Publication:	Proceedings of the Indian Academy of Sciences - Mathematical Sciences
Publisher:	Indian academy of sciences
Additional Information:	Copyright of this article belongs to Indian Academy of Sciences.
Keywords:	Distributed algorithm;fixed point computation; oo-nonexpansive map;tapering stepsize;controlled Markov chains.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	05 May 2011 04:53
Last Modified:	27 Feb 2019 10:25
URI:	http://eprints.iisc.ac.in/id/eprint/37115

Actions (login required)

View Item