Sparse decomposition by iterating Lipschitzian-type mappings

DOI10.1016/J.TCS.2016.04.025zbMATH Open1361.65013OpenAlexW2394499918WikidataQ59538784 ScholiaQ59538784MaRDI QIDQ517031FDOQ517031

Authors: Alessandro Adamo, Giuliano Grossi, Raffaella Lanzarotti, Jianyi Lin 

Publication date: 16 March 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.025

Recommendations

• On sparse solutions of underdetermined linear systems
• An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
• Algorithms on the sparse solution of under-determined linear systems
• Iteratively reweighted least squares minimization for sparse recovery
• A new iterative firm-thresholding algorithm for inverse problems with sparsity constraints

zbMATH Keywords

combinatorial optimizationnumerical examplessparse recoverysparse solutionsLipschitzian mappingsfast iterative methodfixed-point iteration schemesmooth \(\ell_0\)-normsmooth \(\ell_1\)-normunderdetermined linear systems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Combinatorial optimization (90C27) Iterative numerical methods for linear systems (65F10)

Cites Work

• Least angle regression. (With discussion)
• Ideal spatial adaptation by wavelet shrinkage
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Atomic Decomposition by Basis Pursuit
• Matching pursuits with time-frequency dictionaries
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Compressive sampling
• Stable signal recovery from incomplete and inaccurate measurements
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Sparse and redundant representations. From theory to applications in signal and image processing.
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• De-noising by soft-thresholding
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Compressed sensing and best \(k\)-term approximation
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
• Reweighted \(\ell_1\)-minimization for sparse solutions to underdetermined linear systems
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• Sparse Approximate Solutions to Linear Systems
• Introduction to Applied Nonlinear Dynamical Systems and Chaos
• A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
• A generalized uncertainty principle and sparse representation in pairs of bases
• Highly sparse representations from dictionaries are unique and independent of the sparseness measure

Cited In (2)

• Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations
• The iterative fraction thresholding algorithm in sparse information processing

Uses Software

• PDCO
• CoSaMP

This page was built for publication: Sparse decomposition by iterating Lipschitzian-type mappings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q517031)