Title: On the Douglas-Rachford algorithm
|Affiliation:||University of British Columbia|
The Douglas-Rachford algorithm is a popular splitting method for finding a minimizer of the sum of two convex (possibly nonsmooth) functions; or, more generally, a zero of the sum of two maximally monotone operators.
My talk will focus on recent joint works on this algorithm. Based on joint works with Minh Dao (Newcastle, Australia), Valentin Koch (Autodesk), Walaa Moursi (UBC Kelowna), and Hung Phan (U Massachusetts Lowell).