Skip to main content
Log in

An improved first-order primal-dual algorithm with a new correction step

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In this paper, we propose a new correction strategy for some first-order primal-dual algorithms arising from solving, e.g., total variation image restoration. With this strategy, we can prove the convergence of the algorithm under more flexible conditions than those proposed most recently. Some preliminary numerical results of image deblurring support that the new correction strategy can improve the numerical efficiency.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Arrow, K.J., Hurwicz, L., Uzawa, H.: With contributions by H.B. Chenery, S.M. Johnson, S. Karlin, T. Marschak, and R.M. Solow. Studies in Linear and Non-Linear Programming, volume II of Stanford Mathematical Studies in the Social Science. Stanford Unversity Press, Stanford, (1958)

  2. Censor Y., Elfving T.: New methods for linear inequalities. Linear Algebra It’s Appl. 42, 199–211 (1982)

    Article  Google Scholar 

  3. Chambolle A., Pock T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40, 120–145 (2011)

    Article  Google Scholar 

  4. Esser E., Zhang X., Chan T.: A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science. SIAM J. Imaging Sci. 3, 1015–1046 (2010)

    Article  Google Scholar 

  5. Gubin L.G., Polyak B.T., Raik E.V.: The method of projections for finding the common point of convex sets. USSR Comput. Math. Math. Phys. 7, 1–24 (1967)

    Article  Google Scholar 

  6. Han D., Xu W., Yang H.: An operator splitting method for variational inequalities with partially unknown mappings. Numer. Math. 111(2), 207–237 (2008)

    Article  Google Scholar 

  7. He B., Liao L.Z., Han D., Yang H.: A new inexact alternating directions method for monotone variational inequalities. Math. Progr. 92(1), 103–118 (2002)

    Article  Google Scholar 

  8. He B., Tao M., Yuan X.: Alternating direction method with gaussian back substitution for separable convex programming. SIAM J. Optim. 22(2), 313–340 (2012)

    Article  Google Scholar 

  9. He B., Yuan X.: On the O(1/n) convergence rate of the douglas-rachford alternating direction method. SIAM J. Numer. Anal. 50(2), 700–709 (2012)

    Article  Google Scholar 

  10. He B.S., Yuan X.M.: Convergence analysis of primal-dual algorithms for a saddle-point problem: From contraction perspective. SIAM J. Imaging Sci. 5, 119–149 (2012)

    Article  Google Scholar 

  11. Nemirovski A.: Prox-method with rate of convergence O(1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15(1), 229–251 (2004)

    Article  Google Scholar 

  12. Zhu, M.Q., Chan, T.: An efficient primal-dual hybrid gradient algorithm for total variation image restoration. CAM reports 08–34, UCLA, (2008)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Deren Han.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cai, X., Han, D. & Xu, L. An improved first-order primal-dual algorithm with a new correction step. J Glob Optim 57, 1419–1428 (2013). https://doi.org/10.1007/s10898-012-9999-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-012-9999-8

Keywords

Navigation