Pages that link to "Item:Q351503"

The following pages link to A mathematical introduction to compressive sensing (Q351503):

Displaying 50 items.

• Complex phase retrieval from subgaussian measurements (Q2226993) (← links)
• Phaseless compressive sensing using partial support information (Q2228381) (← links)
• A unifying representer theorem for inverse problems and machine learning (Q2231644) (← links)
• Discrete optimization methods for group model selection in compressed sensing (Q2235146) (← links)
• Thin-shell concentration for random vectors in Orlicz balls via moderate deviations and Gibbs measures (Q2243168) (← links)
• Worst-case recovery guarantees for least squares approximation using random samples (Q2243884) (← links)
• Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time (Q2252137) (← links)
• On the computation of sparse solutions to the controllability problem for discrete-time linear systems (Q2275285) (← links)
• Moment inequalities for matrix-valued U-statistics of order 2 (Q2279328) (← links)
• An extremal problem for integer sparse recovery (Q2282769) (← links)
• Multi-kernel unmixing and super-resolution using the modified matrix pencil method (Q2291571) (← links)
• On sparse beamformer design with reverberation (Q2295315) (← links)
• Erasure recovery matrices for encoder protection (Q2300758) (← links)
• Approximate support recovery of atomic line spectral estimation: a tale of resolution and precision (Q2300766) (← links)
• Sampling schemes and recovery algorithms for functions of few coordinate variables (Q2307488) (← links)
• The sparsest solution of the union of finite polytopes via its nonconvex relaxation (Q2311128) (← links)
• Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements (Q2311914) (← links)
• New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization (Q2312513) (← links)
• Reconstruction of sparse-view tomography via preconditioned Radon sensing matrix (Q2317408) (← links)
• Sparse reconstruction with multiple Walsh matrices (Q2317908) (← links)
• A difference-of-convex functions approach for sparse PDE optimal control problems with nonconvex costs (Q2322559) (← links)
• Truncated sparse approximation property and truncated \(q\)-norm minimization (Q2322801) (← links)
• Lattices from tight frames and vertex transitive graphs (Q2325750) (← links)
• Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization (Q2330928) (← links)
• Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit (Q2330942) (← links)
• Quantized compressed sensing for random circulant matrices (Q2330944) (← links)
• Preconditioning for orthogonal matching pursuit with noisy and random measurements: the Gaussian case (Q2338338) (← links)
• A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids (Q2338485) (← links)
• On some aspects of approximation of ridge functions (Q2344299) (← links)
• Finding sparse solutions of systems of polynomial equations via group-sparsity optimization (Q2349523) (← links)
• Combined first and second order variational approaches for image processing (Q2351702) (← links)
• Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data (Q2359680) (← links)
• Refined analysis of sparse MIMO radar (Q2360571) (← links)
• Average-case complexity without the black swans (Q2360669) (← links)
• Global sensitivity analysis based on high-dimensional sparse surrogate construction (Q2363869) (← links)
• One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations (Q2374380) (← links)
• Recovery analysis for weighted \(\ell_{1}\)-minimization using the null space property (Q2397162) (← links)
• Error bounds for compressed sensing algorithms with group sparsity: A unified approach (Q2399645) (← links)
• Explicit universal sampling sets in finite vector spaces (Q2399652) (← links)
• Low rank tensor recovery via iterative hard thresholding (Q2400255) (← links)
• A new bound on the block restricted isometry constant in compressed sensing (Q2400748) (← links)
• Compressed sensing for finite-valued signals (Q2401311) (← links)
• Entropy numbers of embeddings of Schatten classes (Q2402683) (← links)
• A multi-parameter regularization model for deblurring images corrupted by impulsive noise (Q2405844) (← links)
• A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing (Q2405990) (← links)
• Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing (Q2411691) (← links)
• Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class (Q2415398) (← links)
• Iteratively reweighted \(\ell _1\) algorithms with extrapolation (Q2419549) (← links)
• Sparse Hanson-Wright inequalities for subgaussian quadratic forms (Q2419651) (← links)
• A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees (Q2420230) (← links)