Cited in
(41)- Sure independence screening and compressed random sensing
- Compressed sensing reconstruction using expectation propagation
- Sparsity-promoting and edge-preserving maximum a posteriori estimators in non-parametric Bayesian inverse problems
- Computational spectral and ultrafast imaging via convex optimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- An alternating direction method for finding Dantzig selectors
- A regularized correntropy framework for robust pattern recognition
- Reformulations for utilizing separability when solving convex MINLP problems
- A Compressed Sensing Framework for Monte Carlo Transport Simulations Using Random Disjoint Tallies
- Sparse system identification in pairs of pulse and Takenaka-Malmquist bases
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Matrix-free interior point method for compressed sensing problems
- A box constrained gradient projection algorithm for compressed sensing
- RBF-network based sparse signal recovery algorithm for compressed sensing reconstruction
- Two algorithms for compressed sensing of sparse tensors
- On the distance concentration awareness of certain data reduction techniques
- CoSaMP
- CurveLab
- L1TestPack
- libPLS
- boost
- BLITZ
- BenchOpt
- An introduction to compressed sensing
- A Greedy Algorithm for Sparse Precision Matrix Approximation
- KL1p
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Explicit time stepping of PDEs with local refinement in space-time
- Primal-dual first-order methods for a class of cone programming
- Mean breakdown points for compressed sensing by uniformly distributed matrices
- Rates of contraction of posterior distributions based on \(p\)-exponential priors
- Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification
- Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
- Robust visual tracking with structured sparse representation appearance model
- A convex optimization approach to high-dimensional sparse quadratic discriminant analysis
- Discover latent discriminant information for dimensionality reduction: non-negative sparseness preserving embedding
- Sparse regularization for semi-supervised classification
- Templates for convex cone problems with applications to sparse signal recovery
- Sparse optimization of vibration signal by ADMM
- Covariate-adjusted precision matrix estimation with an application in genetical genomics
- Multicompartment magnetic resonance fingerprinting
This page was built for software: L1-MAGIC
