A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs

DOI10.1051/m2an/2019048OpenAlexW2962737219WikidataQ114105456 ScholiaQ114105456MaRDI QIDQ5216108

No author found.

Publication date: 14 February 2020

Published in: ESAIM: Mathematical Modelling and Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.06174

zbMATH Keywords

best approximationsparse recoverycompressed sensinghigh-dimensionaljoint sparsitybasis pursuit denoisingconvex regularizationpolynomial expansionsbounded orthonormal systemsparameterized PDEsquasi-optimalHilbert-valued signals

Mathematics Subject Classification ID

Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Stochastic partial differential equations (aspects of stochastic analysis) (60H15) Multidimensional problems (41A63) Numerical solutions to stochastic differential and integral equations (65C30) Approximation by polynomials (41A10) Series expansions (e.g., Taylor, Lidstone series, but not Fourier series) (41A58) Harmonic analysis and PDEs (42B37)

Related Items

On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals ⋮ Analysis of sparse recovery for Legendre expansions using envelope bound ⋮ Optimal approximation of infinite-dimensional holomorphic functions ⋮ A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations ⋮ Towards optimal sampling for learning sparse approximation in high dimensions ⋮ Numerical solution of the parametric diffusion equation by deep neural networks ⋮ The Gap between Theory and Practice in Function Approximation with Deep Neural Networks ⋮ Improved Recovery Guarantees and Sampling Strategies for TV Minimization in Compressive Imaging

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of quasi-optimal stochastic Galerkin methods for a class of PDES with random coefficients
• Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
• A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
• Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
• A mathematical introduction to compressive sensing
• Sparse adaptive approximation of high dimensional parametric initial value problems
• On the stability and accuracy of least squares approximations
• Sparse Legendre expansions via \(\ell_1\)-minimization
• Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
• The null space property for sparse recovery from multiple measurement vectors
• A non-adapted sparse approximation of PDEs with stochastic inputs
• Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
• Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
• Interpolation via weighted \(\ell_{1}\) minimization
• Infinite-dimensional compressed sensing and function interpolation
• Modeling uncertainty in steady state diffusion problems via generalized polynomial chaos
• Explicit cost bounds of stochastic Galerkin approximations for parameterized PDEs with random coefficients
• A dynamically adaptive sparse grids method for quasi-optimal interpolation of multidimensional functions
• Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
• On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
• Analysis of quasi-optimal polynomial approximations for parameterized PDEs with deterministic and stochastic coefficients
• A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
• Correcting for unknown errors in sparse high-dimensional function approximation
• On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals
• Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs
• Analytic regularity and nonlinear approximation of a class of parametric semilinear elliptic PDEs
• Sparse Tensor Galerkin Discretization of Parametric and Random Parabolic PDEs---Analytic Regularity and Generalized Polynomial Chaos Approximation
• REGULARITY AND GENERALIZED POLYNOMIAL CHAOS APPROXIMATION OF PARAMETRIC AND RANDOM SECOND-ORDER HYPERBOLIC PARTIAL DIFFERENTIAL EQUATIONS
• Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
• Sparse polynomial approximation of parametric elliptic PDEs. Part II: lognormal coefficients
• Stochastic Spectral Galerkin and Collocation Methods for PDEs with Random Coefficients: A Numerical Comparison
• Sparse Tensor Discretization of Elliptic sPDEs
• Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
• ANALYTIC REGULARITY AND POLYNOMIAL APPROXIMATION OF PARAMETRIC AND STOCHASTIC ELLIPTIC PDE'S
• ON THE OPTIMAL POLYNOMIAL APPROXIMATION OF STOCHASTIC PDES BY GALERKIN AND COLLOCATION METHODS
• ASSESSMENT OF COLLOCATION AND GALERKIN APPROACHES TO LINEAR DIFFUSION EQUATIONS WITH RANDOM DATA
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Spectral Methods for Uncertainty Quantification
• A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
• An Anisotropic Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
• Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
• A Compressed Sensing Approach for Partial Differential Equations with Random Input Data
• Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Robustness to Unknown Error in Sparse Regularization
• Stochastic finite element methods for partial differential equations with random input data
• The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
• Compressed Sensing With Cross Validation
• Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation
• Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs
• A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
• Theoretical and Empirical Results for Recovery From Multiple Measurements
• Sparse solutions to linear inverse problems with multiple measurement vectors
• STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION
• N-TERM WIENER CHAOS APPROXIMATION RATES FOR ELLIPTIC PDEs WITH LOGNORMAL GAUSSIAN RANDOM INPUTS
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• Signal Recovery by Proximal Forward-Backward Splitting
• An Iterative Regularization Method for Total Variation-Based Image Restoration
• Convex analysis and monotone operator theory in Hilbert spaces
• A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
• Compressed sensing