New cyclic sparsity measures for deconvolution based on convex relaxation
From MaRDI portal
(Redirected from Publication:736973)
Recommendations
Cites work
- scientific article; zbMATH DE number 4056692 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 733051 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- An affine scaling methodology for best basis selection
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Atomic Decomposition by Basis Pursuit
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Coordinate descent algorithms for lasso penalized regression
- Cyclostationary modeling of ground reaction force signals
- Deconvolution of cyclostationary signals
- Greed is Good: Algorithmic Results for Sparse Approximation
- Least angle regression. (With discussion)
- Matching pursuits with time-frequency dictionaries
- Orthogonal least squares methods and their application to non-linear system identification
- Pathwise coordinate optimization
- Shrinkage rules for variational minimization problems and applications to analytical ultracentrifugation
This page was built for publication: New cyclic sparsity measures for deconvolution based on convex relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q736973)