Accuracy-order optimality of the generalized discrepancy principle and some algorithms for solving nonlinear ill-posed problems with approximate data
DOI10.1007/BF00972419zbMath0686.65029MaRDI QIDQ1262702
Publication date: 1988
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Banach spacenonlinear ill-posed problemsoptimal algorithmgeneralized discrepancy principleorder of accuracygeneralized method of discrepancygeneralized quasi-solution principlegeneralized smoothing functional principlemethod of quasisolutionnonlinear incorrect problems
Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15)
Related Items (1)
Cites Work
- A regularizing algorithm for incorrectly formulated problems with an approximately specified operator
- On the connection between the generalized discrepancy method and the generalized discrepancy principle for non-linear ill-posed problems
- Enumeration of nonisomorphic planar maps
- On the choice of regularization parameter when solving ill-posed problems in reflexive spaces
- A generalized discrepancy principle
- ON SOME ALGORITHMS FOR SOLVING ILL-POSED EXTREMAL PROBLEMS
- Use of the regularization method in non-linear problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Accuracy-order optimality of the generalized discrepancy principle and some algorithms for solving nonlinear ill-posed problems with approximate data