{"title":"Convergence analysis of a regularized iterative scheme for solving nonlinear problems","authors":"M.P. Rajan, 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.
期刊介绍:
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.