An adaptive pruning algorithm for the discrete L-curve criterion
From MaRDI portal
Publication:2508955
DOI10.1016/j.cam.2005.09.026zbMath1101.65044OpenAlexW2007939363MaRDI QIDQ2508955
Toke Koldborg Jensen, Per Christian Hansen, Giuseppe Rodriguez
Publication date: 20 October 2006
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2005.09.026
algorithmregularizationnumerical examplessingular value decompositionleast squares methodconjugate gradientL-curve criteriondiscrete ill-posed problemsparameter-choice method
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22)
Related Items
Noise-reducing cascadic multilevel methods for linear discrete ill-posed problems, Parameter determination for Tikhonov regularization problems in general form, Regularized Inversion of Multi-Frequency EM Data in Geophysical Applications, The L-curve criterion as a model selection tool in PLS regression, Regularized minimal-norm solution of an overdetermined system of first kind integral equations, Range restricted iterative methods for linear discrete ill-posed problems, A Semi-Analytical Method for the 3D Elastic Structural-Acoustic Radiation in Shallow Water, A projection method for general form linear least-squares problems, Numerical considerations of block GMRES methods when applied to linear discrete ill-posed problems, The minimal-norm Gauss-Newton method and some of its regularized variants, Old and new parameter choice rules for discrete ill-posed problems, FGMRES for linear discrete ill-posed problems, A new \(L\)-curve for ill-posed problems, Regularization tools version \(4.0\) for matlab \(7.3\), Determination of singular value truncation threshold for regularization in ill-posed problems, Residual whiteness principle for parameter-free image restoration, On an improved-Levin oscillatory quadrature method, Comparing parameter choice methods for regularization of ill-posed problems, Lanczos based preconditioner for discrete ill-posed problems, Two new efficient iterative regularization methods for image restoration problems, Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares, Schultz matrix iteration based method for stable solution of discrete ill-posed problems, Regularization parameter determination for discrete ill-posed problems, An efficient method to set up a Lanczos based preconditioner for discrete ill-posed problems, Error estimates for linear systems with applications to regularization, Automatic stopping rule for iterative methods in discrete ill-posed problems, Determination of the bottom deformation from space- and time-resolved water wave measurements, Error estimates for the regularization of least squares problems, corner.m, FDEMtools: a Matlab package for FDEM data inversion, Identification of the source function for a seawater intrusion problem in unconfined aquifer, Extension of GKB‐FP algorithm to large‐scale general‐form Tikhonov regularization, Parameter Choices for Fast Harmonic Spline Approximation, An inverse POD-RBF network approach to parameter estimation in mechanics
Uses Software
Cites Work
- Unnamed Item
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Deconvolution and regularization with Toeplitz matrices
- The triangle method for finding the corner of the L-curve
- Limitations of the \(L\)-curve method in ill-posed problems
- Efficient determination of multiple regularization parameters in a generalized L-curve framework
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Non-convergence of the L-curve regularization parameter selection method