{"title":"非线性不适定算子方程的启发式迭代Lavrentiev正则化方法","authors":"P. Mahale, Ankit Singh","doi":"10.1553/etna_vol58s450","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the iterative Lavrentiev regularization method for obtaining a stable approximate solution for a nonlinear ill-posed operator equation F (x) = y, where F : D(F ) ⊂ X → X is a nonlinear monotone operator on the Hilbert spaces X . In order to obtain a stable approximate solution using iterative regularization methods, it is important to use a suitable stopping rule to terminate the iterations at the appropriate step. Recently, Qinian Jin and Wei Wang (2018) have proposed a heuristic rule to stop the iterations for the iteratively regularized Gauss-Newton method. The advantage of a heuristic rule over the existing a priori and a posteriori rules is that it does not require accurate information on the noise level, which may not be available or reliable in practical applications. In this paper, we propose a heuristic stopping rule for an iterated Lavrentiev regularization method. We derive error estimates under suitable nonlinearity conditions on the operator F .","PeriodicalId":282695,"journal":{"name":"ETNA - Electronic Transactions on Numerical Analysis","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Iterative Lavrentiev regularization method under a heuristic rule for nonlinear ill-posed operator equations\",\"authors\":\"P. Mahale, Ankit Singh\",\"doi\":\"10.1553/etna_vol58s450\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider the iterative Lavrentiev regularization method for obtaining a stable approximate solution for a nonlinear ill-posed operator equation F (x) = y, where F : D(F ) ⊂ X → X is a nonlinear monotone operator on the Hilbert spaces X . In order to obtain a stable approximate solution using iterative regularization methods, it is important to use a suitable stopping rule to terminate the iterations at the appropriate step. Recently, Qinian Jin and Wei Wang (2018) have proposed a heuristic rule to stop the iterations for the iteratively regularized Gauss-Newton method. The advantage of a heuristic rule over the existing a priori and a posteriori rules is that it does not require accurate information on the noise level, which may not be available or reliable in practical applications. In this paper, we propose a heuristic stopping rule for an iterated Lavrentiev regularization method. We derive error estimates under suitable nonlinearity conditions on the operator F .\",\"PeriodicalId\":282695,\"journal\":{\"name\":\"ETNA - Electronic Transactions on Numerical Analysis\",\"volume\":\"74 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ETNA - Electronic Transactions on Numerical Analysis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1553/etna_vol58s450\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ETNA - Electronic Transactions on Numerical Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1553/etna_vol58s450","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Iterative Lavrentiev regularization method under a heuristic rule for nonlinear ill-posed operator equations
In this paper, we consider the iterative Lavrentiev regularization method for obtaining a stable approximate solution for a nonlinear ill-posed operator equation F (x) = y, where F : D(F ) ⊂ X → X is a nonlinear monotone operator on the Hilbert spaces X . In order to obtain a stable approximate solution using iterative regularization methods, it is important to use a suitable stopping rule to terminate the iterations at the appropriate step. Recently, Qinian Jin and Wei Wang (2018) have proposed a heuristic rule to stop the iterations for the iteratively regularized Gauss-Newton method. The advantage of a heuristic rule over the existing a priori and a posteriori rules is that it does not require accurate information on the noise level, which may not be available or reliable in practical applications. In this paper, we propose a heuristic stopping rule for an iterated Lavrentiev regularization method. We derive error estimates under suitable nonlinearity conditions on the operator F .