A unified primal-dual algorithm framework based on Bregman iteration (Q639393): Difference between revisions

The goal of the paper is to propose a unified primal-dual algorithm framework for two classes of convex optimization problems arising from various signal and image processing applications. The convergence of the general algorithm framework is proved under mild assumption. Numerical examples show the algorithms proposed are easy to implement, efficient, stable and flexible enough to cover a wide variety of applications.