Error estimates for the regularization of least squares problems
From MaRDI portal
Publication:1027769
DOI10.1007/s11075-008-9243-2zbMath1166.65331OpenAlexW1981076909MaRDI QIDQ1027769
Giuseppe Rodriguez, Sebastiano Seatzu, Claude Brezinski
Publication date: 30 June 2009
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-008-9243-2
Related Items (40)
Estimates for the generalized cross-validation function via an extrapolation and statistical approach ⋮ Some matrix nearness problems suggested by Tikhonov regularization ⋮ A stopping criterion for iterative regularization methods ⋮ A stabilized GMRES method for singular and severely ill-conditioned systems of linear equations ⋮ Global Golub-Kahan bidiagonalization applied to large discrete ill-posed problems ⋮ Noise-reducing cascadic multilevel methods for linear discrete ill-posed problems ⋮ Parameter determination for Tikhonov regularization problems in general form ⋮ Scattered data fitting by minimal surface ⋮ Truncation level selection in nonparametric regression using Padé approximation ⋮ The block Lanczos algorithm for linear ill-posed problems ⋮ A special modified Tikhonov regularization matrix for discrete ill-posed problems ⋮ On the choice of subspace for large-scale Tikhonov regularization problems in general form ⋮ A modified truncated singular value decomposition method for discrete ill-posed problems ⋮ Application of denoising methods to regularizationof ill-posed problems ⋮ Parameter choice strategies for error expressions and the numerical stability of Tikhonov-regularized approximation formulae ⋮ A Golub-Kahan-type reduction method for matrix pairs ⋮ Approximation of the Tikhonov regularization parameter through Aitken's extrapolation ⋮ A projection method for general form linear least-squares problems ⋮ An extrapolated TSVD method for linear discrete ill-posed problems with Kronecker structure ⋮ Old and new parameter choice rules for discrete ill-posed problems ⋮ A new variable selection method for uniform designs ⋮ A new Tikhonov regularization method ⋮ Vector estimates for \(f(A)\mathbf b\) via extrapolation ⋮ Sparse approximation of fitting surface by elastic net ⋮ Vector extrapolation applied to truncated singular value decomposition and truncated iteration ⋮ Simplified GSVD computations for the solution of linear discrete ill-posed problems ⋮ Comparing parameter choice methods for regularization of ill-posed problems ⋮ Rescaling the GSVD with application to ill-posed problems ⋮ On the reduction of Tikhonov minimization problems and the construction of regularization matrices ⋮ Inverse problems for regularization matrices ⋮ Regularization parameter determination for discrete ill-posed problems ⋮ A simplified L-curve method as error estimator ⋮ Error estimates for large-scale ill-posed problems ⋮ GCV for Tikhonov regularization via global Golub–Kahan decomposition ⋮ ErresTools ⋮ Estimating the Nonparametric Regression Function by Using Padé Approximation Based on Total Least Squares ⋮ Tuning Parameter Estimation in Penalized Least Squares Methodology ⋮ Simple stopping criteria for the LSQR method applied to discrete ill-posed problems ⋮ Rational (Padé) approximation for estimating the components of the partially-linear regression model ⋮ Moments of a linear operator, with applications to the trace of the inverse of matrices and the solution of equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Error estimates for linear systems with applications to regularization
- A posteriori error estimates for linear equations
- Smoothing noisy data with spline functions: Estimating the correct degree of smoothing by the method of generalized cross-validation
- The prolate matrix
- Regularization tools version \(4.0\) for matlab \(7.3\)
- An adaptive pruning algorithm for the discrete L-curve criterion
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Towards a Generalized Singular Value Decomposition
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Error Estimates for the Solution of Linear Systems
- A Method for Generating Infinite Positive Self-adjoint Test Matrices and Riesz Bases
- Methods of conjugate gradients for solving linear systems
- A study of Auchmuty's error estimate
This page was built for publication: Error estimates for the regularization of least squares problems
