Fast Nonnegative Least Squares Through Flexible Krylov Subspaces
DOI10.1137/15M1048872zbMath1365.65161arXiv1511.06269OpenAlexW2962832489MaRDI QIDQ5738172
Publication date: 31 May 2017
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.06269
Gaussian noisenumerical experimentimage reconstructionKarush-Kuhn-Tucker conditionsconjugate gradientnonnegative least squaresPoisson noiseflexible Krylov methodsnonnegative linear least squares problems
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Quasi-Newton approach to nonnegative image restorations
- Iterative methods for image deblurring: A Matlab object-oriented approach
- On Krylov projection methods and Tikhonov regularization
- AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
- FGMRES for linear discrete ill-posed problems
- Flexible Conjugate Gradients
- Generalized Arnoldi--Tikhonov Method for Sparse Reconstruction
- Recent computational developments in Krylov subspace methods for linear systems
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- Iterative Solution Methods
- Discrete Inverse Problems
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Covariance-Preconditioned Iterative Methods for Nonnegatively Constrained Astronomical Imaging
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Non-negativity and iterative methods for ill-posed problems