Computational Optimization and Applications

, Volume 47, Issue 3, pp 377–400

Duality-based algorithms for total-variation-regularized image restoration


DOI: 10.1007/s10589-008-9225-2

Cite this article as:
Zhu, M., Wright, S.J. & Chan, T.F. Comput Optim Appl (2010) 47: 377. doi:10.1007/s10589-008-9225-2


Image restoration models based on total variation (TV) have become popular since their introduction by Rudin, Osher, and Fatemi (ROF) in 1992. The dual formulation of this model has a quadratic objective with separable constraints, making projections onto the feasible set easy to compute. This paper proposes application of gradient projection (GP) algorithms to the dual formulation. We test variants of GP with different step length selection and line search strategies, including techniques based on the Barzilai-Borwein method. Global convergence can in some cases be proved by appealing to existing theory. We also propose a sequential quadratic programming (SQP) approach that takes account of the curvature of the boundary of the dual feasible set. Computational experiments show that the proposed approaches perform well in a wide range of applications and that some are significantly faster than previously proposed methods, particularly when only modest accuracy in the solution is required.


Image denoising Constrained optimization Gradient projection 

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Mingqiang Zhu
    • 1
  • Stephen J. Wright
    • 2
  • Tony F. Chan
    • 1
  1. 1.Mathematics DepartmentUCLALos AngelesUSA
  2. 2.Department of Computer SciencesUniversity of WisconsinMadisonUSA

Personalised recommendations