Decomposition/coordination algorithms in stochastic optimization

J. C. Culioli, G. Cohen

Research output: Contribution to journalArticlepeer-review

24 Scopus citations

Abstract

This paper considers an extension to the situation of stochastic programming of the Auxiliary Problem Principle formerly introduced in a deterministic setting to serve as a general framework for decomposition/coordination optimization algorithms. The idea is based upon that of the stochastic gradient, that is, independent noise realizations are considered successively along the iterations. As a consequence, deterministic subproblems are solved at each iteration whereas iterations fulfill the two tasks of coordination and stochastic approximation at the same time. Coupling cost function (expectation of some performance index) and deterministic coupling constraints are considered. Price (dual) decomposition (encompassing extensions of the Uzawa and Arrow-Hurwicz algorithms to this stochastic case) are studied as well as resource allocation (primal decomposition).

Original languageEnglish
Pages (from-to)1372-1403
Number of pages32
JournalSIAM Journal on Control and Optimization
Volume28
Issue number6
DOIs
StatePublished - 1 Jan 1990
Externally publishedYes

Fingerprint

Dive into the research topics of 'Decomposition/coordination algorithms in stochastic optimization'. Together they form a unique fingerprint.

Cite this