Pages that link to "Item:Q3546942"

The following pages link to Sparse representations in unions of bases (Q3546942):

Displaying 50 items.

• Computing and analyzing recoverable supports for sparse reconstruction (Q269197) (← links)
• The gap between the null space property and the restricted isometry property (Q273151) (← links)
• Conjugate gradient acceleration of iteratively re-weighted least squares methods (Q316180) (← links)
• DC approximation approaches for sparse optimization (Q319281) (← links)
• A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions (Q349012) (← links)
• Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization (Q364458) (← links)
• Two are better than one: fundamental parameters of frame coherence (Q427070) (← links)
• Perturbations of measurement matrices and dictionaries in compressed sensing (Q442524) (← links)
• Existence of the best \(n\)-term approximants for structured dictionaries (Q444118) (← links)
• Sparse time-frequency representation of nonlinear and nonstationary data (Q476519) (← links)
• Sparse dual frames and dual Gabor functions of minimal time and frequency supports (Q485118) (← links)
• Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications (Q489110) (← links)
• On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing (Q492558) (← links)
• DCA based algorithms for feature selection in multi-class support vector machine (Q513636) (← links)
• A modified greedy analysis pursuit algorithm for the cosparse analysis model (Q513670) (← links)
• The null space property for sparse recovery from multiple measurement vectors (Q533503) (← links)
• On uncertainty principles in the finite dimensional setting (Q541940) (← links)
• On the existence of optimal unions of subspaces for data modeling and clustering (Q544805) (← links)
• Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
• The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\) (Q609740) (← links)
• Sparse representations and approximation theory (Q630502) (← links)
• Improved stability conditions of BOGA for noisy block-sparse signals (Q634875) (← links)
• Restricted \(p\)-isometry property and its application for nonconvex compressive sensing (Q695638) (← links)
• On performance of greedy algorithms (Q719355) (← links)
• Analysis of basis pursuit via capacity sets (Q734943) (← links)
• Optimal non-linear models for sparsity and sampling (Q734950) (← links)
• On some deterministic dictionaries supporting sparsity (Q734953) (← links)
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization (Q734955) (← links)
• A null space analysis of the \(\ell_1\)-synthesis method in dictionary-based compressed sensing (Q741266) (← links)
• Phase retrieval for sparse signals (Q741269) (← links)
• Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals (Q741817) (← links)
• Preserving injectivity under subgaussian mappings and its application to compressed sensing (Q778017) (← links)
• A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation (Q778434) (← links)
• Highly sparse representations from dictionaries are unique and independent of the sparseness measure (Q877577) (← links)
• Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm (Q890292) (← links)
• Analysis \(\ell_1\)-recovery with frames and Gaussian measurements (Q904283) (← links)
• A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery (Q905912) (← links)
• On the conditioning of random subdictionaries (Q930731) (← links)
• A note on guaranteed sparse recovery via \(\ell_1\)-minimization (Q984666) (← links)
• Concave programming for minimizing the zero-norm over polyhedral sets (Q989849) (← links)
• When do stepwise algorithms meet subset selection criteria? (Q995431) (← links)
• Lasso-type recovery of sparse representations for high-dimensional data (Q1002157) (← links)
• Nonlinear least squares in \(\mathbb R^{N}\) (Q1038734) (← links)
• Sparse solutions to underdetermined Kronecker product systems (Q1039753) (← links)
• Secure estimation based Kalman filter for cyber-physical systems against sensor attacks (Q1626921) (← links)
• The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\) (Q1666063) (← links)
• Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization (Q1688516) (← links)
• A hierarchical framework for recovery in compressive sensing (Q1693135) (← links)
• A two-level method for sparse time-frequency representation of multiscale data (Q1703872) (← links)
• An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration (Q1716780) (← links)