Show simple item record

dc.contributor.authorCondat, Laurent
dc.contributor.authorKitahara, Daichi
dc.contributor.authorContreras, Andrés
dc.contributor.authorHirabayashi, Akira
dc.date.accessioned2019-12-22T13:07:47Z
dc.date.available2019-12-22T13:07:47Z
dc.date.issued2019-11-30
dc.identifier.urihttp://hdl.handle.net/10754/660732
dc.description.abstractWe present several splitting methods in the single umbrella of the forward-backward iteration to solve monotone inclusions, applied with preconditioning. In addition, we show that, when the smooth term in the objective function is quadratic, convergence is guaranteed with larger values of the relaxation parameter than previously known.
dc.publisherarXiv
dc.relation.urlhttps://arxiv.org/pdf/1912.00137
dc.rightsArchived with thanks to arXiv
dc.titleProximal Splitting Algorithms: Overrelax them all!
dc.typePreprint
dc.contributor.departmentVisual Computing Center, King Abdullah University of Science and Technology (KAUST), Thuwal, Saudi Arabia
dc.eprint.versionPre-print
dc.contributor.institutionCollege of Information Sci. and Eng., Ritsumeikan University, Kusatsu, Japan
dc.contributor.institutionUniversity of Chile, Santiago, Chile
dc.identifier.arxivid1912.00137
kaust.personCondat, Laurent
refterms.dateFOA2019-12-22T13:09:38Z


Files in this item

Thumbnail
Name:
Preprintfile1.pdf
Size:
312.6Kb
Format:
PDF
Description:
Pre-print

This item appears in the following Collection(s)

Show simple item record