About the balancing principle for choice of the regularization parameter
From MaRDI portal
Recommendations
Cites work
- A Carleman estimate and the balancing principle in the quasi-reversibility method for solving the Cauchy problem for the Laplace equation
- A Lepskij-type stopping rule for regularized Newton methods
- Adaptive kernel methods using the balancing principle
- An a posteriori parameter choice for ordinary and iterated Tikhonov regularization of ill-posed problems leading to optimal convergence rates
- An analysis of Tikhonov regularization for nonlinear ill-posed problems under a general smoothness assumption
- Discretization strategy for linear ill-posed problems in variable Hilbert scales
- Geometry of linear ill-posed problems in variable Hilbert scales
- scientific article; zbMATH DE number 5575696 (Why is no real title available?)
- Interpolation in variable Hilbert scales with application to inverse problems
- Iteratively Regularized Gauss–Newton Method for Nonlinear Inverse Problems with Random Noise
- Local solutions to inverse problems in geodesy. The impact of the noise covariance structure upon the accuracy of estimation
- Numerical differentiation from a viewpoint of regularization theory
- ON NUMERICAL REALIZATION OF QUASIOPTIMAL PARAMETER CHOICES IN (ITERATED) TIKHONOV AND LAVRENTIEV REGULARIZATION
- On the Adaptive Selection of the Parameter in Regularization of Ill-Posed Problems
- On the balancing principle for some problems of numerical analysis
- On the quasioptimal regularization parameter choices for solving ill-posed problems
- Optimal regularization for ill-posed problems in metric spaces
- Regularization of some linear ill-posed problems with discretized random noisy data
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Regularization without preliminary knowledge of smoothness and error behaviour
- Sparse recovery by the standard Tikhonov method
- The balancing principle for the regularization of elliptic Cauchy problems
- The discretized discrepancy principle under general source conditions
- The Lepskii principle revisited
- The use of monotonicity for choosing the regularization parameter in ill-posed problems
- Use of extrapolation in regularization methods
Cited in
(15)- Balancing principle in supervised learning for a general regularization scheme
- On the balancing principle for some problems of numerical analysis
- A family of rules for parameter choice in Tikhonov regularization of ill-posed problems with inexact noise level
- Robust importance sampling with adaptive winsorization
- Regularization of naturally linearized parameter identification problems and the application of the balancing principle
- On the quasi-optimal rules for the choice of the regularization parameter in case of a noisy operator
- Heuristic parameter choice in Tikhonov method from minimizers of the quasi-optimality function
- About regularization of severely ill-posed problems by standard Tikhonov's method with the balancing principle
- Complexity estimates for severely ill-posed problems under a posteriori selection of regularization parameter
- A parameter choice rule for Tikhonov regularization based on predictive risk
- On the Laplacian operation with applications in magnetic resonance electrical impedance imaging
- Monotonicity of error of regularized solution and its use for parameter choice
- Comparing parameter choice methods for regularization of ill-posed problems
- scientific article; zbMATH DE number 4187025 (Why is no real title available?)
- Discrete Legendre spectral projection-based methods for Tikhonov regularization of first kind Fredholm integral equations
This page was built for publication: About the balancing principle for choice of the regularization parameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3405615)
