Pages that link to "Item:Q351503"
From MaRDI portal
The following pages link to A mathematical introduction to compressive sensing (Q351503):
Displaying 50 items.
- Correcting for unknown errors in sparse high-dimensional function approximation (Q2424851) (← links)
- Misspecified nonconvex statistical optimization for sparse phase retrieval (Q2425184) (← links)
- Paved with good intentions: analysis of a randomized block Kaczmarz method (Q2437339) (← links)
- Relevant sampling of band-limited functions (Q2509813) (← links)
- Fast and RIP-optimal transforms (Q2514234) (← links)
- Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames (Q2627887) (← links)
- Computing a quantity of interest from observational data (Q2631950) (← links)
- A theoretical result of sparse signal recovery via alternating projection method (Q2656767) (← links)
- Non-uniform recovery guarantees for binary measurements and infinite-dimensional compressed sensing (Q2658730) (← links)
- A provably convergent scheme for compressive sensing under random generative priors (Q2658735) (← links)
- Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE (Q2659717) (← links)
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices (Q2659735) (← links)
- When does OMP achieve exact recovery with continuous dictionaries? (Q2659744) (← links)
- \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed? (Q2659754) (← links)
- A novel regularization based on the error function for sparse recovery (Q2660696) (← links)
- Entropy numbers of finite dimensional mixed-norm balls and function space embeddings with small mixed smoothness (Q2663135) (← links)
- Compressive statistical learning with random feature moments (Q2664824) (← links)
- Statistical learning guarantees for compressive clustering and compressive mixture modeling (Q2664825) (← links)
- Convex optimization in sums of Banach spaces (Q2667036) (← links)
- A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization (Q2667049) (← links)
- Sparse signal recovery from phaseless measurements via hard thresholding pursuit (Q2667051) (← links)
- On randomized trace estimates for indefinite matrices with an application to determinants (Q2671299) (← links)
- Generic error bounds for the generalized Lasso with sub-exponential data (Q2675193) (← links)
- Newton-type optimal thresholding algorithms for sparse optimization problems (Q2676159) (← links)
- Interior reconstruction in tomography via prior support constrained compressed sensing (Q2681230) (← links)
- The geometry of off-the-grid compressed sensing (Q2684465) (← links)
- Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry (Q2687067) (← links)
- Compressed sensing of low-rank plus sparse matrices (Q2689144) (← links)
- Covering point-sets with parallel hyperplanes and sparse signal recovery (Q2689251) (← links)
- Applied harmonic analysis and data science. Abstracts from the workshop held November 28 -- December 4, 2021 (hybrid meeting) (Q2693052) (← links)
- Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing (Q2696571) (← links)
- Uniqueness in nuclear norm minimization: flatness of the nuclear norm sphere and simultaneous polarization (Q2697005) (← links)
- A compressed sensing approach to interpolation of fractional Brownian trajectories for a single particle tracking experiment (Q2698195) (← links)
- A simple proof of the Grünbaum conjecture (Q2700668) (← links)
- On the sparsity of Lasso minimizers in sparse data recovery (Q2700886) (← links)
- Convex cardinal shape composition (Q2797765) (← links)
- Estimation in High Dimensions: A Geometric Perspective (Q2799917) (← links)
- Low Complexity Regularization of Linear Inverse Problems (Q2799919) (← links)
- Noise-Shaping Quantization Methods for Frame-Based and Compressive Sampling Systems (Q2799920) (← links)
- Interactions between compressed sensing random matrices and high dimensional geometry (Q2849450) (← 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)
- Stability of lq-analysis based dual frame with Weibull matrices for 0 < q ≤ 1 (Q2958494) (← links)
- Erasure Coding for Fault-Oblivious Linear System Solvers (Q2964445) (← links)
- Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures (Q2968585) (← links)
- BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING (Q2971048) (← links)
- Sparsity and level set regularization for diffuse optical tomography using a transport model in 2D (Q2971434) (← links)
- Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines (Q3119537) (← links)
- Concave Mirsky Inequality and Low-Rank Recovery (Q3130424) (← links)
- Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares (Q3174766) (← links)
