A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science

  • Authors:

  • Ernie Esser;Xiaoqun Zhang;Tony F. Chan

  • Affiliations:

  • eesser@math.uci.edu;xqzhang@sjtu.edu.cn;tonyfchan@ust.hk

  • Venue:
  • SIAM Journal on Imaging Sciences
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Variation Image Restoration, CAM Report 08-34, UCLA, Los Angeles, CA, 2008] to a broader class of convex optimization problems. In addition, we survey several closely related methods and explain the connections to PDHG. We point out convergence results for a modified version of PDHG that has a similarly good empirical convergence rate for total variation (TV) minimization problems. We also prove a convergence result for PDHG applied to TV denoising with some restrictions on the PDHG step size parameters. We show how to interpret this special case as a projected averaged gradient method applied to the dual functional. We discuss the range of parameters for which these methods can be shown to converge. We also present some numerical comparisons of these algorithms applied to TV denoising, TV deblurring, and constrained $l_1$ minimization problems.