Abstract
This paper develops an algorithmic framework for tracking fixed points of time-varying contraction mappings. Analytical results for the tracking error are established for the cases where: (i) the underlying contraction self-map changes at each step of the algorithm; (ii) only an imperfect information of the map is available; and, (iii) the algorithm is implemented in a distributed fashion, with communication delays and packet drops leading to asynchronous algorithmic updates. The analytical results are applicable to several classes of problems, including time-varying contraction mappings emerging from online and asynchronous implementations of gradient-based methods for time-varying convex programs. In this domain, the proposed framework can also capture the operating principles of feedback-based online algorithms, where the online gradient steps are suitably modified to accommodate actionable feedback from an underlying physical or logical network. Examples of applications and illustrative numerical results are provided.
Original language | American English |
---|---|
Pages | 3236-3243 |
Number of pages | 8 |
DOIs | |
State | Published - 2 Jul 2018 |
Event | 57th IEEE Conference on Decision and Control, CDC 2018 - Miami, United States Duration: 17 Dec 2018 → 19 Dec 2018 |
Conference
Conference | 57th IEEE Conference on Decision and Control, CDC 2018 |
---|---|
Country/Territory | United States |
City | Miami |
Period | 17/12/18 → 19/12/18 |
Bibliographical note
See NREL/CP-5D00-73422 for preprintNREL Publication Number
- NREL/CP-5D00-73480
Keywords
- asynchronous
- distributed
- fixed points
- time-varying contraction
- tracking