Algorithms for the regularization of ill-conditioned least squares problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 883145 (Why is no real title available?)
- scientific article; zbMATH DE number 3319895 (Why is no real title available?)
- A Practical Examination of Some Numerical Methods for Linear Discrete Ill-Posed Problems
- A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
- An adaptive numerical method for solving linear Fredholm integral
- Convergence rates of certain approximate solutions to Fredholm integral equations of the first kind
- Generalizing the Singular Value Decomposition
- On moment-discretization and least-squares solutions of linear integral equations of the first kind
- Orthogonal transformations and improperly posed problems
- Practical Approximate Solutions to Linear Operator Equations When the Data are Noisy
- Smoothing by spline functions. II
- Some Modified Matrix Eigenvalue Problems
- The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
Cited in
(89)- An iterative method to compute minimum norm solutions of ill-posed problems in Hilbert spaces
- Methods of minimization of functions on a sphere and their applications
- Application of denoising methods to regularizationof ill-posed problems
- Ill-conditioning of the truncated singular value decomposition, Tikhonov regularization and their applications to numerical partial differential equations.
- An even faster algorithm for ridge regression of reduced rank data
- New POCS algorithms for regularization of inverse problems
- Ill-posed problems: operator methodologies of resolution and regularization
- The truncated SVD as a method for regularization
- Local results for the Gauss-Newton method on constrained rank-deficient nonlinear least squares
- Bibliography on the evaluation of numerical software
- Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem
- Fast model-fitting of Bayesian variable selection regression using the iterative complex factorization algorithm
- The effect of regularization on drug-reaction relationships
- A short-term rational Krylov method for linear inverse problems
- Fast computation of spectral projectors of banded matrices
- A hybrid algorithm for solving linear inequalities in a least squares sense
- Newton-type methods and their modifications for inverse heat conduction problems
- The backus-gilbert method revisited: background, implementation and examples
- Implementations of range restricted iterative methods for linear discrete ill-posed problems
- Convex minimization problems based on an accelerated fixed point algorithm with applications to image restoration problems
- An a posteriori parameter choice for Tikhonov regularization in the presence of modeling error
- Trust-region and other regularisations of linear least-squares problems
- A new zero-finder for Tikhonov regularization
- On the reduction of Tikhonov minimization problems and the construction of regularization matrices
- Alternating Krylov subspace image restoration methods
- Projected Newton method for noise constrained Tikhonov regularization
- The discrete Picard condition for discrete ill-posed problems
- A note on the computation of the generalized cross-validation function for ill-conditioned least squares problems
- Efficient and automatic methods for flexible regression on spatiotemporal data, with applications to groundwater monitoring
- Least squares with a quadratic constraint
- Regularized nonnegative matrix factorization: geometrical interpretation and application to spectral unmixing
- A NOTE ON THE COMPUTATION OF THE BAYESIAN DECOMPOSITION OF A TIME SERIES
- Solving quadratically constrained least squares using black box solvers
- A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold
- A new technique of quaternion equality constrained least squares problem
- Arnoldi-Tikhonov regularization methods
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- A fast ``Monte-Carlo cross-validation procedure for large least squares problems with noisy data
- The block Lanczos algorithm for linear ill-posed problems
- Determination of the bottom deformation from space- and time-resolved water wave measurements
- Tikhonov regularization via flexible Arnoldi reduction
- Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
- Efficient sparsity-promoting MAP estimation for Bayesian linear inverse problems
- Equality constrained least squares problem over quaternion field
- A new stable bidiagonal reduction algorithm
- Operator-theoretic and regularization approaches to ill-posed problems
- An iterative regularizing method for an incomplete boundary data problem for the biharmonic equation
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- An iterative Lagrange method for the regularization of discrete ill-posed inverse problems
- On the emergence of numerical instabilities in next generation reservoir computing
- An accelerated forward-backward algorithm with applications to image restoration problems
- Greedy Tikhonov regularization for large linear ill-posed problems
- Gcvpack – routines for generalized cross validation
- A weighted pseudoinverse, generalized singular values, and constrained least squares problems
- A variant of finite-dimensional Tikhonov regularization with a-posteriori parameter choice
- An accelerated common fixed point algorithm for a countable family of \(G\)-nonexpansive mappings with applications to image recovery
- The iterated Golub-Kahan-Tikhonov method
- Parallel projection methods and the resolution of ill-posed problems
- Regularization using a parameterized trust region subproblem
- Spatial sparse estimation of fiber orientation distribution using deep alternating directions method of multipliers network
- Regression analysis of locality preserving projections via sparse penalty
- Automated data-driven selection of the hyperparameters for total-variation-based texture segmentation
- M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions
- Numerical solution and error estimation of Tikhonov regularization method for an annular inverse electrocardiography problem
- Bias reduction in parameter estimation
- Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications
- Fast alternating direction multipliers method by generalized Krylov subspaces
- Regularization, GSVD and truncated GSVD
- Solution of large linear discrete ill-posed problems by randomized block Krylov methods
- Compact discrepancy and chi-squared principles for over-determined inverse problems
- Numerical realization of an optimal discrepancy principle for Tikhonov- regularization in Hilbert scales
- Orthogonal projection regularization operators
- Low-rank regularized convex-non-convex problems for image segmentation and completion
- Numerical algorithms for a sideways parabolic problem with variable coefficients
- A deterministic approach to optimal regularization —The finite dimensional case—
- Solving a generalization of the p-regularized subproblems by matrix simultaneous diagonalization via congruence
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Real‐time reconstruction of endocardial potential maps in non‐contact cardiac mapping
- Modern regularization methods for inverse problems
- Error estimates for large-scale ill-posed problems
- Relations between SVD and GSVD of discrete regularization problems in standard and general form
- Minimization of functionals on the solution of a large-scale discrete ill-posed problem
- A novel double inertial viscosity algorithm for convex bilevel optimization problems applied to image restoration problems
- Modulus-based iterative methods for constrained Tikhonov regularization
- GKB-FP: An algorithm for large-scale discrete ill-posed problems
- Condition numbers and perturbation analysis for the Tikhonov regularization of discrete ill-posed problems.
- A solution method for compact linear operator equations based on the Arnoldi process
- Algorithms for the computation of functionals defined on the solution of a discrete ill-posed problem
- Fractional graph Laplacian for image reconstruction
This page was built for publication: Algorithms for the regularization of ill-conditioned least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4136482)
