Skip to main content
SpringerLink
Log in

Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this work, we design new type of projection methods to solve the split feasibility problem. We prove the convergence theorems under some mild conditions. Finally, we give some applications to compressed sensing and image restoration. Numerical results show that our methods can outperform related algorithms in the literature.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367–426 (1996)

    Article  MathSciNet  Google Scholar 

  2. Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, London (2011)

    Book  Google Scholar 

  3. Bot, R.I., Csetnek, E.R., Hendrich, C.: Inertial Douglas–Rachford splitting for monotone inclusion problems. Appl. Math. Comput. 256, 472–487 (2015)

    MathSciNet  MATH  Google Scholar 

  4. Bot, R.I., Csetnek, E.R.: An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems. Numer. Algor. 71(3), 519–540 (2016)

    Article  MathSciNet  Google Scholar 

  5. Byrne, C.: Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Prob. 18, 441–453 (2002)

    Article  MathSciNet  Google Scholar 

  6. Byrne, C.: A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Prob. 20, 103–120 (2004)

    Article  MathSciNet  Google Scholar 

  7. Byrne, C., Censor, Y., Gibali, A., Reich, S.: The split common null point problem. J. Nonlinear Convex Anal. 13(4), 75–95 (2012)

    MathSciNet  MATH  Google Scholar 

  8. Censor, Y., Elfving, T.: A multiprojection algorithms using Bregman projection in a product space. Numer. Algor. 8, 221–239 (1994)

    Article  MathSciNet  Google Scholar 

  9. Dang, Y., Sun, J., Xu, H.: Inertial accelerated algorithms for solving a split feasibility problem. J. Ind. Manag. Optim. 13, 1383–1394 (2017)

    Article  MathSciNet  Google Scholar 

  10. Dong, Q.L., Tang, Y.C., Cho, Y.J., Rassias, T.M.: Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem. J. Glob. Optim. 71(2), 341–360 (2018)

    Article  MathSciNet  Google Scholar 

  11. Douglas, J., Rachford, H.H.: On the numerical solution of the heat conduction problem in two and three space variables. Trans. Am. Math. Soc. 82, 421–439 (1956)

    Article  MathSciNet  Google Scholar 

  12. Gibali, A., Liu, L.W., Tang, Y.C.: Note on the modified relaxation CQ algorithm for the split feasibility problem. Optim. Lett. 12, 1–14 (2017)

    MathSciNet  Google Scholar 

  13. Gibali, A., Mai, D.T.: A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications. J. Ind. Manag. Optim. 15(2), 963–984 (2019)

    Article  MathSciNet  Google Scholar 

  14. Kitkuan, D., Kumam, P., Padcharoen, A., Kumam, W., Thounthong, P.: Algorithms for zeros of two accretive operators for solving convex minimization problems and its application to image restoration problems. J. Comput. Appl. Math. 354, 471–495 (2019)

    Article  MathSciNet  Google Scholar 

  15. Mainge, P.E.: Convergence theorem for inertial KM-type algorithms. J. Comput. Appl. Math. 219, 223–236 (2008)

    Article  MathSciNet  Google Scholar 

  16. Orović, I., Papić, V., Ioana, C., Li, X., Stanković, S.: Compressive sensing in signal processing: Algorithms and Transform Domain Formulations. Math. Probl. Eng. Volume 2016, Article ID 7616393. https://doi.org/10.1155/2016/7616393 (2016)

  17. Shehu, Y., Gibali, A.: New inertial relaxed method for solving split feasibilities. Optim. Lett. https://doi.org/10.1007/s11590-020-01603-1. (2020)

  18. Shehu, Y., Dong, Q.L., Liu, L.L.: Global and linear convergence of alternated inertial methods for split feasibility problems. RACSAM 115(2), 1–26 (2021)

    Article  MathSciNet  Google Scholar 

  19. Stark, H.: In: Censor,Y., Jiang, M., Wang, G. (eds) Image Recovery: Theory and Applications (San Diego, CA: Academic) Iterative Algorithms for the Multiple-Sets Split Feasibility Problem Biomedical Mathematics: Promising Directions in Imaging, Therapy Planning and Inverse Problems, pp. 243-79. Medical Physics Publishing, Madison, WI (2010)

  20. Tseng, P.: A modified forward-backward splitting method for maximal monotone mappings. SIAM J. Control Optim. 38(2), 431–446 (2000)

    Article  MathSciNet  Google Scholar 

  21. Yang, Q.: The relaxed CQ algorithm for solving the split feasibility problem. Inverse Prob. 20, 1261–1266 (2004)

    Article  MathSciNet  Google Scholar 

  22. Zhang, W., Han, D., Li, Z.: A self-adaptive projection method for solving the multiple-sets split feasibility problem. Inverse Prob. 25, 115001 (2009)

    Article  MathSciNet  Google Scholar 

  23. Zhao, J., Zhang, Y., Yang, Q.: Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem. Appl. Math. Comput. 219, 1644–1653 (2012)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to thank editor and reviewers for their value comments for improving the original manuscript. We wish to thank Chiang Mai University and Thailand Science Research and Innovation (IRN62W0007). This project is funded by National Research Council of Thailand (NRCT) grant no. N41A640094.

Author information

Authors and Affiliations

  1. Research Center in Mathematics and Applied Mathematics, Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai, 50200, Thailand

    Suthep Suantai & Bancha Panyanak

  2. School of Science, University of Phayao, Phayao, 56000, Thailand

    Suparat Kesornprom & Prasit Cholamjiak

Authors
  1. Suthep Suantai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bancha Panyanak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Suparat Kesornprom
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Prasit Cholamjiak
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Prasit Cholamjiak.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Suantai, S., Panyanak, B., Kesornprom, S. et al. Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration. Optim Lett 16, 1725–1744 (2022). https://doi.org/10.1007/s11590-021-01798-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-021-01798-x

Keywords

Search

Navigation