A Preconditioning Technique for First-Order Primal-Dual Splitting Method in Convex Optimization

15Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We introduce a preconditioning technique for the first-order primal-dual splitting method. The primal-dual splitting method offers a very general framework for solving a large class of optimization problems arising in image processing. The key idea of the preconditioning technique is that the constant iterative parameters are updated self-adaptively in the iteration process. We also give a simple and easy way to choose the diagonal preconditioners while the convergence of the iterative algorithm is maintained. The efficiency of the proposed method is demonstrated on an image denoising problem. Numerical results show that the preconditioned iterative algorithm performs better than the original one.

Cite

CITATION STYLE

APA

Wen, M., Peng, J., Tang, Y., Zhu, C., & Yue, S. (2017). A Preconditioning Technique for First-Order Primal-Dual Splitting Method in Convex Optimization. Mathematical Problems in Engineering, 2017. https://doi.org/10.1155/2017/3694525

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free