Krylov Methods for Low-Rank Regularization
From MaRDI portal
Publication:5146618
DOI10.1137/19M1302727zbMath1460.65043arXiv1910.10664MaRDI QIDQ5146618
James G. Nagy, Chang Meng, Silvia Gazzola
Publication date: 26 January 2021
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.10664
Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10)
Related Items (2)
Proximal linearization methods for Schatten \(p\)-quasi-norm minimization ⋮ Numerical methods for CT reconstruction with unknown geometry parameters
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Iterative regularization with minimum-residual methods
- Regularization methods for large-scale problems
- Flexible GMRES for total variation regularization
- On Krylov projection methods and Tikhonov regularization
- IR tools: a MATLAB package of iterative regularization methods and large-scale test problems
- Wavelet domain image restoration with adaptive edge-preserving regularization
- Choosing Regularization Parameters in Iterative Methods for Ill-Posed Problems
- Generalized Arnoldi--Tikhonov Method for Sparse Reconstruction
- Hybrid and Iteratively Reweighted Regularization by Unbiased Predictive Risk and Weighted GCV for Projected Systems
- A Singular Value Thresholding Algorithm for Matrix Completion
- Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
- Low-Rank Tensor Krylov Subspace Methods for Parametrized Linear Systems
- Recent computational developments in Krylov subspace methods for linear systems
- A Low-Rank in Time Approach to PDE-Constrained Optimization
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Smoothed Low Rank and Sparse Matrix Recovery by Iteratively Reweighted Least Squares Minimization
- Flexible Krylov Methods for $\ell_p$ Regularization
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- Discrete Inverse Problems
- A Preconditioned Low-Rank Projection Method with a Rank-Reduction Scheme for Stochastic Partial Differential Equations
- Smoothing‐Norm Preconditioning for Regularizing Minimum‐Residual Methods
- Convex Analysis
This page was built for publication: Krylov Methods for Low-Rank Regularization
