Two inertial-relaxed hybridized CG projection-based algorithms for solving nonlinear monotone equations applied in image restoration

IF 2.6 2区 数学 Q1 MATHEMATICS, APPLIED Journal of Computational and Applied Mathematics Pub Date : 2025-02-06 DOI:10.1016/j.cam.2025.116546
Xuejie Ma , Sixing Yang , Pengjie Liu
{"title":"Two inertial-relaxed hybridized CG projection-based algorithms for solving nonlinear monotone equations applied in image restoration","authors":"Xuejie Ma ,&nbsp;Sixing Yang ,&nbsp;Pengjie Liu","doi":"10.1016/j.cam.2025.116546","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we introduce two inertial-relaxed hybridized conjugate gradient projection-based algorithms for solving nonlinear monotone equations. Compared to traditional inertial-relaxed algorithms for solving such nonlinear equations, our algorithms utilize three-step iterative information to generate inertial iterates. The search directions of two proposed algorithms each include a flexible non-zero vector and feature their own self-adaptive hybrid structure to enhance their adaptability. Both search directions satisfy the sufficient descent and trust region properties, eliminating the need for additional conditions. In the theoretical analysis of global convergence and convergence rate results, both proposed algorithms exhibit similarities. We begin by using the first proposed algorithm to establish the global convergence without requiring the Lipschitz continuity assumption. Furthermore, under additional assumptions, we demonstrate the convergence rate of this algorithm. To evaluate their effectiveness, we conduct comparative tests against existing algorithms using nonlinear equations. Moreover, the practicality of the two proposed algorithms is shown through applications on image restoration problems.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"464 ","pages":"Article 116546"},"PeriodicalIF":2.6000,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational and Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0377042725000615","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we introduce two inertial-relaxed hybridized conjugate gradient projection-based algorithms for solving nonlinear monotone equations. Compared to traditional inertial-relaxed algorithms for solving such nonlinear equations, our algorithms utilize three-step iterative information to generate inertial iterates. The search directions of two proposed algorithms each include a flexible non-zero vector and feature their own self-adaptive hybrid structure to enhance their adaptability. Both search directions satisfy the sufficient descent and trust region properties, eliminating the need for additional conditions. In the theoretical analysis of global convergence and convergence rate results, both proposed algorithms exhibit similarities. We begin by using the first proposed algorithm to establish the global convergence without requiring the Lipschitz continuity assumption. Furthermore, under additional assumptions, we demonstrate the convergence rate of this algorithm. To evaluate their effectiveness, we conduct comparative tests against existing algorithms using nonlinear equations. Moreover, the practicality of the two proposed algorithms is shown through applications on image restoration problems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
两种基于惯性松弛杂交CG投影的非线性单调方程求解算法在图像恢复中的应用
本文介绍了两种基于惯性松弛杂交共轭梯度投影的非线性单调方程求解算法。与求解此类非线性方程的传统惯性松弛算法相比,我们的算法利用三步迭代信息生成惯性迭代。两种算法的搜索方向均包含一个灵活的非零向量,并具有自适应混合结构,增强了算法的自适应性。两个搜索方向都满足充分下降和信任域的性质,消除了附加条件的需要。在全局收敛性和收敛速度的理论分析结果中,两种算法具有相似性。我们首先使用第一种提出的算法来建立全局收敛性,而不需要Lipschitz连续性假设。此外,在附加的假设条件下,我们证明了该算法的收敛速度。为了评估其有效性,我们使用非线性方程对现有算法进行了比较测试。此外,通过对图像恢复问题的应用,证明了这两种算法的实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
5.40
自引率
4.20%
发文量
437
审稿时长
3.0 months
期刊介绍: The Journal of Computational and Applied Mathematics publishes original papers of high scientific value in all areas of computational and applied mathematics. The main interest of the Journal is in papers that describe and analyze new computational techniques for solving scientific or engineering problems. Also the improved analysis, including the effectiveness and applicability, of existing methods and algorithms is of importance. The computational efficiency (e.g. the convergence, stability, accuracy, ...) should be proved and illustrated by nontrivial numerical examples. Papers describing only variants of existing methods, without adding significant new computational properties are not of interest. The audience consists of: applied mathematicians, numerical analysts, computational scientists and engineers.
期刊最新文献
Editorial Board An efficient matrix free optimization algorithm combining a revised PRP and FR-CG type methods with application to robotics Efficient matrix-based quadrature rules for oscillatory integrals with products of two Bessel functions Fröbenius expansions for second-order random differential equations: Stochastic analysis and applications to Lindley-type damping models Spline quasi-interpolating and quasi2-interpolating projectors for the numerical solution of Cauchy singular integral equations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1