Atomic Decomposition by Basis Pursuit
From MaRDI portal
Publication:4210402
DOI10.1137/S1064827596304010zbMath0919.94002MaRDI QIDQ4210402
Michael A. Saunders, Scott Shaobing Chen, David L. Donoho
Publication date: 21 September 1998
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
waveletsdenoisingtime-frequency analysistime-scale analysismatching pursuitmultiscale edges\(\ell^1\) norm optimizationcosine packetsinterior-point methods for linear programmingovercomplete signal representation
Numerical mathematical programming methods (65K05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Algorithms for approximation of functions (65D15) Approximation by arbitrary linear expressions (41A45)
Related Items (only showing first 100 items - show all)
Tseng type methods for solving inclusion problems and its applications ⋮ On a combinatorial framework for fault characterization ⋮ Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming ⋮ A frame based shrinkage procedure for fast oscillating functions ⋮ Signal recovery under cumulative coherence ⋮ Minimizers of sparsity regularized Huber loss function ⋮ Local search methods for \(\ell_{1}\)-minimization in frame based signal compression ⋮ Functional linear regression that's interpretable ⋮ Near-ideal model selection by \(\ell _{1}\) minimization ⋮ Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy ⋮ Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules ⋮ Sparse approximation of images inspired from the functional architecture of the primary visual areas ⋮ Robust sparse component analysis based on a generalized Hough transform ⋮ Improved bounds for sparse recovery from subsampled random convolutions ⋮ Variational methods for normal integration ⋮ Solution of linear ill-posed problems by model selection and aggregation ⋮ A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints ⋮ \(l_1\)-\(l_2\) regularization of split feasibility problems ⋮ Note on the modified relaxation CQ algorithm for the split feasibility problem ⋮ Instrumental variable-based OMP identification algorithm for Hammerstein systems ⋮ Random sampling of sparse trigonometric polynomials ⋮ Multi-frame representations in linear inverse problems with mixed multi-constraints ⋮ Landmark recognition with sparse representation classification and extreme learning machine ⋮ Mixed \(\ell_2\) and \(\ell_1\)-norm regularization for adaptive detrending with ARMA modeling ⋮ On the sign consistency of the Lasso for the high-dimensional Cox model ⋮ Prior model identification during subsurface flow data integration with adaptive sparse representation techniques ⋮ Component selection and smoothing in multivariate nonparametric regression ⋮ Alternating direction method of multipliers for separable convex optimization of real functions in complex variables ⋮ Mixed Hölder matrix discovery via wavelet shrinkage and Calderón-Zygmund decompositions ⋮ PROMP: a sparse recovery approach to lattice-valued signals ⋮ Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP ⋮ Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression ⋮ Estimating the probability law of the codelength as a function of the approximation error in image compression ⋮ Exact support recovery for sparse spikes deconvolution ⋮ RBF-network based sparse signal recovery algorithm for compressed sensing reconstruction ⋮ A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions ⋮ A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem ⋮ An alternating direction and projection algorithm for structure-enforced matrix factorization ⋮ A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery ⋮ A proximal alternating linearization method for minimizing the sum of two convex functions ⋮ Adaptive projected gradient thresholding methods for constrained \(l_0\) problems ⋮ Optimal dual certificates for noise robustness bounds in compressive sensing ⋮ Sparse and low-rank matrix regularization for learning time-varying Markov networks ⋮ Extensions of Gauss quadrature via linear programming ⋮ Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries ⋮ A hierarchical framework for recovery in compressive sensing ⋮ Sparse Bayesian representation in time-frequency domain ⋮ Weakly-supervised cross-domain dictionary learning for visual recognition ⋮ Analysis \(\ell_1\)-recovery with frames and Gaussian measurements ⋮ A Rice method proof of the null-space property over the Grassmannian ⋮ Learning active basis models by EM-type algorithms ⋮ Finding effective points by surrogate models with overcomplete bases ⋮ Kernel methods in machine learning ⋮ On the conditioning of random subdictionaries ⋮ The LOST algorithm: Finding lines and separating speech mixtures ⋮ A coordinate gradient descent method for nonsmooth separable minimization ⋮ Sparsity in time-frequency representations ⋮ Image denoising via solution paths ⋮ Sparse approximate solution of partial differential equations ⋮ Least angle and \(\ell _{1}\) penalized regression: a review ⋮ Nonparametric denoising of signals of unknown local structure. II: Nonparametric function recovery ⋮ L1Packv2: A Mathematica package for minimizing an \(\ell _{1}\)-penalized functional ⋮ CMB data analysis and sparsity ⋮ New methods for fitting multiple sinusoids from irregularly sampled data ⋮ Processing MUSE hyperspectral data: denoising, deconvolution and detection of astrophysical sources ⋮ Sparse recovery by non-convex optimization - instance optimality ⋮ On compressive sensing applied to radar ⋮ Penalized quantile regression for dynamic panel data ⋮ Regularization of geophysical ill-posed problems by iteratively re-weighted and refined least squares ⋮ When do stepwise algorithms meet subset selection criteria? ⋮ New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints ⋮ Enhancing sparsity of Hermite polynomial expansions by iterative rotations ⋮ Spectrum estimation for large dimensional covariance matrices using random matrix theory ⋮ Sparse regression using mixed norms ⋮ Iterative thresholding for sparse approximations ⋮ Analysis of basis pursuit via capacity sets ⋮ Enhancing sparsity by reweighted \(\ell _{1}\) minimization ⋮ Robust penalized quantile regression estimation for panel data ⋮ New cyclic sparsity measures for deconvolution based on convex relaxation ⋮ Sparse recovery via differential inclusions ⋮ Fast global convergence of gradient methods for high-dimensional statistical recovery ⋮ Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach ⋮ A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization ⋮ Radar target recognition using contourlet packet transform and neural network approach ⋮ Matrix-free interior point method for compressed sensing problems ⋮ K-hyperline clustering learning for sparse component analysis ⋮ Positive shrinkage, improved pretest and absolute penalty estimators in partially linear models ⋮ Parsimonious additive models ⋮ Support vector machines with adaptive \(L_q\) penalty ⋮ Elastic-net regularization in learning theory ⋮ Compression and denoising using \(l _{0}\)-norm ⋮ Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit ⋮ Sparsity and persistence: mixed norms provide simple signal models with dependent coefficients ⋮ Compressive sensing for subsurface imaging using ground penetrating radar ⋮ Wedgelets: Nearly minimax estimation of edges ⋮ Sparse solutions to underdetermined Kronecker product systems ⋮ Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization ⋮ Optimization of frame representations for compressed sensing and Mercedes-Benz frame ⋮ On a simple derivation of the complementary matching pursuit ⋮ The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. With comments by Ronald A. Thisted and M. R. Osborne and a rejoinder by the authors
Uses Software
This page was built for publication: Atomic Decomposition by Basis Pursuit
