• Distributed computation of fixed points of ∞-nonexpansive maps

    • Fulltext


        Click here to view fulltext PDF

      Permanent link:

    • Keywords


      Distributed algorithm; fixed point computation; ∞-nonexpansive map; tapering stepsize; controlled Markov chains

    • 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.

    • Author Affiliations


      Vivek S Borkar1

      1. Department of Computer Science and Automation, Indian Institute of Science, Bangalore - 560 012, India
    • Dates

  • Proceedings – Mathematical Sciences | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2021-2022 Indian Academy of Sciences, Bengaluru.