Proceedings of the Indian Academy of Sciences - Mathematical Sciences

, Volume 106, Issue 3, pp 289–300

Distributed computation of fixed points of ∞-nonexpansive maps

Authors

  • Vivek S Borkar
    • Department of Computer Science and AutomationIndian Institute of Science
Article

DOI: 10.1007/BF02867437

Cite this article as:
Borkar, V.S. Proc. Indian Acad. Sci. (Math. Sci.) (1996) 106: 289. doi:10.1007/BF02867437

Abstract

The distributed implementation of an algorithm for computing fixed points of an ∞-nonexpansive map is shown to converge to the set of fixed points under very general conditions.

Keywords

Distributed algorithmfixed point computation∞-nonexpansive maptapering stepsizecontrolled Markov chains

Copyright information

© Indian Academy of Sciences 1996