Skip to main navigation Skip to search Skip to main content

A Constant Step Stochastic Douglas-Rachford Algorithm with Application to non Separable Regularizations

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The Douglas Rachford algorithm is an algorithm that converges to a minimizer of a sum of two convex functions. The algorithm consists in fixed point iterations involving computations of the proximity operators of the two functions separately. The paper investigates a stochastic version of the algorithm where both functions are random and the step size is constant. We establish that the iterates of the algorithm stay close to the set of solution with high probability when the step size is small enough. Application to structured regularization is considered.

Original languageEnglish
Title of host publication2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2886-2890
Number of pages5
ISBN (Print)9781538646588
DOIs
Publication statusPublished - 10 Sept 2018
Externally publishedYes
Event2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018 - Calgary, Canada
Duration: 15 Apr 201820 Apr 2018

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume2018-April
ISSN (Print)1520-6149

Conference

Conference2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018
Country/TerritoryCanada
CityCalgary
Period15/04/1820/04/18

Keywords

  • Douglas Rachford algorithm
  • Proximal methods
  • Stochastic optimization
  • Structured regularizations

Fingerprint

Dive into the research topics of 'A Constant Step Stochastic Douglas-Rachford Algorithm with Application to non Separable Regularizations'. Together they form a unique fingerprint.

Cite this