Abstract
In this paper, we study a saddle point problem and propose an inexact double primal-dual algorithm for solving the saddle point problem. The sequence generated by the proposed algorithm is proved to globally converge to the saddle point of the saddle point problem in the ergodic sense, and the convergence rate of the algorithm is also obtained. For the model of total variation image processing, the performance of the algorithm is demonstrated. Simulation results show that our method is more efficient in image denoising compared with existing methods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
