Estimation of the L-curve via Lanczos bidiagonalization
From MaRDI portal
Publication:1963908
DOI10.1023/A:1022383005969zbMATH Open0945.65044MaRDI QIDQ1963908FDOQ1963908
Authors: Gene H. Golub, Daniela Calvetti, Lothar Reichel 
Publication date: 5 October 2000
Published in: BIT (Search for Journal in Brave)
Recommendations
- \(L\)-curve curvature bounds via Lanczos bidiagonalization
- An \(L\)-ribbon for large underdetermined linear discrete ill-posed problems
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- A regularizing L-curve Lanczos method for underdetermined linear systems
regularizationpartial Lanczos bidiagonalization\(L\)-curve\(L\)-ribbonill-conditioned systems of linear equations
Cited In (53)
- Alternative Arnoldi process for ill-conditioned tensor equations with application to image restoration
- Color image and video restoration using tensor CP decomposition
- Convex constrained optimization for large-scale generalized Sylvester equations
- A survey on variational characterizations for nonlinear eigenvalue problems
- Analysis of directed networks via partial singular value decomposition and Gauss quadrature
- A preconditioned multiple shooting shadowing algorithm for the sensitivity analysis of chaotic systems
- Lanczos based preconditioner for discrete ill-posed problems
- Regularization parameter determination for discrete ill-posed problems
- Some results on the regularization of LSQR for large-scale discrete ill-posed problems
- Some matrix nearness problems suggested by Tikhonov regularization
- Lanczos tridiagonalization and core problems
- A hybrid LSMR algorithm for large-scale Tikhonov regularization
- Tensor Krylov subspace methods via the Einstein product with applications to image and video processing
- Title not available (Why is that?)
- RBF approximation of three dimensional PDEs using tensor Krylov subspace methods
- Projected Newton method for noise constrained Tikhonov regularization
- Efficient determination of the hyperparameter in regularized total least squares problems
- Large-scale Tikhonov regularization via reduction by orthogonal projection
- An algorithm for image denoising with automatic noise estimate
- The triangle method for finding the corner of the L-curve
- Regula falsi based automatic regularization method for PDE constrained optimization
- Seismic wavefield redatuming with regularized multi-dimensional deconvolution
- A new \(L\)-curve for ill-posed problems
- The block Lanczos algorithm for linear ill-posed problems
- Discrete cosine transform LSQR methods for multidimensional ill-posed problems
- A computable error bound for matrix functionals
- An efficient Gauss-Newton algorithm for solving regularized total least squares problems
- A new method for solving linear ill-posed problems
- Large scale least squares scattered data fitting
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- Old and new parameter choice rules for discrete ill-posed problems
- Greedy Tikhonov regularization for large linear ill-posed problems
- An iterative Lagrange method for the regularization of discrete ill-posed inverse problems
- An \(L\)-ribbon for large underdetermined linear discrete ill-posed problems
- A new variant of L-curve for Tikhonov regularization
- A fast truncated Lagrange method for large-scale image restoration problems
- The Lagrange method for the regularization of discrete ill-posed problems
- GCV for Tikhonov regularization via global Golub-Kahan decomposition.
- Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches
- Golub-Kahan vs. Monte Carlo: a comparison of bidiagonlization and a randomized SVD method for the solution of linear discrete ill-posed problems
- A global Lanczos method for image restoration
- Tikhonov regularization with MTRSVD method for solving large-scale discrete ill-posed problems
- A Bayesian interpretation of the L-curve
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- A new LAD curve-fitting algorithm: Slightly overdetermined equation systems in \(L_ 1\)
- Square regularization matrices for large linear discrete ill-posed problems.
- A framework for regularization via operator approximation
- Error estimates for large-scale ill-posed problems
- Minimization of functionals on the solution of a large-scale discrete ill-posed problem
- Conditional gradient Tikhonov method for a convex optimization problem in image restoration
- Sylvester Tikhonov-regularization methods in image restoration
- GKB-FP: An algorithm for large-scale discrete ill-posed problems
- A regularizing L-curve Lanczos method for underdetermined linear systems
This page was built for publication: Estimation of the \(L\)-curve via Lanczos bidiagonalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963908)
