Pages that link to "Item:Q2706429"
From MaRDI portal
The following pages link to Atomic Decomposition by Basis Pursuit (Q2706429):
Displaying 50 items.
- Regularity properties for sparse regression (Q279682) (← links)
- An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem (Q293116) (← links)
- Forecasting using a large number of predictors: is Bayesian shrinkage a valid alternative to principal components? (Q299225) (← links)
- Image denoising by generalized total variation regularization and least squares fidelity (Q336037) (← links)
- A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions (Q349012) (← links)
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies (Q349724) (← links)
- On constrained and regularized high-dimensional regression (Q380022) (← links)
- On exact recovery of sparse vectors from linear measurements (Q382361) (← links)
- Robust visual tracking with structured sparse representation appearance model (Q408075) (← links)
- Model-based multiple rigid object detection and registration in unstructured range data (Q408868) (← links)
- \(L^1\) regularization method in electrical impedance tomography by using the \(L^1\)-curve (Pareto frontier curve) (Q437855) (← links)
- Exact reconstruction using Beurling minimal extrapolation (Q441986) (← links)
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
- A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization (Q477827) (← links)
- A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares (Q480935) (← links)
- Sparse dual frames and dual Gabor functions of minimal time and frequency supports (Q485118) (← links)
- Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing (Q508757) (← links)
- Image reconstruction using analysis model prior (Q519588) (← links)
- Sparse recovery under weak moment assumptions (Q520739) (← links)
- Two-dimensional random projection (Q537260) (← links)
- Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing (Q540241) (← links)
- Node harvest (Q542973) (← links)
- A non-adapted sparse approximation of PDEs with stochastic inputs (Q543721) (← links)
- Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression) (Q544714) (← links)
- Evolution strategies based adaptive \(L_{p}\) LS-SVM (Q545383) (← links)
- Source localization using a sparse representation framework to achieve superresolution (Q600881) (← links)
- Adaptive Dantzig density estimation (Q629798) (← links)
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method (Q630594) (← links)
- Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification (Q650959) (← links)
- Bias-variance trade-off for prequential model list selection (Q657069) (← links)
- Discover latent discriminant information for dimensionality reduction: non-negative sparseness preserving embedding (Q663379) (← links)
- Analysis of convergence for the alternating direction method applied to joint sparse recovery (Q668704) (← links)
- A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems (Q679565) (← links)
- Spectral dynamics and regularization of incompletely and irregularly measured data (Q691305) (← links)
- On the size of incoherent systems (Q719361) (← links)
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection (Q729190) (← links)
- Sparsity preserving projections with applications to face recognition (Q733184) (← links)
- Compressive sampling and rapid reconstruction of broadband frequency hopping signals with interference (Q736865) (← links)
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework (Q742122) (← links)
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms (Q778013) (← links)
- Preserving injectivity under subgaussian mappings and its application to compressed sensing (Q778017) (← links)
- Theoretical guarantees for graph sparse coding (Q778037) (← links)
- Deterministic construction of sparse binary matrices via incremental integer optimization (Q781884) (← links)
- Convergence study of indefinite proximal ADMM with a relaxation factor (Q782911) (← links)
- A shrinkage principle for heavy-tailed data: high-dimensional robust low-rank matrix recovery (Q820791) (← links)
- A multi-resolution, non-parametric, Bayesian framework for identification of spatially-varying model parameters (Q843476) (← links)
- Compressed history matching: Exploiting transform-domain sparsity for regularization of nonlinear dynamic data integration problems (Q848925) (← links)
- Best subset selection, persistence in high-dimensional statistical learning and optimization under \(l_1\) constraint (Q869974) (← links)
- Geometric separation of singularities using combined multiscale dictionaries (Q895421) (← links)
- Construction, management, and performance of sparse Markowitz portfolios (Q905387) (← links)
