IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v357y2019icp139-146.html
   My bibliography  Save this article

A fast splitting method for efficient Split Bregman iterations

Author

Listed:
  • Lazzaro, D.
  • Loli Piccolomini, E.
  • Zama, F.

Abstract

In this paper we propose a new fast splitting algorithm to solve the Weighted Split Bregman minimization problem in the backward step of an accelerated Forward–Backward algorithm. Beside proving the convergence of the method, numerical tests, carried out on different imaging applications, prove the accuracy and computational efficiency of the proposed algorithm.

Suggested Citation

  • Lazzaro, D. & Loli Piccolomini, E. & Zama, F., 2019. "A fast splitting method for efficient Split Bregman iterations," Applied Mathematics and Computation, Elsevier, vol. 357(C), pages 139-146.
    • Handle: RePEc:eee:apmaco:v:357:y:2019:i:c:p:139-146
    DOI: 10.1016/j.amc.2019.03.065
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319302735
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.03.065?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. A. Chambolle & Ch. Dossal, 2015. "On the Convergence of the Iterates of the “Fast Iterative Shrinkage/Thresholding Algorithm”," Journal of Optimization Theory and Applications, Springer, vol. 166(3), pages 968-982, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Franck Iutzeler & Jérôme Malick, 2018. "On the Proximal Gradient Algorithm with Alternated Inertia," Journal of Optimization Theory and Applications, Springer, vol. 176(3), pages 688-710, March.
    2. Zhongming Wu & Min Li, 2019. "General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems," Computational Optimization and Applications, Springer, vol. 73(1), pages 129-158, May.
    3. Hongwei Liu & Ting Wang & Zexian Liu, 2022. "Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems," Computational Optimization and Applications, Springer, vol. 83(2), pages 651-691, November.
    4. Q. L. Dong & Y. J. Cho & L. L. Zhong & Th. M. Rassias, 2018. "Inertial projection and contraction algorithms for variational inequalities," Journal of Global Optimization, Springer, vol. 70(3), pages 687-704, March.
    5. S. Bonettini & M. Prato & S. Rebegoldi, 2018. "A block coordinate variable metric linesearch based proximal gradient method," Computational Optimization and Applications, Springer, vol. 71(1), pages 5-52, September.
    6. Donghwan Kim & Jeffrey A. Fessler, 2018. "Adaptive Restart of the Optimized Gradient Method for Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 178(1), pages 240-263, July.
    7. Szilárd Csaba László, 2023. "A Forward–Backward Algorithm With Different Inertial Terms for Structured Non-Convex Minimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 198(1), pages 387-427, July.
    8. Cesare Molinari & Juan Peypouquet, 2018. "Lagrangian Penalization Scheme with Parallel Forward–Backward Splitting," Journal of Optimization Theory and Applications, Springer, vol. 177(2), pages 413-447, May.
    9. Luyun Wang & Bo Zhou, 2023. "A Modified Gradient Method for Distributionally Robust Logistic Regression over the Wasserstein Ball," Mathematics, MDPI, vol. 11(11), pages 1-15, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:357:y:2019:i:c:p:139-146. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.