Convergence analysis of a regularized iterative scheme for solving nonlinear problems

IF 1.8 2区 数学 Q1 MATHEMATICS
M.P. Rajan, Niloopher Salam
{"title":"Convergence analysis of a regularized iterative scheme for solving nonlinear problems","authors":"M.P. Rajan,&nbsp;Niloopher Salam","doi":"10.1016/j.jco.2025.101972","DOIUrl":null,"url":null,"abstract":"<div><div>Nonlinear inverse and ill-posed problems occur in many practical applications and the regularization techniques are employed to get a stable approximate solution for the same. Although many schemes are available in literature, iterative regularization techniques are the most commonly used approaches. One such important method is the Levenberg-Marquardt scheme. However, the scheme involves computation of the Fréchet derivative at every iterate which makes it tedious and the restrictive assumptions on it often difficult to verify for practical scenarios. In this paper, we propose a simplified Levenberg-Marquardt scheme that has two benefits. Firstly, computation of the Fréchet derivative is required only once at the initial point and secondly, the convergence and optimal convergence rate of the method is established with weaker assumptions as compared to the standard method. We also provide numerical examples to illustrate the theory and, results clearly illustrate the advantages of the proposed scheme over the standard method.</div></div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"91 ","pages":"Article 101972"},"PeriodicalIF":1.8000,"publicationDate":"2025-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Complexity","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0885064X25000500","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Nonlinear inverse and ill-posed problems occur in many practical applications and the regularization techniques are employed to get a stable approximate solution for the same. Although many schemes are available in literature, iterative regularization techniques are the most commonly used approaches. One such important method is the Levenberg-Marquardt scheme. However, the scheme involves computation of the Fréchet derivative at every iterate which makes it tedious and the restrictive assumptions on it often difficult to verify for practical scenarios. In this paper, we propose a simplified Levenberg-Marquardt scheme that has two benefits. Firstly, computation of the Fréchet derivative is required only once at the initial point and secondly, the convergence and optimal convergence rate of the method is established with weaker assumptions as compared to the standard method. We also provide numerical examples to illustrate the theory and, results clearly illustrate the advantages of the proposed scheme over the standard method.
求解非线性问题的正则迭代格式的收敛性分析
在实际应用中经常遇到非线性逆问题和不适定问题,本文采用正则化技术得到了这些问题的稳定近似解。虽然文献中有许多方案可用,但迭代正则化技术是最常用的方法。其中一个重要的方法是Levenberg-Marquardt格式。然而,该方案涉及到在每次迭代中计算fr切特导数,这使得它很繁琐,并且它的限制性假设通常难以在实际场景中验证。在本文中,我们提出了一个简化的Levenberg-Marquardt格式,它有两个好处。首先,在初始点只需要计算一次fr切特导数;其次,与标准方法相比,该方法的收敛性和最优收敛率的假设较弱。我们还提供了数值例子来说明理论,结果清楚地说明了所提出的方案相对于标准方法的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Complexity
Journal of Complexity 工程技术-计算机:理论方法
CiteScore
3.10
自引率
17.60%
发文量
57
审稿时长
>12 weeks
期刊介绍: The multidisciplinary Journal of Complexity publishes original research papers that contain substantial mathematical results on complexity as broadly conceived. Outstanding review papers will also be published. In the area of computational complexity, the focus is on complexity over the reals, with the emphasis on lower bounds and optimal algorithms. The Journal of Complexity also publishes articles that provide major new algorithms or make important progress on upper bounds. Other models of computation, such as the Turing machine model, are also of interest. Computational complexity results in a wide variety of areas are solicited. Areas Include: • Approximation theory • Biomedical computing • Compressed computing and sensing • Computational finance • Computational number theory • Computational stochastics • Control theory • Cryptography • Design of experiments • Differential equations • Discrete problems • Distributed and parallel computation • High and infinite-dimensional problems • Information-based complexity • Inverse and ill-posed problems • Machine learning • Markov chain Monte Carlo • Monte Carlo and quasi-Monte Carlo • Multivariate integration and approximation • Noisy data • Nonlinear and algebraic equations • Numerical analysis • Operator equations • Optimization • Quantum computing • Scientific computation • Tractability of multivariate problems • Vision and image understanding.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信