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

An Inertial Relaxed CQ Algorithm with Two Adaptive Step Sizes and Its Application for Signal Recovery

Author

Listed:
  • Teeranush Suebcharoen

    (Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand)

  • Raweerote Suparatulatorn

    (Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand
    Office of Research Administration, Chiang Mai University, Chiang Mai 50200, Thailand)

  • Tanadon Chaobankoh

    (Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand)

  • Khwanchai Kunwai

    (Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand)

  • Thanasak Mouktonglang

    (Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand)

Abstract

This article presents a novel inertial relaxed CQ algorithm for solving split feasibility problems. Note that the algorithm incorporates two adaptive step sizes here. A strong convergence theorem is established for the problem under some standard conditions. Additionally, we explore the utility of the algorithm in solving signal recovery problems. Its performance is evaluated against existing techniques from the literature.

Suggested Citation

  • Teeranush Suebcharoen & Raweerote Suparatulatorn & Tanadon Chaobankoh & Khwanchai Kunwai & Thanasak Mouktonglang, 2024. "An Inertial Relaxed CQ Algorithm with Two Adaptive Step Sizes and Its Application for Signal Recovery," Mathematics, MDPI, vol. 12(15), pages 1-16, August.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:15:p:2406-:d:1448489
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/15/2406/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/15/2406/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Qiao-Li Dong & Songnian He & Michael Th. Rassias, 2021. "General splitting methods with linearization for the split feasibility problem," Journal of Global Optimization, Springer, vol. 79(4), pages 813-836, April.
    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. Yuanheng Wang & Tiantian Xu & Jen-Chih Yao & Bingnan Jiang, 2022. "Self-Adaptive Method and Inertial Modification for Solving the Split Feasibility Problem and Fixed-Point Problem of Quasi-Nonexpansive Mapping," Mathematics, MDPI, vol. 10(9), 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:gam:jmathe:v:12:y:2024:i:15:p:2406-:d:1448489. 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.