Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

A Fully Stochastic Primal-Dual Algorithm

Pascal Bianchi 1 Walid Hachem 2 Adil Salim 2
1 S2A - Signal, Statistique et Apprentissage
LTCI - Laboratoire Traitement et Communication de l'Information
2 COMNUM - Communications Numériques
LTCI - Laboratoire Traitement et Communication de l'Information
Abstract : A new stochastic primal-dual algorithm for solving a composite optimization problem is proposed. It is assumed that all the functions / operators that enter the optimization problem are given as statistical expectations. These expectations are unknown but revealed across time through i.i.d realizations. The proposed algorithm is proven to converge to a saddle point of the Lagrangian function. In the framework of the monotone operator theory, the convergence proof relies on recent results on the stochastic Forward Backward algorithm involving random monotone operators. An example of convex optimization under stochastic linear constraints is considered.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download
Contributor : Adil Salim <>
Submitted on : Tuesday, November 19, 2019 - 11:16:27 AM
Last modification on : Wednesday, June 24, 2020 - 4:19:54 PM
Document(s) archivé(s) le : Thursday, February 20, 2020 - 4:10:58 PM


Files produced by the author(s)


  • HAL Id : hal-02369882, version 1
  • ARXIV : 1901.08170


Pascal Bianchi, Walid Hachem, Adil Salim. A Fully Stochastic Primal-Dual Algorithm. 2019. ⟨hal-02369882⟩



Record views


Files downloads