Stochastic primal-dual hybrid gradient algorithm with arbitrary sampling and imaging applications

145Citations
Citations of this article
76Readers
Mendeley users who have this article in their library.

Abstract

We propose a stochastic extension of the primal-dual hybrid gradient algorithm studied by Chambolle and Pock in 2011 to solve saddle point problems that are separable in the dual variable. The analysis is carried out for general convex-concave saddle point problems and problems that are either partially smooth / strongly convex or fully smooth / strongly convex. We perform the analysis for arbitrary samplings of dual variables, and we obtain known deterministic results as a special case. Several variants of our stochastic method significantly outperform the deterministic variant on a variety of imaging tasks.

Cite

CITATION STYLE

APA

Chambolle, A., Ehrhardt, M. J., Richtarik, P., & Schonlieb, C. B. (2018). Stochastic primal-dual hybrid gradient algorithm with arbitrary sampling and imaging applications. SIAM Journal on Optimization, 28(4), 2783–2808. https://doi.org/10.1137/17M1134834

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free