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

Author:

Suebcharoen Teeranush1,Suparatulatorn Raweerote12ORCID,Chaobankoh Tanadon1ORCID,Kunwai Khwanchai1,Mouktonglang Thanasak1

Affiliation:

1. Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand

2. Office of Research Administration, 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.

Funder

CMU Mid-Career Research Fellowship program, Chiang Mai University

Faculty of Science, Chiang Mai University

Chiang Mai University

Publisher

MDPI AG

Reference20 articles.

1. A multiprojection algorithm using Bregman projection in a product spce;Censor;Numer. Algorithms,1994

2. A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery;Che;J. Glob. Optim.,2023

3. General splitting methods with linearization for the split feasibility problem;Dong;J. Glob. Optim.,2021

4. A new iterative scheme using inertial technique for the split feasibility problem with application to compressed sensing;Kesornprom;Thai J. Math.,2020

5. An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces;Ma;J. Appl. Math. Comput.,2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3