On relaxed inertial projection and contraction algorithms for solving monotone inclusion problems

IF 1.7 3区 数学 Q2 MATHEMATICS, APPLIED Advances in Computational Mathematics Pub Date : 2024-06-18 DOI:10.1007/s10444-024-10156-1
Bing Tan, Xiaolong Qin
{"title":"On relaxed inertial projection and contraction algorithms for solving monotone inclusion problems","authors":"Bing Tan, Xiaolong Qin","doi":"10.1007/s10444-024-10156-1","DOIUrl":null,"url":null,"abstract":"<p>We present three novel algorithms based on the forward-backward splitting technique for the solution of monotone inclusion problems in real Hilbert spaces. The proposed algorithms work adaptively in the absence of the Lipschitz constant of the single-valued operator involved thanks to the fact that there is a non-monotonic step size criterion used. The weak and strong convergence and the <i>R</i>-linear convergence of the developed algorithms are investigated under some appropriate assumptions. Finally, our algorithms are put into practice to address the restoration problem in the signal and image fields, and they are compared to some pertinent algorithms in the literature.</p>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":null,"pages":null},"PeriodicalIF":1.7000,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Computational Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10444-024-10156-1","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

We present three novel algorithms based on the forward-backward splitting technique for the solution of monotone inclusion problems in real Hilbert spaces. The proposed algorithms work adaptively in the absence of the Lipschitz constant of the single-valued operator involved thanks to the fact that there is a non-monotonic step size criterion used. The weak and strong convergence and the R-linear convergence of the developed algorithms are investigated under some appropriate assumptions. Finally, our algorithms are put into practice to address the restoration problem in the signal and image fields, and they are compared to some pertinent algorithms in the literature.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
论解决单调包含问题的松弛惯性投影和收缩算法
我们提出了三种基于前向-后向分裂技术的新算法,用于求解实希尔伯特空间中的单调包含问题。由于使用了非单调步长准则,所提出的算法能在单值算子的 Lipschitz 常数缺失的情况下自适应地工作。在一些适当的假设条件下,研究了所开发算法的弱收敛性、强收敛性和 R 线性收敛性。最后,我们将算法应用于解决信号和图像领域的复原问题,并与文献中的一些相关算法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
3.00
自引率
5.90%
发文量
68
审稿时长
3 months
期刊介绍: Advances in Computational Mathematics publishes high quality, accessible and original articles at the forefront of computational and applied mathematics, with a clear potential for impact across the sciences. The journal emphasizes three core areas: approximation theory and computational geometry; numerical analysis, modelling and simulation; imaging, signal processing and data analysis. This journal welcomes papers that are accessible to a broad audience in the mathematical sciences and that show either an advance in computational methodology or a novel scientific application area, or both. Methods papers should rely on rigorous analysis and/or convincing numerical studies.
期刊最新文献
Maximal volume matrix cross approximation for image compression and least squares solution Multilevel approximation of Gaussian random fields: Covariance compression, estimation, and spatial prediction Improved a posteriori error bounds for reduced port-Hamiltonian systems Interpolating refinable functions and $$n_s$$ -step interpolatory subdivision schemes SVD-based algorithms for tensor wheel decomposition
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1