CoSaMP

swMATH8727MaRDI QIDQ20727FDOQ20727

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
• Orthogonal one step greedy procedure for heteroscedastic linear models
• Iterative hard thresholding for compressed sensing
• A tensor decomposition based multiway structured sparse SAR imaging algorithm with Kronecker constraint
• Variable selection for high dimensional Gaussian copula regression model: an adaptive hypothesis testing procedure
• Greedy approximation in convex optimization
• A mathematical introduction to compressive sensing
• A Survey of Compressed Sensing
• Sparse Legendre expansions via \(\ell_1\)-minimization
• A second-order method for strongly convex \(\ell _1\)-regularization problems
• Some greedy algorithms for sparse polynomial chaos expansions
• Coherence pattern-guided compressive sensing with unresolved grids
• A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• 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
• Phase transitions for greedy sparse approximation algorithms
• Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
• A null space analysis of the \(\ell_1\)-synthesis method in dictionary-based compressed sensing
• Fast Phase Retrieval from Local Correlation Measurements
• LOL selection in high dimension
• Spectral compressive sensing
• Theory and applications of compressed sensing
• 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
• Quasi-linear Compressed Sensing
• Convergence of fixed-point continuation algorithms for matrix rank minimization
• Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
• Compressive sensing of analog signals using discrete prolate spheroidal sequences
• Sparse polynomial chaos expansions via compressed sensing and D-optimal design
• Compressed sensing and dynamic mode decomposition
• Compressed blind signal reconstruction model and algorithm
• A numerical exploration of compressed sampling recovery
• An adaptive inverse scale space method for compressed sensing
• Compressed sensing with coherent and redundant dictionaries
• Deterministic convolutional compressed sensing matrices
• Matrix sparsification and the sparse null space problem
• Where did the tumor start? An inverse solver with sparse localization for tumor growth models
• An Algorithm Solving Compressive Sensing Problem Based on Maximal Monotone Operators
• Restricted isometries for partial random circulant matrices
• Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems
• The restricted isometry property for random block diagonal matrices
• Minimization of $\ell_{1-2}$ for Compressed Sensing
• Fast <it>k</it>-selection algorithms for graphics processing units
• Sparse time-frequency representation of nonlinear and nonstationary data
• Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
• Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark
• ADMiRA: Atomic Decomposition for Minimum Rank Approximation
• Deterministic construction of sparse binary matrices via incremental integer optimization
• Robust sparse phase retrieval made easy
• Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression)
• Gradient iteration with \(\ell _{p}\)-norm constraints
• On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
• Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
• A New Computational Method for the Sparsest Solutions to Systems of Linear Equations
• Data-driven time-frequency analysis
• Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
• Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
• Compressive wave computation
• Title not available (Why is that?)
• On performance of greedy algorithms
• Improved bounds for the RIP of Subsampled Circulant matrices
• Compressed sensing SAR imaging based on sparse representation in fractional Fourier domain
• Sparse microwave imaging: principles and applications
• Matrix recipes for hard thresholding methods
• Democracy in action: quantization, saturation, and compressive sensing
• Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
• The restricted isometry property for time-frequency structured random matrices
• Structured sparsity through convex optimization
• NESTA: A fast and accurate first-order method for sparse recovery
• Compressive sensing for subsurface imaging using ground penetrating radar
• Suprema of chaos processes and the restricted isometry property
• The Restricted Isometry Property of Subsampled Fourier Matrices
• Hard thresholding pursuit: an algorithm for compressive sensing
• Deterministic constructions of compressed sensing matrices based on codes
• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
• Compressed sensing: how sharp is the restricted isometry property?
• Approximately normalized iterative hard thresholding for nonlinear compressive sensing
• Splitting matching pursuit method for reconstructing sparse signal in compressed sensing
• Optimized Sampling for Multiscale Dynamics
• On the number of iterations for convergence of CoSaMP and subspace pursuit algorithms
• Restricted strong convexity implies weak submodularity
• On Reconstructing Functions from Binary Measurements
• Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery
• Efficient projected gradient methods for cardinality constrained optimization
• Maximal solutions of sparse analysis regularization
• Weighted lp − l1 minimization methods for block sparse recovery and rank minimization
• Sparse power factorization: balancing peakiness and sample complexity
• Reconstruction of sparse signals in impulsive disturbance environments
• 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 a gradient-based algorithm for sparse signal reconstruction in the signal/measurements domain
• Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
• Spark-level sparsity and the \(\ell_1\) tail minimization
• Deterministic construction of compressed sensing matrices from constant dimension codes
• Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices
• Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
• Alternating direction method of multipliers for solving dictionary learning models

This page was built for software: CoSaMP