Regularizing algorithms with optimal and extra-optimal quality
a posteriori quality estimatealgorithmill-posed probleminverse problemslinearnonlinearnumerical experimentsquality of approximate solutionregularizing algorithmregularizing algorithm with extra-optimal quality
Linear operators and ill-posed problems, regularization (47A52) Nonlinear ill-posed problems (47J06) Numerical solutions to equations with linear operators (65J10) Numerical solutions to equations with nonlinear operators (65J15) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical solution to inverse problems in abstract spaces (65J22)
- scientific article; zbMATH DE number 4046973
- Locally extra-optimal regularizing algorithms
- On regularization algorithms in learning theory
- scientific article; zbMATH DE number 418822
- Regularization techniques and suboptimal solutions to optimization problems in learning from data
- Some considerations concerning regularization and parameter choice algorithms
- Rough Sets and Current Trends in Computing
- Optimal rate of the regularized regression learning algorithm
- scientific article; zbMATH DE number 4022481
- Optimal regularization with two interdependent regularization parameters
- Extra-optimal methods for solving ill-posed problems: survey of theory and examples
- Methods for solving ill-posed extremum problems with optimal and extra-optimal properties
- Locally extra-optimal regularizing algorithms and a posteriori estimates of the accuracy for ill-posed problems with discontinuous solutions
- Locally extra-optimal regularizing algorithms
- A posteriori accuracy estimations of solutions of ill-posed inverse problems and extra-optimal regularizing algorithms for their solution
- Which ill-posed problems are regularizable with a posteriori accuracy estimates?
This page was built for publication: Regularizing algorithms with optimal and extra-optimal quality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963863)