INEXACT ALTERNATING DIRECTION METHODS FOR IMAGE RECOVERY

In the image processing community, there have recently been many restoration and reconstruction problems that can be reformulated into linearly constrained convex programming models whose objective functions have separable structures. These favorable reformulations have promoted impressive applications of the alternating direction method (ADM) in the field of image processing. At each iteration, the computation of ADM is dominated by solving two subproblems exactly. However, in many restoration and reconstruction applications, it is either impossible or extremely expensive to obtain exact solutions of these ADM subproblems. This fact urges the development on inexact versions of ADM, which allow the generated ADM subproblems to be solved approximately subject to certain inexactness criteria. In this paper, we develop some truly implementable inexact ADMs whose inexactness criteria controlling the accuracy of the ADM subproblems are easily implementable. The convergence of the new inexact ADMs will be proved. Numerical results on several image processing problems will be given to illustrate the effectiveness of the proposed inexact ADMs.