Cited in
(only showing first 100 items - show all)- A new computational method for the sparsest solutions to systems of linear equations
- Compressed sensing based on trust region method
- A Lagrange-Newton algorithm for sparse nonlinear programming
- Compressed sensing: how sharp is the restricted isometry property?
- Compressed sensing reconstruction using expectation propagation
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- Newton method for \(\ell_0\)-regularized optimization
- Orthogonal one step greedy procedure for heteroscedastic linear models
- Bayesian approach with extended support estimation for sparse linear regression
- Newton-type optimal thresholding algorithms for sparse optimization problems
- Iterative hard thresholding for compressed sensing
- Stable recovery of low rank matrices from nuclear norm minimization
- Multi-layer sparse coding: the holistic way
- A tensor decomposition based multiway structured sparse SAR imaging algorithm with Kronecker constraint
- Fusion frames and distributed sparsity
- Variable selection for high dimensional Gaussian copula regression model: an adaptive hypothesis testing procedure
- Splitting matching pursuit method for reconstructing sparse signal in compressed sensing
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- A mathematical introduction to compressive sensing
- Greedy approximation in convex optimization
- PROMP: a sparse recovery approach to lattice-valued signals
- Spectral Compressed Sensing via Projected Gradient Descent
- Sparse Legendre expansions via _1-minimization
- A second-order method for strongly convex \(\ell _1\)-regularization problems
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
- Sparse polynomial chaos expansions: literature survey and benchmark
- Increasing the semantic storage density of sparse distributed memory
- Hierarchical compressed sensing
- Sparse recovery of sound fields using measurements from moving microphones
- Unbiasing in iterative reconstruction algorithms for discrete compressed sensing
- Greedy approximate projection for magnetic resonance fingerprinting with partial volumes
- Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations
- On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
- On the number of iterations for convergence of CoSaMP and subspace pursuit algorithms
- Restricted strong convexity implies weak submodularity
- Optimized Sampling for Multiscale Dynamics
- A plaintext-related image encryption algorithm based on compressive sensing and a novel hyperchaotic system
- Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery
- Fast sparse reconstruction: Greedy inverse scale space flows
- Efficient projected gradient methods for cardinality constrained optimization
- Maximal solutions of sparse analysis regularization
- Bayesian inference for spatio-temporal spike-and-slab priors
- Some greedy algorithms for sparse polynomial chaos expansions
- Sparse approximate solution of partial differential equations
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
- Sparsity based methods for overparameterized variational problems
- A sparse signal reconstruction method based on improved double chains quantum genetic algorithm
- sampling based automatic modulation classifier
- A reweighted symmetric smoothed function approximating \(L_0\)-norm regularized sparse reconstruction method
- Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems
- Perturbation Analysis of Orthogonal Least Squares
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- Coherence pattern-guided compressive sensing with unresolved grids
- Sparse power factorization: balancing peakiness and sample complexity
- A performance guarantee for orthogonal matching pursuit using mutual coherence
- Sparse approximate reconstruction decomposed by two optimization problems
- Analysis of the self projected matching pursuit algorithm
- New analysis of manifold embeddings and signal recovery from compressive measurements
- Reconstruction of sparse signals in impulsive disturbance environments
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- On collaborative compressive sensing systems: the framework, design, and algorithm
- On a gradient-based algorithm for sparse signal reconstruction in the signal/measurements domain
- Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity
- A geometrical stability condition for compressed sensing
- Gaining Outlier Resistance With Progressive Quantiles: Fast Algorithms and Theoretical Studies
- The trimmed Lasso: sparse recovery guarantees and practical optimization by the generalized soft-min penalty
- Weighted \(\ell_1\)-minimization for sparse recovery under arbitrary prior information
- Phase transitions for greedy sparse approximation algorithms
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
- Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence
- A null space analysis of the _1-synthesis method in dictionary-based compressed sensing
- Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
- A theoretical study of compressed solving for advection-diffusion-reaction problems
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
- Fast Phase Retrieval from Local Correlation Measurements
- Spark-level sparsity and the \(\ell_1\) tail minimization
- Deterministic construction of compressed sensing matrices from constant dimension codes
- Global optimization for sparse solution of least squares problems
- A generalized class of hard thresholding algorithms for sparse signal recovery
- LOL selection in high dimension
- Bayesian sparse regularization for multiple force identification and location in time domain
- Spectral compressive sensing
- A tight bound of hard thresholding
- A short note on compressed sensing with partially known signal support
- Theory and applications of compressed sensing
- Fast and RIP-optimal transforms
- Fast thresholding algorithms with feedbacks and partially known support for compressed sensing
- Near oracle performance and block analysis of signal space greedy methods
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Analysis of orthogonal multi-matching pursuit under restricted isometry property
- Robustness of orthogonal matching pursuit under restricted isometry property
- On linguistic variables and sparse representations
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
- Estimation of block sparsity in compressive sensing
- Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Greedy-like algorithms for the cosparse analysis model
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
This page was built for software: CoSaMP
