scientific article; zbMATH DE number 1058089
From MaRDI portal
Publication:4353199
Recommendations
- A fast ``Monte-Carlo cross-validation procedure for large least squares problems with noisy data
- GCV for Tikhonov regularization by partial SVD
- A note on the computation of the generalized cross-validation function for ill-conditioned least squares problems
- GCV for Tikhonov regularization via global Golub-Kahan decomposition.
Cited in
(24)- Error estimates for linear systems with applications to regularization
- Error estimates for the regularization of least squares problems
- Estimates for the generalized cross-validation function via an extrapolation and statistical approach
- GCV for Tikhonov regularization by partial SVD
- Minimization of functionals on the solution of a large-scale discrete ill-posed problem
- Randomized block Krylov subspace methods for trace and log-determinant estimators
- Interpolating log-determinant and trace of the powers of matrix \(\mathbf{A}+ t\mathbf{B}\)
- How to catch a lion in the desert: on the solution of the coverage directed generation (CDG) problem
- Spectral cut-off regularizations for ill-posed linear models
- Randomized matrix-free trace and log-determinant estimators
- Fast generalized cross validation using Krylov subspace methods
- Regularized total least squares based on quadratic eigenvalue problem solvers
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- Generalized cross validation for \(\ell^p\)-\(\ell^q\) minimization
- GCV for Tikhonov regularization via global Golub-Kahan decomposition.
- Newton-type methods and their modifications for inverse heat conduction problems
- Parameter choices for fast harmonic spline approximation
- scientific article; zbMATH DE number 1875401 (Why is no real title available?)
- Interval simulated annealing applied to electrical impedance tomography image reconstruction with fast objective function evaluation
- Fast Generalized Cross-Validation Algorithm for Sparse Model Learning
- Numerical methods for A-optimal designs with a sparsity constraint for ill-posed inverse problems
- A class of template splines
- Regularization using a parameterized trust region subproblem
- UPRE method for total variation parameter selection
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4353199)
