Skip to Main content Skip to Navigation
Conference papers

Lyapunov Analysis of a Distributed Optimization Scheme

Abstract : We analyze the convergence of the distributed multi-agent optimization scheme originally proposed in [1]. In this scheme, a number of agents cooperate to estimate the minimum of the sum of their locally-known cost functions. We consider a special case for which the collective cost function is strongly convex and where the agent communication graph is fixed. Whereas the analysis in [1] focuses on the suboptimality of the Ces'aro averages of the agents' sequences, we establish explicit ultimate bounds on the agents' estimation errors themselves. We demonstrate that the collective optimum is globally practically asymptotically stable for this algorithm.
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/hal-00644455
Contributor : Ist Rennes <>
Submitted on : Thursday, November 24, 2011 - 2:40:50 PM
Last modification on : Wednesday, October 10, 2018 - 9:38:02 PM
Long-term archiving on: : Monday, December 5, 2016 - 10:57:54 AM

File

19-PID2132105.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00644455, version 1

Collections

Citation

Karla Kvaternik, Lacra Pavel. Lyapunov Analysis of a Distributed Optimization Scheme. NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization, Telecom SudParis et Université Paris Descartes, Oct 2011, Paris, France. ⟨hal-00644455⟩

Share

Metrics

Record views

241

Files downloads

469