Domain decompsition for Total Variation Minimization
主 题: Domain decompsition for Total Variation Minimization
报告人: Professor Xue-Cheng Tai (Department of Mathematics, University of Bergen)
时 间: 2014-07-18 16:00-17:00
地 点: 数学中心全斋29号教室（数学中心计算方法与应用实验室活动）
This talk is concerned with overlapping domain decomposition methods (DDMs), based on successive subspace correction (SSC) and parallel subspace correc- tion (PSC), for the Rudin, Osher and Fatemi (ROF) model in image restoration. In contrast to recent attempts, we work with a dual formulation of the ROF model, where one significant difficulty lies in the decomposition of the global constraint of the dual problem. We propose a stable ”Unit Decomposition” and this leads us to come natural overlapping domain decomposition schemes for the dual problem. We further analyze the convergence of the proposed algorithms, and obtain the rate O(n?1/2) where n is the number of iterations. Move, the dependence of the convergence rate on the overlapping size, regularization parameter and relaxation parameter is clearly given. To the best of our knowledge, such a convergence has not been claimed so far for domain decomposition related algorithms the ROF model.
This talk is based on joint work with: Huibin Chang, Lilian Wang and Danping Yang.