Atomic Decomposition by Basis Pursuit
From MaRDI portal
Publication:2706429
DOI10.1137/S003614450037906XzbMath0979.94010WikidataQ56564479 ScholiaQ56564479MaRDI QIDQ2706429
David L. Donoho, Scott Shaobing Chen, Michael A. Saunders
Publication date: 19 March 2001
Published in: SIAM Review (Search for Journal in Brave)
waveletsdenoisingtime-frequency analysiswavelet packetstime-scale analysismatching pursuitmultiscale edgestotal variation denoisingMATLAB code\(\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
Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization, Global sensitivity analysis based on high-dimensional sparse surrogate construction, Stable high-order cubature formulas for experimental data, The Moreau envelope based efficient first-order methods for sparse recovery, Sparse Bayesian learning for network structure reconstruction based on evolutionary game data, Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique, A customized proximal point algorithm for convex minimization with linear constraints, Example-based single document image super-resolution: a global MAP approach with outlier rejection, On LASSO for predictive regression, Efficient uncertainty quantification of stochastic problems in CFD by combination of compressed sensing and POD-kriging, A data-driven line search rule for support recovery in high-dimensional data analysis, Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems, Autoencoders reloaded, Sparse minimax portfolio and Sharpe ratio models, Proximal methods for reweighted \(l_Q\)-regularization of sparse signal recovery, The springback penalty for robust signal recovery, Generalizing CoSaMP to signals from a union of low dimensional linear subspaces, Towards understanding sparse filtering: a theoretical perspective, Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing, Faster maximum feasible subsystem solutions for dense constraint matrices, The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing, Online sequential echo state network with sparse RLS algorithm for time series prediction, Newton-type optimal thresholding algorithms for sparse optimization problems, A nonconvex model with minimax concave penalty for image restoration, Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm, Iterative hard thresholding for compressed data separation, Analysis non-sparse recovery for relaxed ALASSO, A simple homotopy proximal mapping algorithm for compressive sensing, A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions, Adaptive decomposition-based evolutionary approach for multiobjective sparse reconstruction, Effective zero-norm minimization algorithms for noisy compressed sensing, Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis, A superlinearly convergent \(R\)-regularized Newton scheme for variational models with concave sparsity-promoting priors, Stability of 1-bit compressed sensing in sparse data reconstruction, On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming, An adaptive primal-dual framework for nonsmooth convex minimization, A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al., A linearized Peaceman-Rachford splitting method for structured convex optimization with application to stable principal component pursuit, Aggregation for Gaussian regression, A perturbation view of level-set methods for convex optimization, On the linear convergence rates of exchange and continuous methods for total variation minimization, Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization, Frank-Wolfe and friends: a journey into projection-free first-order optimization methods, A noise-robust online convolutional coding model and its applications to Poisson denoising and image fusion, Sparsity- and continuity-promoting seismic image recovery with curvelet frames, Learning with tensors: a framework based on convex optimization and spectral regularization, An automatic and parameter-free information-based method for sparse representation in wavelet bases, Geometric separation by single-pass alternating thresholding, Fast thresholding algorithms with feedbacks for sparse signal recovery, Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO, Portfolio optimization with linear and fixed transaction costs, Measurement matrix optimization via mutual coherence minimization for compressively sensed signals reconstruction, Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method, Solution paths for the generalized Lasso with applications to spatially varying coefficients regression, Embedded feature-selection support vector machine for driving pattern recognition, A general self-adaptive relaxed-PPA method for convex programming with linear constraints, On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them, Novel sparseness-inducing dual Kalman filter and its application to tracking time-varying spatially-sparse structural stiffness changes and inputs, Data representations and generalization error in kernel based learning machines, Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares, A prediction-correction-based primal-dual hybrid gradient method for linearly constrained convex minimization, High-dimensional graphs and variable selection with the Lasso, On convex envelopes and regularization of non-convex functionals without moving global minima, A golden ratio primal-dual algorithm for structured convex optimization, Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms, Super-resolution by means of Beurling minimal extrapolation, An efficient descent method for locally Lipschitz multiobjective optimization problems, Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization, Low-rank matrix recovery via regularized nuclear norm minimization, Denoising for multiple image copies through joint sparse representation, Robust detection of neural spikes using sparse coding based features, Maximin effects in inhomogeneous large-scale data, A wavelet-based hybrid approach to estimate variance function in heteroscedastic regression models, A Laplacian approach to \(\ell_1\)-norm minimization, A new smoothed L0 regularization approach for sparse signal recovery, A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs, Changepoint detection by the quantile Lasso method, Accelerating the Bayesian inference of inverse problems by using data-driven compressive sensing method based on proper orthogonal decomposition, Optimal representative sample weighting, An improved linear convergence of FISTA for the LASSO problem with application to CT image reconstruction, Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions, A note on block-sparse signal recovery with coherent tight frames, Optimal subgradient methods: computational properties for large-scale linear inverse problems, Detecting edges from non-uniform Fourier data via sparse Bayesian learning, Detecting and identifying anomalous effects in complex signals, Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem, Sparsest piecewise-linear regression of one-dimensional data, Structured iterative hard thresholding with on- and off-grid applications, Frame soft shrinkage operators are proximity operators, Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning, Generalized high-dimensional trace regression via nuclear norm regularization, The all-or-nothing phenomenon in sparse linear regression, Partial gradient optimal thresholding algorithms for a class of sparse optimization problems, Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI, An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems, On model selection consistency of regularized M-estimators, A weighted randomized sparse Kaczmarz method for solving linear systems, LASSO for streaming data with adaptative filtering, Understanding neural networks with reproducing kernel Banach spaces, Design of c-optimal experiments for high-dimensional linear models, Model selection with distributed SCAD penalty, On the uniqueness of solutions for the basis pursuit in the continuum, Sparse Approximations with Interior Point Methods, A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems, Identifying small mean-reverting portfolios, Average Performance of the Sparsest Approximation Using a General Dictionary, Sparse Online Variational Bayesian Regression, Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions, On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming, Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm, Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes, Revisiting linearized Bregman iterations under Lipschitz-like convexity condition, Parameter choices for sparse regularization with the ℓ1 norm *, Model Selection With Lasso-Zero: Adding Straw to the Haystack to Better Find Needles, Unnamed Item, Regularized sparse representation for image deconvolution, Bayesian Variable Selection and Regularization for Time–Frequency Surface Estimation, Optimizing Image Quality, Parallel Normal S-Iteration Methods with Applications to Optimization Problems, Iterative positive thresholding algorithm for non-negative sparse optimization, The Noise Collector for sparse recovery in high dimensions, A General Theory of Singular Values with Applications to Signal Denoising, Unnamed Item, On the Convergence of Stochastic Primal-Dual Hybrid Gradient, Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases, Multicompartment magnetic resonance fingerprinting, A Generalized Primal-Dual Algorithm with Improved Convergence Condition for Saddle Point Problems, Improved bounds for the RIP of Subsampled Circulant matrices, Asymptotic Theory of \(\boldsymbol \ell _1\) -Regularized PDE Identification from a Single Noisy Trajectory, Identifiability of an X-Rank Decomposition of Polynomial Maps, Unnamed Item, The geometry of off-the-grid compressed sensing, Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression, Comparison of the performance and reliability between improved sampling strategies for polynomial chaos expansion, Unnamed Item, CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion, Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints, On sparse recovery algorithms in unions of orthonormal bases, Posterior information-based image measurement matrix optimization, Statistical analysis of financial time series under the assumption of local stationarity, A dual-primal balanced augmented Lagrangian method for linearly constrained convex programming, Sparse Support Vector Machines in Reproducing Kernel Banach Spaces, A gradient projection method for the sparse signal reconstruction in compressive sensing, Calibration of reduced-order model for a coupled Burgers equations based on PC-EnKF, A Fast Algorithm for Learning Overcomplete Dictionary for Sparse Representation Based on Proximal Operators, Improving the Incoherence of a Learned Dictionary via Rank Shrinkage, Robust recovery of signals with partially known support information using weighted BPDN, An unbiased approach to compressed sensing, TV-based reconstruction of periodic functions, Cascade systems de-noising and greedy calibrated approximation, Combination of anisotropic diffusion and non-subsampled shearlet transform for image denoising, Sparse Recovery and Dictionary Learning to Identify the Nonlinear Dynamical Systems: One Step Toward Finding Bifurcation Points in Real Systems, A Tuning-free Robust and Efficient Approach to High-dimensional Regression, Fast Thresholding Algorithms with Feedbacks and Partially Known Support for Compressed Sensing, Microlocal Analysis of the Geometric Separation Problem, Perfect reconstruction of sparse signals with piecewise continuous nonconvex penalties and nonconvexity control, Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems, Multiresolution approximation for volatility processes, MultiDimensional Sparse Super-Resolution, Element analysis: a wavelet-based method for analysing time-localized events in noisy time series, The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty, Sparsity and Smoothness Via the Fused Lasso, Unnamed Item, Unnamed Item, Unnamed Item, Tight and full spark Chebyshev frames with real entries and worst-case coherence analysis, Spectral Compressed Sensing via Projected Gradient Descent, Least Sparsity of $p$-Norm Based Optimization Problems with $p>1$, Chaotic Binary Sensing Matrices, An Adaptive Generalized Multiscale Discontinuous Galerkin Method for High-Contrast Flow Problems, Iterative regularization and inverse scale space methods with wave atoms, Sparse and stable Markowitz portfolios, A New Nonlinear Sparse Component Analysis for a Biologically Plausible Model of Neurons, An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems, Sparse System Identification in Pairs of Pulse and Takenaka--Malmquist Bases, On the Algorithmic Power of Spiking Neural Networks, Concave programming for finding sparse solutions to problems with convex constraints, BinaryRelax: A Relaxation Approach for Training Deep Neural Networks with Quantized Weights, Polar Convolution, SPARSE TEMPLATE-BASED VARIATIONAL IMAGE SEGMENTATION, A Greedy Approach to $\ell_{0,\infty}$-Based Convolutional Sparse Coding, Nonconvex Optimization for 3-Dimensional Point Source Localization Using a Rotating Point Spread Function, HIERARCHICAL SPARSE METHOD WITH APPLICATIONS IN VISION AND SPEECH RECOGNITION, Computationally Efficient Atomic Representations for Nonstationary Stochastic Processes, Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model, Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization, Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems, Principles and Typical Computational Limitations of Sparse Speaker Separation Based on Deterministic Speech Features, Unnamed Item, Unnamed Item, Projected Newton method for noise constrained Tikhonov regularization, Stability Selection, Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization, Unnamed Item, Backward elimination model construction for regression and classification using leave-one-out criteria, PHASE TRANSITIONS IN ERROR CORRECTING AND COMPRESSED SENSING BY ℓ1 LINEAR PROGRAMMING, Sparsity-Based MIMO Radars, Nonuniform recovery of fusion frame structured sparse signals, Multi-Layer Sparse Coding: The Holistic Way, A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions, A shrinkage principle for heavy-tailed data: high-dimensional robust low-rank matrix recovery, Regularity properties for sparse regression, An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem, Forecasting using a large number of predictors: is Bayesian shrinkage a valid alternative to principal components?, A multi-resolution, non-parametric, Bayesian framework for identification of spatially-varying model parameters, Propagation and recovery of singularities in the inverse conductivity problem, Compressed history matching: Exploiting transform-domain sparsity for regularization of nonlinear dynamic data integration problems, Image denoising by generalized total variation regularization and least squares fidelity, A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions, Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies, A new sensor selection scheme for Bayesian learning based sparse signal recovery in WSNs, Best subset selection, persistence in high-dimensional statistical learning and optimization under \(l_1\) constraint, Prediction of protein-protein interaction by metasample-based sparse representation, Source localization using a sparse representation framework to achieve superresolution, On constrained and regularized high-dimensional regression, On exact recovery of sparse vectors from linear measurements, Super greedy type algorithms, The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector, Robust visual tracking with structured sparse representation appearance model, Geometric separation of singularities using combined multiscale dictionaries, Model-based multiple rigid object detection and registration in unstructured range data, Adaptive Dantzig density estimation, Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method, Construction, management, and performance of sparse Markowitz portfolios, Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing, \(L^1\) regularization method in electrical impedance tomography by using the \(L^1\)-curve (Pareto frontier curve), Statistical multiresolution Dantzig estimation in imaging: fundamental concepts and algorithmic framework, Extragradient method in optimization: convergence and complexity, Inferring sparse Gaussian graphical models with latent structure, Forest Garrote, PAC-Bayesian bounds for sparse regression estimation with exponential weights, Sparsity considerations for dependent variables, Exact reconstruction using Beurling minimal extrapolation, Sparse signal recovery via ECME thresholding pursuits, Geometric separation in \(\mathbb{R}^3\), Iterative identification for multivariable systems with time-delays based on basis pursuit de-noising and auxiliary model, Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations, An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration, Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification, A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints, The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm, An adaptive gradient projection algorithm for piecewise convex optimization and its application in compressed spectrum sensing, Bias-variance trade-off for prequential model list selection, A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization, A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares, Discover latent discriminant information for dimensionality reduction: non-negative sparseness preserving embedding, Sparse dual frames and dual Gabor functions of minimal time and frequency supports, Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs, Analysis of convergence for the alternating direction method applied to joint sparse recovery, Blind identification of fully observed linear time-varying systems via sparse recovery, A remark on compressed sensing, Exact matrix completion based on low rank Hankel structure in the Fourier domain, A preconditioning approach for improved estimation of sparse polynomial chaos expansions, Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing, A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems, ADMM-softmax: an ADMM approach for multinomial logistic regression, Independent multiresolution component analysis and matching pursuit, Spark-level sparsity and the \(\ell_1\) tail minimization, Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs, Dictionary evaluation and optimization for sparse coding based speech processing, Compressing sensing based source localization for controlled acoustic signals using distributed microphone arrays, Image reconstruction using analysis model prior, Sparse recovery under weak moment assumptions, Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization, Another look at Huber's estimator: a new minimax estimator in regression with stochastically bounded noise, Spectral dynamics and regularization of incompletely and irregularly measured data, Two-dimensional random projection, Sparse deconvolution using support vector machines, Persistene in high-dimensional linear predictor-selection and the virtue of overparametrization, Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing, Node harvest, A non-adapted sparse approximation of PDEs with stochastic inputs, Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression), Evolution strategies based adaptive \(L_{p}\) LS-SVM, A convex optimization approach to filtering in jump linear systems with state dependent transitions, SPADES and mixture models, On the size of incoherent systems, Concave programming for minimizing the zero-norm over polyhedral sets, Large-scale hyperspectral image compression via sparse representations based on online learning, Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection, Estimating the dimension of a model, Underdetermined separation of speech mixture based on sparse Bayesian learning, A novel detection scheme with multiple observations for sparse signal based on likelihood ratio test with sparse estimation, Norm-minimized scattering data from intensity spectra, Sparsity preserving projections with applications to face recognition, Compressive sampling and rapid reconstruction of broadband frequency hopping signals with interference, Learning sparse FRAME models for natural image patterns, A parameterized proximal point algorithm for separable convex optimization, Dimensionality reduction and greedy learning of convoluted stochastic dynamics, Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework, Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization, High resolution pursuit for feature extraction, KFCE: a dictionary generation algorithm for sparse representation, The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms, Preserving injectivity under subgaussian mappings and its application to compressed sensing, Theoretical guarantees for graph sparse coding, The composite absolute penalties family for grouped and hierarchical variable selection, Deterministic construction of sparse binary matrices via incremental integer optimization, Convergence study of indefinite proximal ADMM with a relaxation factor, Mixed linear system estimation and identification, Required Number of Iterations for Sparse Signal Recovery via Orthogonal Least Squares, Estimation and Uncertainty Quantification for Piecewise Smooth Signal Recovery, Double Double Descent: On Generalization Errors in Transfer Learning between Linear Regression Tasks, A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming, A survey on compressive sensing: classical results and recent advancements, A general null space property for sparse principal component analysis, Non-Cartesian spiral binary sensing matrices, A two-stage approach for structural damage detection using a damage localization indicator vector and cluster particle swarm optimization, Model-based recursive partitioning algorithm to penalized non-crossing multiple quantile regression for the right-censored data, Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints, Robust latent nonnegative matrix factorization with automatic sparse reconstruction for unsupervised feature extraction, A Critical Review of LASSO and Its Derivatives for Variable Selection Under Dependence Among Covariates, Sparse feedback stabilisation of linear delay systems by proximal gradient method, Neurodynamic approaches for sparse recovery problem with linear inequality constraints, Sparse approximation over the cube, Sparse convex optimization toolkit: a mixed-integer framework, Derivative-based SINDy (DSINDy): addressing the challenge of discovering governing equations from noisy data, CECM: a continuous empirical cubature method with application to the dimensional hyperreduction of parameterized finite element models, Huberization image restoration model from incomplete multiplicative noisy data, A parallel low rank matrix optimization method for recovering Internet traffic network data via link flow measurement, Tutorial on Amortized Optimization, Lasso in Infinite dimension: application to variable selection in functional multivariate linear regression, A duality approach to regularized learning problems in Banach spaces, Sparse Bayesian learning approach for discrete signal reconstruction, Inducing sparsity via the horseshoe prior in imaging problems, Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization, A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems, A tight bound of modified iterative hard thresholding algorithm for compressed sensing., On the determination of Lagrange multipliers for a weighted Lasso problem using geometric and convex analysis techniques, Unnamed Item, Unnamed Item, EXPLORING MULTI-RESOLUTION AND MULTI-SCALING VOLATILITY FEATURES, Efficient Coding of Time-Relative Structure Using Spikes, FUNCTIONAL APPROXIMATION IN MULTISCALE COMPLEX SYSTEMS, Confidence Intervals for Low Dimensional Parameters in High Dimensional Linear Models, A general theory of concave regularization for high-dimensional sparse estimation problems, Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization, A time continuation based fast approximate algorithm for compressed sensing related optimization, Computing non-negative tensor factorizations, Sparse Solutions of a Class of Constrained Optimization Problems
Uses Software
