Distributed computation of fixed points of ∞-nonexpansive maps

  • Vivek S Borkar
Article

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 algorithm fixed point computation ∞-nonexpansive map tapering stepsize controlled Markov chains 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Bertsekas D P and Tsitsiklis J N,Parallel and distributed computation (Prentice Hall, Englewood Cliffs) (1989)MATHGoogle Scholar
  2. [2]
    Borkar V S, Topics in Controlled Markov Chains, Pitman Research Notes in Maths, No. 240, Longman Scientific and Technical, Harlow (1991)MATHGoogle Scholar
  3. [3]
    Borkar V S and Phansalkar V V, Managing interprocessor delays in distributed recursive algorithms,Sadhana 19 (1994) 995–1003MATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    Borkar V S and Soumyanath K, A new analog parallel scheme for fixed point computation, Part I: Theory, preprint (1993)Google Scholar
  5. [5]
    Hirsch M W, Convergent activation dynamics in continuous time networks,Neural Networks 2 (1987) 331–349CrossRefGoogle Scholar
  6. [6]
    Neveu J,Discrete Parameter Martingales (North Holland: Amsterdam) (1975)MATHGoogle Scholar

Copyright information

© Indian Academy of Sciences 1996

Authors and Affiliations

  • Vivek S Borkar
    • 1
  1. 1.Department of Computer Science and AutomationIndian Institute of ScienceBangaloreIndia

Personalised recommendations