Pages that link to "Item:Q2706429"
From MaRDI portal
The following pages link to Atomic decomposition by basis pursuit (Q2706429):
Displaying 50 items.
- A remark on compressed sensing (Q941909) (← links)
- Approximations with evolutionary pursuit (Q947344) (← links)
- Independent multiresolution component analysis and matching pursuit (Q951876) (← links)
- Another look at Huber's estimator: a new minimax estimator in regression with stochastically bounded noise (Q958808) (← links)
- Sparse deconvolution using support vector machines (Q966912) (← links)
- A convex optimization approach to filtering in jump linear systems with state dependent transitions (Q983944) (← links)
- SPADES and mixture models (Q988014) (← links)
- Concave programming for minimizing the zero-norm over polyhedral sets (Q989849) (← links)
- Dimensionality reduction and greedy learning of convoluted stochastic dynamics (Q1007727) (← links)
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411) (← links)
- Two dictionaries matching pursuit for sparse decomposition of signals (Q1031467) (← links)
- KFCE: a dictionary generation algorithm for sparse representation (Q1032447) (← links)
- The composite absolute penalties family for grouped and hierarchical variable selection (Q1043749) (← links)
- Mixed linear system estimation and identification (Q1046675) (← links)
- Estimating the dimension of a model (Q1247128) (← links)
- Atomic decomposition of financial data (Q1272693) (← links)
- High resolution pursuit for feature extraction (Q1272847) (← links)
- Propagation and recovery of singularities in the inverse conductivity problem (Q1639701) (← links)
- A new sensor selection scheme for Bayesian learning based sparse signal recovery in WSNs (Q1661457) (← links)
- Prediction of protein-protein interaction by metasample-based sparse representation (Q1666781) (← links)
- The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector (Q1686207) (← links)
- Extragradient method in optimization: convergence and complexity (Q1706412) (← links)
- Geometric separation in \(\mathbb{R}^3\) (Q1710654) (← links)
- Iterative identification for multivariable systems with time-delays based on basis pursuit de-noising and auxiliary model (Q1712029) (← links)
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration (Q1716780) (← links)
- The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm (Q1721133) (← links)
- An adaptive gradient projection algorithm for piecewise convex optimization and its application in compressed spectrum sensing (Q1721691) (← links)
- Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs (Q1734768) (← links)
- Blind identification of fully observed linear time-varying systems via sparse recovery (Q1737658) (← links)
- Spark-level sparsity and the \(\ell_1\) tail minimization (Q1748258) (← links)
- Dictionary evaluation and optimization for sparse coding based speech processing (Q1749610) (← links)
- Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization (Q1753069) (← links)
- Persistene in high-dimensional linear predictor-selection and the virtue of overparametrization (Q1763096) (← links)
- Large-scale hyperspectral image compression via sparse representations based on online learning (Q1787085) (← links)
- Underdetermined separation of speech mixture based on sparse Bayesian learning (Q1793106) (← links)
- A novel detection scheme with multiple observations for sparse signal based on likelihood ratio test with sparse estimation (Q1793681) (← links)
- Norm-minimized scattering data from intensity spectra (Q1793886) (← links)
- Learning sparse FRAME models for natural image patterns (Q1799970) (← links)
- A parameterized proximal point algorithm for separable convex optimization (Q1800446) (← links)
- Super greedy type algorithms (Q1928073) (← links)
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing (Q1946621) (← links)
- Statistical multiresolution Dantzig estimation in imaging: fundamental concepts and algorithmic framework (Q1950814) (← links)
- Inferring sparse Gaussian graphical models with latent structure (Q1951974) (← links)
- Forest Garrote (Q1952025) (← links)
- PAC-Bayesian bounds for sparse regression estimation with exponential weights (Q1952177) (← links)
- Sparsity considerations for dependent variables (Q1952207) (← links)
- Sparse signal recovery via ECME thresholding pursuits (Q1954822) (← links)
- Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations (Q1957932) (← links)
- Exact matrix completion based on low rank Hankel structure in the Fourier domain (Q1979919) (← links)
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions (Q1986404) (← links)
