University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Preconditioned and accelerated Douglas-Rachford algorithms for the solution of variational imaging problems

Preconditioned and accelerated Douglas-Rachford algorithms for the solution of variational imaging problems

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact info@newton.ac.uk.

VMVW01 - Variational methods, new optimisation techniques and new fast numerical algorithms

Co-author: Hongpeng Sun (Renmin University of China)

We present preconditioned and accelerated versions of the Douglas-Rachford (DR) splitting method for the solution of convex-concave saddle-point problems which often arise in variational imaging. The methods enable to replace the solution of a linear system in each iteration step in the corresponding DR iteration by approximate solvers without the need of controlling the error. These iterations are shown to converge in Hilbert space under minimal assumptions on the preconditioner and for any step-size. Moreover, ergodic sequences associated with the iteration admit at least a \\\\\\ convergence rate in terms of restricted primal-dual gaps. Further, strong convexity of one or both of the involved functionals allow for acceleration strategies that yield improved rates of \\\\ \\ \ and \\ \ \\ for \\\\\ , respectively.

The methods are applied to non-smooth and convex variational imaging problems. We discuss denoising and deconvolution with \\ and \\ discrepancy and total variation (TV) as well as total generalized variation (TGV) penalty. Preconditioners which are specific to these problems are presented, the results of numerical experiments are shown and the benefits of the respective preconditioned iterations are discussed.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity