Pages that link to "Item:Q905907"

The following pages link to Interpolation via weighted \(\ell_{1}\) minimization (Q905907):

Displaying 50 items.

• Reconstruction of sparse Legendre and Gegenbauer expansions (Q329024) (← links)
• Nonlinear frames and sparse reconstructions in Banach spaces (Q682869) (← links)
• Enhancing sparsity of Hermite polynomial expansions by iterative rotations (Q729367) (← links)
• Improved bounds for sparse recovery from subsampled random convolutions (Q1634177) (← links)
• Infinite-dimensional compressed sensing and function interpolation (Q1656376) (← links)
• Compressed sensing of data with a known distribution (Q1669057) (← links)
• Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\) (Q1736367) (← links)
• Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
• Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs (Q2036421) (← links)
• Tight bounds on the mutual coherence of sensing matrices for Wigner d-functions on regular grids (Q2059808) (← links)
• Generalization bounds for sparse random feature expansions (Q2105118) (← links)
• Recovery guarantees for polynomial coefficients from weakly dependent data with outliers (Q2209293) (← links)
• A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations (Q2211058) (← links)
• Worst-case recovery guarantees for least squares approximation using random samples (Q2243884) (← 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)
• Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data (Q2359680) (← links)
• Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension (Q2359687) (← links)
• On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization (Q2375016) (← links)
• Recovery analysis for weighted \(\ell_{1}\)-minimization using the null space property (Q2397162) (← links)
• Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class (Q2415398) (← links)
• A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions (Q2424501) (← links)
• Correcting for unknown errors in sparse high-dimensional function approximation (Q2424851) (← links)
• Basis adaptive sample efficient polynomial chaos (BASE-PC) (Q2425254) (← links)
• Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations (Q2953202) (← links)
• BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING (Q2971048) (← links)
• Accelerating Stochastic Collocation Methods for Partial Differential Equations with Random Input Data (Q3179322) (← links)
• Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation (Q3384130) (← links)
• Compressive Sensing with Redundant Dictionaries and Structured Measurements (Q3455237) (← links)
• Extracting Sparse High-Dimensional Dynamics from Limited Data (Q4561658) (← links)
• A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems (Q4586610) (← links)
• Polynomial approximation via compressed sensing of high-dimensional functions on lower sets (Q4605704) (← links)
• Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations (Q4611522) (← links)
• Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification (Q4611526) (← links)
• (Q4998939) (← links)
• Generalization Error of Minimum Weighted Norm and Kernel Interpolation (Q4999364) (← links)
• The Gap between Theory and Practice in Function Approximation with Deep Neural Networks (Q4999396) (← links)
• Robust Width: A Characterization of Uniformly Stable and Robust Compressed Sensing (Q5020144) (← links)
• Convergence bounds for empirical nonlinear least-squares (Q5034774) (← links)
• Sufficient conditions on stable reconstruction of weighted problem (Q5037937) (← links)
• A General Framework of Rotational Sparse Approximation in Uncertainty Quantification (Q5052909) (← links)
• The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials (Q5094726) (← links)
• Robust recovery of a kind of weighted l1-minimization without noise level (Q5097878) (← links)
• Extracting Structured Dynamical Systems Using Sparse Optimization With Very Few Samples (Q5137942) (← links)
• A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials (Q5160076) (← links)
• A mixed <i>ℓ</i>₁ regularization approach for sparse simultaneous approximation of parameterized PDEs (Q5216108) (← links)
• Stable and robust $\ell_p$-constrained compressive sensing recovery via robust width property (Q5242974) (← links)
• On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels (Q5266378) (← links)
• Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method (Q5881246) (← links)
• Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)