Dense Error Correction Via \ell^1-Minimization

DOI10.1109/TIT.2010.2048473MaRDI QIDQ5281420zbMATH OpenFDO

Authors

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2010.2048473

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(25)

• Geometric median and robust estimation in Banach spaces
• Learning from binary labels with instance-dependent noise
• A joint matrix minimization approach for multi-image face recognition
• Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework
• Robust group lasso: model and recoverability
• Sparse illumination learning and transfer for single-sample face recognition with image corruption and misalignment
• Compressed sensing and matrix completion with constant proportion of corruptions
• Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
• Stable restoration and separation of approximately sparse signals
• Correcting for unknown errors in sparse high-dimensional function approximation
• MAGMA: multilevel accelerated gradient mirror descent algorithm for large-scale convex composite minimization
• Highly Robust Error Correction byConvex Programming
• Sharp recovery bounds for convex demixing, with applications
• Compressed sensing with sparse corruptions: fault-tolerant sparse collocation approximations
• Quantile-based iterative methods for corrupted systems of linear equations
• scientific article; zbMATH DE number 7306888 (Why is no real title available?)
• Error localization of best \(L_1\) polynomial approximants
• Robust Subspace Discovery via Relaxed Rank Minimization
• Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound
• Error Correction for Discrete Tomography
• Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising
• Representation recovery via L₁-norm minimization with corrupted data
• Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification
• Oracle inequalities for corrupted compressed sensing
• Improving the compression rate versus \(L^{1}\) error ratio in cell-average error control algorithms

This page was built for publication: Dense Error Correction Via $\ell^1$-Minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281420)