The following pages link to L1-MAGIC (Q24358):
Displayed 33 items.
- Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization (Q368088) (← links)
- Robust visual tracking with structured sparse representation appearance model (Q408075) (← links)
- Convergence of fixed-point continuation algorithms for matrix rank minimization (Q535287) (← links)
- Fixed point and Bregman iterative methods for matrix rank minimization (Q543413) (← links)
- A box constrained gradient projection algorithm for compressed sensing (Q553750) (← links)
- On the distance concentration awareness of certain data reduction techniques (Q614077) (← links)
- Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification (Q650959) (← links)
- Discover latent discriminant information for dimensionality reduction: non-negative sparseness preserving embedding (Q663379) (← links)
- Sparse optimization of vibration signal by ADMM (Q670432) (← links)
- Reformulations for utilizing separability when solving convex MINLP problems (Q721170) (← links)
- Matrix-free interior point method for compressed sensing problems (Q744215) (← links)
- A convex optimization approach to high-dimensional sparse quadratic discriminant analysis (Q820816) (← links)
- RBF-network based sparse signal recovery algorithm for compressed sensing reconstruction (Q889379) (← links)
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit (Q1029548) (← links)
- Templates for convex cone problems with applications to sparse signal recovery (Q1762456) (← links)
- An alternating direction method for finding Dantzig selectors (Q1927184) (← links)
- Rates of contraction of posterior distributions based on \(p\)-exponential priors (Q2040080) (← links)
- Sparse regularization for semi-supervised classification (Q2275970) (← links)
- Explicit time stepping of PDEs with local refinement in space-time (Q2291896) (← links)
- Mean breakdown points for compressed sensing by uniformly distributed matrices (Q2843151) (← links)
- Primal–dual first-order methods for a class of cone programming (Q2867434) (← links)
- Sure independence screening and compressed random sensing (Q3011156) (← links)
- An Introduction to Compressed Sensing (Q3296174) (← links)
- Two Algorithms for Compressed Sensing of Sparse Tensors (Q3460836) (← links)
- Computational Spectral and Ultrafast Imaging via Convex Optimization (Q4556981) (← links)
- Multicompartment magnetic resonance fingerprinting (Q4582674) (← links)
- Sparsity-promoting and edge-preserving maximum <i>a posteriori</i> estimators in non-parametric Bayesian inverse problems (Q4638174) (← links)
- A Compressed Sensing Framework for Monte Carlo Transport Simulations Using Random Disjoint Tallies (Q5068017) (← links)
- A Greedy Algorithm for Sparse Precision Matrix Approximation (Q5079528) (← links)
- A Regularized Correntropy Framework for Robust Pattern Recognition (Q5198613) (← links)
- Sparse System Identification in Pairs of Pulse and Takenaka--Malmquist Bases (Q5222159) (← links)
- Covariate-adjusted precision matrix estimation with an application in genetical genomics (Q5411019) (← links)
- Compressed sensing reconstruction using expectation propagation (Q5869953) (← links)