Sökning: onr:"swepub:oai:DiVA.org:kth-46958" >
A RANDOMIZED INCREM...
A RANDOMIZED INCREMENTAL SUBGRADIENT METHOD FOR DISTRIBUTED OPTIMIZATION IN NETWORKED SYSTEMS
-
- Johansson, Björn (författare)
- KTH,Reglerteknik
-
- Rabi, Maben (författare)
- KTH,Reglerteknik
-
- Johansson, Mikael (författare)
- KTH,Reglerteknik
-
(creator_code:org_t)
- 2009
- 2009
- Engelska.
-
Ingår i: SIAM Journal on Optimization. - 1052-6234 .- 1095-7189. ; 20:3, s. 1157-1170
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- We present an algorithm that generalizes the randomized incremental subgradient method with fixed stepsize due to Nedic and Bertsekas [SIAM J. Optim., 12 (2001), pp. 109-138]. Our novel algorithm is particularly suitable for distributed implementation and execution, and possible applications include distributed optimization, e.g., parameter estimation in networks of tiny wireless sensors. The stochastic component in the algorithm is described by a Markov chain, which can be constructed in a distributed fashion using only local information. We provide a detailed convergence analysis of the proposed algorithm and compare it with existing, both deterministic and randomized, incremental subgradient methods.
Ämnesord
- NATURVETENSKAP -- Matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics (hsv//eng)
Nyckelord
- convex programming
- subgradient optimization
- distributed optimization
- Markov chain
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas