IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i9p789-d261519.html
   My bibliography  Save this article

A New Hybrid CQ Algorithm for the Split Feasibility Problem in Hilbert Spaces and Its Applications to Compressed Sensing

Author

Listed:
  • Suthep Suantai

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

  • Suparat Kesornprom

    (School of Science, University of Phayao, Phayao 56000, Thailand)

  • Prasit Cholamjiak

    (School of Science, University of Phayao, Phayao 56000, Thailand)

Abstract

In this paper, we focus on studying the split feasibility problem (SFP), which has many applications in signal processing and image reconstruction. A popular technique is to employ the iterative method which is so called the relaxed CQ algorithm. However, the speed of convergence usually depends on the way of selecting the step size of such algorithms. We aim to suggest a new hybrid CQ algorithm for the SFP by using the self adaptive and the line-search techniques. There is no computation on the inverse and the spectral radius of a matrix. We then prove the weak convergence theorem under mild conditions. Numerical experiments are included to illustrate its performance in compressed sensing. Some comparisons are also given to show the efficiency with other CQ methods in the literature.

Suggested Citation

  • Suthep Suantai & Suparat Kesornprom & Prasit Cholamjiak, 2019. "A New Hybrid CQ Algorithm for the Split Feasibility Problem in Hilbert Spaces and Its Applications to Compressed Sensing," Mathematics, MDPI, vol. 7(9), pages 1-15, August.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:9:p:789-:d:261519
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/9/789/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/9/789/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Abdellah Bnouhachem & Muhammad Noor & Mohamed Khalfaoui & Sheng Zhaohan, 2012. "On descent-projection method for solving the split feasibility problems," Journal of Global Optimization, Springer, vol. 54(3), pages 627-639, November.
    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. Le Hai Yen & Nguyen Thi Thanh Huyen & Le Dung Muu, 2019. "A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models," Journal of Global Optimization, Springer, vol. 73(4), pages 849-868, April.
    2. Q. L. Dong & Y. C. Tang & Y. J. Cho & Th. M. Rassias, 2018. "“Optimal” choice of the step length of the projection and contraction methods for solving the split feasibility problem," Journal of Global Optimization, Springer, vol. 71(2), pages 341-360, June.

    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:gam:jmathe:v:7:y:2019:i:9:p:789-:d:261519. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.