Asynchronous gossip algorithm for stochastic optimization: Constant stepsize analysis

S. Sundhar Ram, Angelia Nedić, Venu V. Veeravalli

Research output: Chapter in Book/Report/Conference proceedingChapter

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 languageEnglish (US)
Title of host publicationRecent Advances in Optimization and its Applications in Engineering
PublisherSpringer Berlin Heidelberg
Pages51-60
Number of pages10
ISBN (Print)9783642125973
DOIs
StatePublished - Dec 1 2010

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Ram, S. S., Nedić, A., & Veeravalli, V. V. (2010). Asynchronous gossip algorithm for stochastic optimization: Constant stepsize analysis. In Recent Advances in Optimization and its Applications in Engineering (pp. 51-60). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-12598-0_5

Asynchronous gossip algorithm for stochastic optimization : Constant stepsize analysis. / Ram, S. Sundhar; Nedić, Angelia; Veeravalli, Venu V.

Recent Advances in Optimization and its Applications in Engineering. Springer Berlin Heidelberg, 2010. p. 51-60.

Research output: Chapter in Book/Report/Conference proceedingChapter

Ram, SS, Nedić, A & Veeravalli, VV 2010, Asynchronous gossip algorithm for stochastic optimization: Constant stepsize analysis. in Recent Advances in Optimization and its Applications in Engineering. Springer Berlin Heidelberg, pp. 51-60. https://doi.org/10.1007/978-3-642-12598-0_5
Ram SS, Nedić A, Veeravalli VV. Asynchronous gossip algorithm for stochastic optimization: Constant stepsize analysis. In Recent Advances in Optimization and its Applications in Engineering. Springer Berlin Heidelberg. 2010. p. 51-60 https://doi.org/10.1007/978-3-642-12598-0_5
Ram, S. Sundhar ; Nedić, Angelia ; Veeravalli, Venu V. / Asynchronous gossip algorithm for stochastic optimization : Constant stepsize analysis. Recent Advances in Optimization and its Applications in Engineering. Springer Berlin Heidelberg, 2010. pp. 51-60
@inbook{7a4a1a2884684982b82073d9b0687547,
title = "Asynchronous gossip algorithm for stochastic optimization: Constant stepsize analysis",
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.",
author = "Ram, {S. Sundhar} and Angelia Nedić and Veeravalli, {Venu V.}",
year = "2010",
month = "12",
day = "1",
doi = "10.1007/978-3-642-12598-0_5",
language = "English (US)",
isbn = "9783642125973",
pages = "51--60",
booktitle = "Recent Advances in Optimization and its Applications in Engineering",
publisher = "Springer Berlin Heidelberg",

}

TY - CHAP

T1 - Asynchronous gossip algorithm for stochastic optimization

T2 - Constant stepsize analysis

AU - Ram, S. Sundhar

AU - Nedić, Angelia

AU - Veeravalli, Venu V.

PY - 2010/12/1

Y1 - 2010/12/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=84874282867&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84874282867&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-12598-0_5

DO - 10.1007/978-3-642-12598-0_5

M3 - Chapter

AN - SCOPUS:84874282867

SN - 9783642125973

SP - 51

EP - 60

BT - Recent Advances in Optimization and its Applications in Engineering

PB - Springer Berlin Heidelberg

ER -