Sparse Recovery via ℓq-Minimization for Polynomial Chaos Expansions
From MaRDI portal
Publication:3176044
DOI10.4208/NMTMA.2017.0001zbMATH Open1399.42069OpenAlexW2755774318MaRDI QIDQ3176044FDOQ3176044
Publication date: 18 July 2018
Published in: Numerical Mathematics: Theory, Methods and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4208/nmtma.2017.0001
Recommendations
- A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design
- A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
- An efficient multifidelity \(\ell_1\)-minimization method for sparse polynomial chaos
- Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method
- Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
- The recovery guarantee for orthogonal matching pursuit method to reconstruct sparse polynomials
- Recovery of sparsest signals via \(\ell^q \)-minimization
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05)
Cited In (3)
This page was built for publication: Sparse Recovery via ℓq-Minimization for Polynomial Chaos Expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176044)
