A General Theory of Singular Values with Applications to Signal Denoising
From MaRDI portal
Publication:4561328
DOI10.1137/17M1156149zbMath1408.94861arXiv1705.10881OpenAlexW2963667304MaRDI QIDQ4561328
Publication date: 5 December 2018
Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.10881
Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- On the nuclear norm and the singular value decomposition of tensors
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
- Smoothed state estimates under abrupt changes using sum-of-norms regularization
- \(L^1\) regularization method in electrical impedance tomography by using the \(L^1\)-curve (Pareto frontier curve)
- Multiarray signal processing: tensor decomposition meets compressed sensing
- Locally adaptive regression splines
- On the complexity of the multiplication of matrices of small formats
- An algorithm for total variation minimization and applications
- Local extremes, runs, strings and multiresolution. (With discussion)
- Least angle regression. (With discussion)
- Best rank one approximation of real symmetric tensors can be chosen symmetric
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Exact matrix completion via convex optimization
- Atomic Decomposition by Basis Pursuit
- The Split Bregman Method for L1-Regularized Problems
- Tensor rank is NP-complete
- Decoding by Linear Programming
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- $\ell_1$ Trend Filtering
- A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- A new approach to variable selection in least squares problems
- Nuclear norm of higher-order tensors
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- De-noising by soft-thresholding
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Blind Multilinear Identification
- Most Tensor Problems Are NP-Hard
- Stable signal recovery from incomplete and inaccurate measurements
- Über homogene Polynome in ($L^{2}$)
- A Theory of Cross-Spaces. (AM-26)
- Produits tensoriels topologiques et espaces nucléaires
