120 citations · 245 across the 34 of their papers we have counts for
4 papers · 1 filter
An improved discrete least-squares/reduced-basis method for parameterized elliptic PDEs
Max Gunzburger, Michael Schneier, Clayton Webster +1
It is shown that the computational efficiency of the discrete least-squares (DLS) approximation of solutions of stochastic elliptic PDEs is improved by incorporating a reduced-basi…
On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals
Nick Dexter, Hoang Tran, Clayton Webster
We consider the problem of reconstructing an infinite set of sparse, finite-dimensional vectors, that share a common sparsity pattern, from incomplete measurements. This is in cont…
A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations
Hoang Tran, Clayton Webster
For the problem of sparse recovery, it is widely accepted that nonconvex minimizations are better than penalty in enhancing the sparsity of solution. However, to date, the…
Compressed sensing approaches for polynomial approximation of high-dimensional functions
Ben Adcock, Simone Brugiapaglia, Clayton G. Webster
In recent years, the use of sparse recovery techniques in the approximation of high-dimensional functions has garnered increasing interest. In this work we present a survey of rece…