We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...
A protection profile for high-robustness separation kernels has recently been validated and several implementations are under development. However, medium-robustness separation ke...
Rance J. DeLong, Thuy D. Nguyen, Cynthia E. Irvine...
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
A nonparametric version of the basis pursuit method is developed for field estimation. The underlying model entails known bases, weighted by generic functions to be estimated fro...