A simplified L-curve method as error estimator
From MaRDI portal
Publication:2303352
Abstract: The L-curve method is a well-known heuristic method for choosing the regularization parameter for ill-posed problems by selecting it according to the maximal curvature of the L-curve. In this article, we propose a simplified version that replaces the curvature essentially by the derivative of the parameterization on the -axis. This method shows a similar behaviour to the original L-curve method, but unlike the latter, it may serve as an error estimator under typical conditions. Thus, we can accordingly prove convergence for the simplified L-curve method.
Recommendations
- Using the \(L\)-curve for determining optimal regularization parameters
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- Numerical aspects in locating the corner of the L-curve
- Limitations of the \(L\)-curve method in ill-posed problems
- A method for choosing regularization parameters based on a model function and the L-curve
Cites work
- \(L\)-curve curvature bounds via Lanczos bidiagonalization
- A family of rules for parameter choice in Tikhonov regularization of ill-posed problems with inexact noise level
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A mathematical procedure for solving the inverse potential problem of electrocardiography. Analysis of the time-space accuracy from in vitro experimental data
- A numerical study of heuristic parameter choice rules for total variation regularization
- A Regularization Parameter in Discrete Ill-Posed Problems
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- Comparing parameter choice methods for regularization of ill-posed problems
- Comparison of parameter choices in regularization algorithms in case of different information about noise level
- Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
- Discretization independent convergence rates for noise level-free parameter choice rules for the regularization of ill-conditioned problems
- ErresTools
- Error estimates for linear systems with applications to regularization
- Error estimates for the regularization of least squares problems
- Heuristic parameter selection based on functional minimization: optimality and model function approach
- scientific article; zbMATH DE number 618067 (Why is no real title available?)
- scientific article; zbMATH DE number 883145 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- IR tools: a MATLAB package of iterative regularization methods and large-scale test problems
- L- and V-curves for optimal smoothing
- Limitations of the \(L\)-curve method in ill-posed problems
- Morozov's principle for the augmented Lagrangian method applied to linear inverse problems
- Non-convergence of the L-curve regularization parameter selection method
- Numerical comparison of regularization algorithms for solving ill-posed problems
- Old and new parameter choice rules for discrete ill-posed problems
- ON NUMERICAL REALIZATION OF QUASIOPTIMAL PARAMETER CHOICES IN (ITERATED) TIKHONOV AND LAVRENTIEV REGULARIZATION
- On the convergence of the quasioptimality criterion for (iterated) Tikhonov regularization
- On the quasioptimal regularization parameter choices for solving ill-posed problems
- Regularization Parameter Selection in Discrete Ill-Posed Problems — The Use of the U-Curve
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Remarks on choosing a regularization parameter using the quasi-optimality and ratio criterion
- The convergence of a new heuristic parameter selection criterion for general regularization methods
- The quasi-optimality criterion in the linear functional strategy
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
Cited in
(30)- A novel modified TRSVD method for large-scale linear discrete ill-posed problems
- On the choice of regularization matrix for an \(\ell_2\)-\(\ell_q\) minimization method for image restoration
- Tensor Krylov subspace methods with an invertible linear transform product applied to image processing
- Tensor Arnoldi-Tikhonov and GMRES-type methods for ill-posed problems with a t-product structure
- Krylov subspace split Bregman methods
- A gradient-based regularization algorithm for the Cauchy problem in steady-state anisotropic heat conduction
- Weighted tensor Golub-Kahan-Tikhonov-type methods applied to image processing using a t-product
- Golub-Kahan vs. Monte Carlo: a comparison of bidiagonlization and a randomized SVD method for the solution of linear discrete ill-posed problems
- Generalized cross validation for \(\ell^p\)-\(\ell^q\) minimization
- An Arnoldi-based preconditioner for iterated Tikhonov regularization
- Adaptive cross approximation for Tikhonov regularization in general form
- Solution of ill-posed problems with Chebfun
- Identification of discontinuous parameters by regularization for curve representations
- Error estimates for Golub–Kahan bidiagonalization with Tikhonov regularization for ill–posed operator equations
- Regularization for the inversion of fibre Bragg grating spectra
- Limited memory restarted ^p-^q minimization methods using generalized Krylov subspaces
- Some numerical aspects of Arnoldi-Tikhonov regularization
- A numerical comparison of some heuristic stopping rules for nonlinear Landweber iteration
- Range restricted iterative methods for linear discrete ill-posed problems
- Numerical considerations of block GMRES methods when applied to linear discrete ill-posed problems
- FDM-based alternating iterative algorithms for inverse BVPs in 2D steady-state anisotropic heat conduction with heat sources
- Alternative Arnoldi process for ill-conditioned tensor equations with application to image restoration
- Solution of large linear discrete ill-posed problems by randomized block Krylov methods
- Projected iterated Tikhonov in general form with adaptive choice of the regularization parameter
- Flexible iterative methods for linear systems of equations with multiple right-hand sides
- A solution method for compact linear operator equations based on the Arnoldi process
- Convergence analysis and parameter estimation for the iterated Arnoldi-Tikhonov method
- Solution of linear ill-posed operator equations by modified truncated singular value expansion
- Iterated Tikhonov regularization of large linear problems
- Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications
This page was built for publication: A simplified L-curve method as error estimator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2303352)
