Abstract
We consider the problem of minimizing the sum of convex functions over a network when each component function is known (with stochastic errors) to a specific network agent. We discuss a gossip based algorithm of [2], and we analyze its error bounds for a constant stepsize that is uncoordinated across the agents.
| Original language | English (US) |
|---|---|
| Title of host publication | Recent Advances in Optimization and its Applications in Engineering |
| Publisher | Springer |
| Pages | 51-60 |
| Number of pages | 10 |
| ISBN (Print) | 9783642125973 |
| DOIs | |
| State | Published - 2010 |
ASJC Scopus subject areas
- General Engineering
Fingerprint
Dive into the research topics of 'Asynchronous gossip algorithm for stochastic optimization: Constant stepsize analysis'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS