Pages that link to "Item:Q1012549"

The following pages link to CoSaMP: Iterative signal recovery from incomplete and inaccurate samples (Q1012549):

Displaying 50 items.

• A sparse signal reconstruction method based on improved double chains quantum genetic algorithm (Q2333565) (← links)
• A reweighted symmetric smoothed function approximating \(L_0\)-norm regularized sparse reconstruction method (Q2333885) (← links)
• Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems (Q2335937) (← links)
• Alternating direction method of multipliers for solving dictionary learning models (Q2343040) (← links)
• Greedy approximation in convex optimization (Q2343051) (← links)
• Near oracle performance and block analysis of signal space greedy methods (Q2344305) (← links)
• Greedy signal space methods for incoherence and beyond (Q2347895) (← links)
• New analysis of manifold embeddings and signal recovery from compressive measurements (Q2347898) (← links)
• Fusion of sparse reconstruction algorithms for multiple measurement vectors (Q2360137) (← links)
• Sparse representation for blind spectrum sensing in cognitive radio: a compressed sensing approach (Q2362610) (← links)
• Global sensitivity analysis based on high-dimensional sparse surrogate construction (Q2363869) (← links)
• Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems (Q2374363) (← links)
• Splitting matching pursuit method for reconstructing sparse signal in compressed sensing (Q2375672) (← links)
• Improved sparse Fourier approximation results: Faster implementations and stronger guarantees (Q2376358) (← links)
• Compressed sensing based on trust region method (Q2398233) (← links)
• Reconstruction of sparse signals in impulsive disturbance environments (Q2399059) (← links)
• Adaptive step-size matching pursuit algorithm for practical sparse reconstruction (Q2402080) (← links)
• On the number of iterations for convergence of CoSaMP and subspace pursuit algorithms (Q2402492) (← links)
• Quantization of compressive samples with stable and robust recovery (Q2409038) (← links)
• Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields (Q2410045) (← links)
• Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing (Q2411691) (← links)
• Arbitrary block-sparse signal reconstruction based on incomplete single measurement vector (Q2411715) (← links)
• Compressed sensing construction for underdetermined source separation (Q2411721) (← links)
• Phase retrieval via sparse Wirtinger flow (Q2423599) (← links)
• A simple homotopy proximal mapping algorithm for compressive sensing (Q2425244) (← links)
• Greedy-like algorithms for the cosparse analysis model (Q2437331) (← links)
• Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices (Q2437333) (← links)
• Fast and RIP-optimal transforms (Q2514234) (← links)
• Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery (Q2515314) (← links)
• Nonconvex sorted \(\ell_1\) minimization for sparse approximation (Q2516375) (← links)
• Newton method for \(\ell_0\)-regularized optimization (Q2665935) (← links)
• Sparse signal recovery from phaseless measurements via hard thresholding pursuit (Q2667051) (← links)
• The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing (Q2672726) (← links)
• Newton-type optimal thresholding algorithms for sparse optimization problems (Q2676159) (← links)
• Compressive Sensing (Q2789803) (← links)
• Noise-Shaping Quantization Methods for Frame-Based and Compressive Sampling Systems (Q2799920) (← links)
• On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms (Q2800370) (← links)
• Guaranteed sparse signal recovery with highly coherent sensing matrices (Q2817269) (← links)
• A reducing iteration orthogonal matching pursuit algorithm for compressive sensing (Q2825253) (← links)
• Theory and applications of compressed sensing (Q2864809) (← links)
• Sparse approximation and recovery by greedy algorithms in Banach spaces (Q2879425) (← links)
• Suprema of chaos processes and the restricted isometry property (Q2929397) (← links)
• Performance comparisons of greedy algorithms in compressed sensing (Q2948099) (← links)
• A Generalized Class of Hard Thresholding Algorithms for Sparse Signal Recovery (Q2950600) (← links)
• Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations (Q2953202) (← links)
• On optimal solutions of the constrained <i>ℓ</i> ₀ regularization and its penalty problem (Q2965692) (← links)
• BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING (Q2971048) (← links)
• On Linguistic Variables and Sparse Representations (Q2974681) (← links)
• COMPRESSED SENSING BY ITERATIVE THRESHOLDING OF GEOMETRIC WAVELETS: A COMPARING STUDY (Q3084699) (← links)
• Average Performance of the Sparsest Approximation Using a General Dictionary (Q3173502) (← links)