We solve the dual formulation of the Total Variation (TV)-based problem in image restoration. The dual TV problem has a quadratic objective function with numerous inequality constraints. We study two general classes of solvers: primal-dual interior-point methods and relaxation methods. We implement relaxation schemes on the primal, dual, and barrier problems. Numerical experiments show that both classes of solvers improve the reconstructed image quality in de-noising. |