求解单调非线性方程和信号恢复问题的新三项共轭梯度算法

IF 1.7 4区 数学 Q2 MATHEMATICS, APPLIED International Journal of Computer Mathematics Pub Date : 2023-07-23 DOI:10.1080/00207160.2023.2239947
A. Abubakar, P. Kumam, Jin-kui Liu, Hassan Mohammad, C. Tammer
{"title":"求解单调非线性方程和信号恢复问题的新三项共轭梯度算法","authors":"A. Abubakar, P. Kumam, Jin-kui Liu, Hassan Mohammad, C. Tammer","doi":"10.1080/00207160.2023.2239947","DOIUrl":null,"url":null,"abstract":"This work presents a new three-term projection algorithm for solving nonlinear monotone equations. The paper is aimed at constructing an efficient and competitive algorithm for finding approximate solutions of nonlinear monotone equations. This is based on a new choice of the conjugate gradient direction which satisfies the sufficient descent condition. The convergence of the algorithm is shown under Lipschitz continuity and monotonicity of the involved operator. Numerical experiments presented in the paper show that the algorithm needs a less number of iterations in comparison with existing algorithms. Furthermore, the proposed algorithm is applied to solve signal recovery problems.","PeriodicalId":13911,"journal":{"name":"International Journal of Computer Mathematics","volume":null,"pages":null},"PeriodicalIF":1.7000,"publicationDate":"2023-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New three-term conjugate gradient algorithm for solving monotone nonlinear equations and signal recovery problems\",\"authors\":\"A. Abubakar, P. Kumam, Jin-kui Liu, Hassan Mohammad, C. Tammer\",\"doi\":\"10.1080/00207160.2023.2239947\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work presents a new three-term projection algorithm for solving nonlinear monotone equations. The paper is aimed at constructing an efficient and competitive algorithm for finding approximate solutions of nonlinear monotone equations. This is based on a new choice of the conjugate gradient direction which satisfies the sufficient descent condition. The convergence of the algorithm is shown under Lipschitz continuity and monotonicity of the involved operator. Numerical experiments presented in the paper show that the algorithm needs a less number of iterations in comparison with existing algorithms. Furthermore, the proposed algorithm is applied to solve signal recovery problems.\",\"PeriodicalId\":13911,\"journal\":{\"name\":\"International Journal of Computer Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2023-07-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computer Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1080/00207160.2023.2239947\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1080/00207160.2023.2239947","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种新的求解非线性单调方程的三项投影算法。本文的目的是构造一个求非线性单调方程近似解的有效的竞争性算法。这是基于对满足下降充分条件的共轭梯度方向的一种新的选择。在Lipschitz连续性和所涉及算子单调性条件下,证明了算法的收敛性。数值实验表明,与现有算法相比,该算法所需的迭代次数较少。并将该算法应用于解决信号恢复问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
New three-term conjugate gradient algorithm for solving monotone nonlinear equations and signal recovery problems
This work presents a new three-term projection algorithm for solving nonlinear monotone equations. The paper is aimed at constructing an efficient and competitive algorithm for finding approximate solutions of nonlinear monotone equations. This is based on a new choice of the conjugate gradient direction which satisfies the sufficient descent condition. The convergence of the algorithm is shown under Lipschitz continuity and monotonicity of the involved operator. Numerical experiments presented in the paper show that the algorithm needs a less number of iterations in comparison with existing algorithms. Furthermore, the proposed algorithm is applied to solve signal recovery problems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
3.60
自引率
0.00%
发文量
72
审稿时长
5 months
期刊介绍: International Journal of Computer Mathematics (IJCM) is a world-leading journal serving the community of researchers in numerical analysis and scientific computing from academia to industry. IJCM publishes original research papers of high scientific value in fields of computational mathematics with profound applications to science and engineering. IJCM welcomes papers on the analysis and applications of innovative computational strategies as well as those with rigorous explorations of cutting-edge techniques and concerns in computational mathematics. Topics IJCM considers include: • Numerical solutions of systems of partial differential equations • Numerical solution of systems or of multi-dimensional partial differential equations • Theory and computations of nonlocal modelling and fractional partial differential equations • Novel multi-scale modelling and computational strategies • Parallel computations • Numerical optimization and controls • Imaging algorithms and vision configurations • Computational stochastic processes and inverse problems • Stochastic partial differential equations, Monte Carlo simulations and uncertainty quantification • Computational finance and applications • Highly vibrant and robust algorithms, and applications in modern industries, including but not limited to multi-physics, economics and biomedicine. Papers discussing only variations or combinations of existing methods without significant new computational properties or analysis are not of interest to IJCM. Please note that research in the development of computer systems and theory of computing are not suitable for submission to IJCM. Please instead consider International Journal of Computer Mathematics: Computer Systems Theory (IJCM: CST) for your manuscript. Please note that any papers submitted relating to these fields will be transferred to IJCM:CST. Please ensure you submit your paper to the correct journal to save time reviewing and processing your work. Papers developed from Conference Proceedings Please note that papers developed from conference proceedings or previously published work must contain at least 40% new material and significantly extend or improve upon earlier research in order to be considered for IJCM.
期刊最新文献
On frame diagonalization of square matrices Convergence of Runge–Kutta-based convolution quadrature for semilinear fractional differential equations Numerical investigation of the mesh-free collocation approach for solving third kind VIEs with nonlinear vanishing delays A novel coupled p(x) and fractional PDE denoising model with theoretical results Projection and modified projection methods for nonlinear Hammerstein integral equations on the real line using Hermite polynomials
×
引用
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