Show simple item record

dc.contributor.authorChambolle, Antonin
dc.contributor.authorEhrhardt, Matthias J.
dc.contributor.authorRichtarik, Peter
dc.contributor.authorSchonlieb, Carola Bibiane
dc.date.accessioned2019-02-24T08:34:14Z
dc.date.available2019-02-24T08:34:14Z
dc.date.issued2018-10-02
dc.identifier.citationChambolle A, Ehrhardt MJ, Richtárik P, Schönlieb C-B (2018) Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications. SIAM Journal on Optimization 28: 2783–2808. Available: http://dx.doi.org/10.1137/17M1134834.
dc.identifier.issn1052-6234
dc.identifier.issn1095-7189
dc.identifier.doi10.1137/17M1134834
dc.identifier.urihttp://hdl.handle.net/10754/631138
dc.description.abstractWe 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.
dc.description.sponsorshipThe work of the first author was supported by the ANR, 'EANOI' project I1148 / ANR-12-IS01-0003 (joint with FWF); part of this work was done while he was hosted in Churchill College and DAMTP, Centre for Mathematical Sciences, University of Cambridge, thanks to support from the French Embassy in the UK and the Cantab Capital Institute for the Mathematics of Information. The work of the second and fourth authors was supported by Leverhulme Trust project ``Breaking the non-convexity barrier,"" EPSRC grant EP/M00483X/1, EPSRC centre grant EP/N014588/1, the Cantab Capital Institute for the Mathematics of Information, and from CHiPS (Horizon 2020 RISE project grant). The second author carried out initial work supported by the EPSRC platform grant EP/M020533/1. Moreover, the fourth author is thankful for support by The Alan Turing Institute. The work of the third author was supported by EPSRC Fellowship in Mathematical Sciences grant EP/N005538/1, entitled ``Randomized algorithms for extreme convex optimization.""
dc.publisherSociety for Industrial & Applied Mathematics (SIAM)
dc.relation.urlhttps://epubs.siam.org/doi/10.1137/17M1134834
dc.rightsPublished by SIAM under the terms of the Creative Commons 4.0 license
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.subjectConvex optimization
dc.subjectImaging
dc.subjectPrimal-dual algorithms
dc.subjectSaddle point problems
dc.subjectStochastic optimization
dc.titleStochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
dc.typeArticle
dc.contributor.departmentComputer Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentExtreme Computing Research Center
dc.contributor.departmentVisual Computing Center (VCC)
dc.identifier.journalSIAM Journal on Optimization
dc.eprint.versionPublisher's Version/PDF
dc.contributor.institutionCMAP, CNRS, Ecole Polytechnique, Palaiseau, 91128, , , , France
dc.contributor.institutionDepartment for Applied Mathematics and Theoretical Physics, University of Cambridge, Cambridge, CB3 0WA, , United Kingdom
dc.contributor.institutionAlan Turing Institute, London, NW1 2DB, , United Kingdom
dc.contributor.institutionSchool of Mathematics, University of Edinburgh, Edinburgh, EH9 3PD, , United Kingdom
kaust.personRichtarik, Peter
refterms.dateFOA2019-02-24T08:40:44Z
dc.date.published-online2018-10-02
dc.date.published-print2018-01


Files in this item

Thumbnail
Name:
17m1134834.pdf
Size:
2.609Mb
Format:
PDF
Description:
Published version

This item appears in the following Collection(s)

Show simple item record

Published by SIAM under the terms of the Creative Commons 4.0 license
Except where otherwise noted, this item's license is described as Published by SIAM under the terms of the Creative Commons 4.0 license