Comparative Analysis of the Prox Penalty and Bregman Algorithms for Image Denoising

Algorithm 1

[11, 12] Algorithm of proximal penalty.

Step 0: Let , be a precision.

Step 1: we use the minimization approach to find a solution to the following problem using a penalty coefficient and a precision .

Step 2: the solution obtained is .

If and if    then is an excellent approximation of the optimal solution, and the calculations stop at iteration

Otherwise, we use as a penalty coefficient. We put   , and and return to step 1.