Highly Robust Error Correction byConvex Programming
From MaRDI portal
Publication:3604689
DOI10.1109/TIT.2008.924688zbMath1332.94096OpenAlexW2109921208MaRDI QIDQ3604689
Emmanuel J. Candès, Paige Randall
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2008.924688
Related Items (18)
DC approximation approaches for sparse optimization ⋮ Smoothing strategy along with conjugate gradient algorithm for signal reconstruction ⋮ Robust estimation for an inverse problem arising in multiview geometry ⋮ Streaming graph computations with a helpful advisor ⋮ Multiple hypothesis testing adjusted for latent variables, with an application to the AGEMAP gene expression data ⋮ A reduced half thresholding algorithm ⋮ Group sparse recovery in impulsive noise via alternating direction method of multipliers ⋮ On sparsity‐inducing methods in system identification and state estimation ⋮ Sharp non-asymptotic performance bounds for \(\ell_1\) and Huber robust regression estimators ⋮ Guarantees of total variation minimization for signal recovery ⋮ System identification in the presence of outliers and random noises: a compressed sensing approach ⋮ A half thresholding projection algorithm for sparse solutions of LCPs ⋮ Robustness analysis of a maximum correntropy framework for linear regression ⋮ Identification of switched linear systems via sparse optimization ⋮ Extragradient thresholding methods for sparse solutions of co-coercive ncps ⋮ DC Approximation Approach for ℓ0-minimization in Compressed Sensing ⋮ Analysis of a nonsmooth optimization approach to robust estimation ⋮ Adaptive identification of linear systems subject to Gross errors
This page was built for publication: Highly Robust Error Correction byConvex Programming
