Pages that link to "Item:Q351503"

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

Displaying 37 items.

• Analysis of sparse recovery for Legendre expansions using envelope bound (Q6090395) (← links)
• Doubly iteratively reweighted algorithm for constrained compressed sensing models (Q6097766) (← links)
• A unified approach to uniform signal recovery from nonlinear observations (Q6101267) (← links)
• Robust one-bit compressed sensing with partial circulant matrices (Q6104014) (← links)
• Optimal Reaction Coordinates: Variational Characterization and Sparse Computation (Q6109132) (← links)
• Hay from the haystack: explicit examples of exponential quantum circuit complexity (Q6109366) (← links)
• Random sections of \(\ell_p\)-ellipsoids, optimal recovery and Gelfand numbers of diagonal operators (Q6110421) (← links)
• A wonderful triangle in compressed sensing (Q6122304) (← links)
• Norms of structured random matrices (Q6130287) (← links)
• A Variable Density Sampling Scheme for Compressive Fourier Transform Interferometry (Q6133995) (← links)
• Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems (Q6134435) (← links)
• Heavy-ball-based hard thresholding algorithms for sparse signal recovery (Q6137779) (← links)
• Time-frequency analysis on flat tori and Gabor frames in finite dimensions (Q6138934) (← links)
• Structured model selection via ℓ1−ℓ2 optimization (Q6141559) (← links)
• Sampling rates for \(\ell^1\)-synthesis (Q6142336) (← links)
• \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery (Q6144050) (← links)
• LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing (Q6148354) (← links)
• On fast Johnson-Lindenstrauss embeddings of compact submanifolds of \(\mathbb{R}^N\) with boundary (Q6151027) (← links)
• Optimal approximation of infinite-dimensional holomorphic functions (Q6151536) (← links)
• Optimal learning (Q6151544) (← links)
• Nonconvex \(\ell_p-\alpha\ell_q\) minimization method and \(p\)-RIP condition for stable recovery of approximately \(k\)-sparse signals (Q6151971) (← links)
• Riemannian thresholding methods for row-sparse and low-rank matrix recovery (Q6157448) (← links)
• DCACO: an algorithm for designing incoherent redundant matrices (Q6157452) (← links)
• Just least squares: binary compressive sampling with low generative intrinsic dimension (Q6159304) (← links)
• Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery (Q6172173) (← links)
• On sparsity‐inducing methods in system identification and state estimation (Q6177342) (← links)
• A tight bound of modified iterative hard thresholding algorithm for compressed sensing. (Q6177911) (← links)
• \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization (Q6181376) (← links)
• Scaled proximal gradient methods for sparse optimization problems (Q6184263) (← links)
• On the determination of Lagrange multipliers for a weighted Lasso problem using geometric and convex analysis techniques (Q6189680) (← links)
• Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising (Q6191886) (← links)
• Sample Size Estimates for Risk-Neutral Semilinear PDE-Constrained Optimization (Q6195313) (← links)
• Sparse and simple structure estimation via prenet penalization (Q6198871) (← links)
• Bayes in action in deep learning and dictionary learning (Q6204920) (← links)
• An interpretable classification method for predicting drug resistance in \(M. tuberculosis\) (Q6487621) (← links)
• Eigenmatrix for unstructured sparse recovery (Q6499005) (← links)
• Dictionary-based model reduction for state estimation (Q6500167) (← links)