CoSaMP
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration
- Sparse signal recovery via ECME thresholding pursuits
- Newton method for \(\ell_0\)-regularized optimization
- Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence
- Newton-type optimal thresholding algorithms for sparse optimization problems
- \(h\)-\(p\) adaptive model based approximation of moment free sensitivity indices
- Data-driven algorithm selection and tuning in optimization and signal processing
- 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
- On the number of iterations for convergence of CoSaMP and subspace pursuit algorithms
- Multi-layer sparse coding: the holistic way
- An effective algorithm for the spark of sparse binary measurement matrices
- Quantized compressed sensing for random circulant matrices
- Perturbation Analysis of Orthogonal Least Squares
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets
- A unified primal dual active set algorithm for nonconvex sparse recovery
- Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time
- On collaborative compressive sensing systems: the framework, design, and algorithm
- Restricted strong convexity implies weak submodularity
- Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems
- Adaptive decomposition-based evolutionary approach for multiobjective sparse reconstruction
- Stochastic greedy algorithms for multiple measurement vectors
- Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables
- A new smoothed L0 regularization approach for sparse signal recovery
- Global sensitivity analysis based on high-dimensional sparse surrogate construction
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
- Weighted thresholding homotopy method for sparsity constrained optimization
- Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
- scientific article; zbMATH DE number 6982922 (Why is no real title available?)
- scientific article; zbMATH DE number 7370529 (Why is no real title available?)
- scientific article; zbMATH DE number 7370639 (Why is no real title available?)
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing
- Deterministic construction of compressed sensing matrices from constant dimension codes
- A hierarchical Bayesian-MAP approach to inverse problems in imaging
- Alternating direction method of multipliers for solving dictionary learning models
- Structured sparsity: discrete and convex approaches
- Iterative hard thresholding for compressed data separation
- A smoothing method for sparse optimization over convex sets
- Weighted \(l_p- l_1\) minimization methods for block sparse recovery and rank minimization
- Analysis non-sparse recovery for relaxed ALASSO
- 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
- Efficiency of orthogonal super greedy algorithm under the restricted isometry property
- Zeroth-order regularized optimization (ZORO): approximately sparse gradients and adaptive sampling
- Quantization of compressive samples with stable and robust recovery
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
- Deterministic construction of compressed sensing matrices with characters over finite fields
- Distribution agnostic Bayesian compressive sensing with incremental support estimation
- A null-space-based weightedl1minimization approach to compressed sensing
- Optimized Sampling for Multiscale Dynamics
- Efficient projected gradient methods for cardinality constrained optimization
- Maximal solutions of sparse analysis regularization
- Reconstruction of sparse signals in impulsive disturbance environments
- RBF-network based sparse signal recovery algorithm for compressed sensing reconstruction
- Compressive sensing with redundant dictionaries and structured measurements
- Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- A tight bound of hard thresholding
- Generalized greedy alternatives
- Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices
- Preserving injectivity under subgaussian mappings and its application to compressed sensing
- Adaptive projected gradient thresholding methods for constrained \(l_0\) problems
- Performance comparisons of greedy algorithms in compressed sensing.
- On a simple derivation of the complementary matching pursuit
- A theoretical study of compressed solving for advection-diffusion-reaction problems
- Error in the reconstruction of nonsparse images
- Sparse signals recovery from noisy measurements by orthogonal matching pursuit
- Compressive sensing-based wind speed estimation for low-altitude wind-shear with airborne phased array radar
- Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries
- Sampling in the analysis transform domain
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Orthogonal rank-one matrix pursuit for low rank matrix completion
- Distributed compressed sensing based joint detection and tracking for multistatic radar system
- Spark-level sparsity and the \(\ell_1\) tail minimization
- Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm
- Gaining Outlier Resistance With Progressive Quantiles: Fast Algorithms and Theoretical Studies
- Hard thresholding pursuit algorithms: number of iterations
- Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
- GPU accelerated greedy algorithms for compressed sensing
- Flavors of compressive sensing
- Stable recovery of low rank matrices from nuclear norm minimization
- Dictionary-sparse recovery via thresholding-based algorithms
- Solving inverse problems using data-driven models
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
- An algebraic perspective on integer sparse recovery
- Greedy signal space methods for incoherence and beyond
- A Greedy Algorithm for Sparse Precision Matrix Approximation
- Estimation of block sparsity in compressive sensing
- Using B-spline frames to represent solutions of acoustics scattering problems
- Nonlinear Variable Selection via Deep Neural Networks
- Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery
- Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP
- New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
This page was built for software: CoSaMP
