L1-MAGIC

swMATH12430MaRDI QIDQ24358FDOQ24358

Author name not available (Why is that?)

Cited In (33)

• Sparsity-promoting and edge-preserving maximum a posteriori estimators in non-parametric Bayesian inverse problems
• Fixed point and Bregman iterative methods for matrix rank minimization
• An alternating direction method for finding Dantzig selectors
• A Compressed Sensing Framework for Monte Carlo Transport Simulations Using Random Disjoint Tallies
• Reformulations for utilizing separability when solving convex MINLP problems
• 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
• On the distance concentration awareness of certain data reduction techniques
• Computational Spectral and Ultrafast Imaging via Convex Optimization
• A Greedy Algorithm for Sparse Precision Matrix Approximation
• Primal–dual first-order methods for a class of cone programming
• Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
• Explicit time stepping of PDEs with local refinement in space-time
• 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
• Two Algorithms for Compressed Sensing of Sparse Tensors
• Robust visual tracking with structured sparse representation appearance model
• An Introduction to Compressed Sensing
• 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
• Covariate-adjusted precision matrix estimation with an application in genetical genomics
• Templates for convex cone problems with applications to sparse signal recovery
• A Regularized Correntropy Framework for Robust Pattern Recognition
• Multicompartment magnetic resonance fingerprinting
• Sparse optimization of vibration signal by ADMM
• Compressed sensing reconstruction using expectation propagation
• Sure independence screening and compressed random sensing
• Sparse System Identification in Pairs of Pulse and Takenaka--Malmquist Bases

This page was built for software: L1-MAGIC