A Storage-Efficient Algorithm for Finding the Regularized Solution of a Large, Inconsistent System of Equations
From MaRDI portal
Publication:3883379
Recommendations
- An iterative algorithm for large size least-squares constrained regularization problems
- An algorithm for finding nonnegative minimal norm solutions of linear systems
- scientific article; zbMATH DE number 1294388
- An algorithm for finding normal solutions of consistent systems of linear equations
- The method of augmented regularized normal equations
Cited in
(14)- A row relaxation method for large minimax problems
- On preconditioning of penalized matrices
- A row relaxation method for large \(l_ 1\) problems
- Accelerating the distributed Kaczmarz algorithm by strong over-relaxation
- Algorithms for the Generalized NTRU Equations and their Storage Analysis
- Solution of sparse rectangular systems using LSQR and Craig
- Convergence results for an accelerated nonlinear Cimmino algorithm
- Algorithm 664
- The adventures of a simple algorithm
- Joint super-resolution image reconstruction and parameter identification in imaging operator: analysis of bilinear operator equations, numerical solution, and application to magnetic particle imaging
- A Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations
- A proximal point algorithm for minimax problems
- Line search acceleration of iterative methods
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
This page was built for publication: A Storage-Efficient Algorithm for Finding the Regularized Solution of a Large, Inconsistent System of Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3883379)