Simple bounds for recovering low-complexity models, Mathematical Programming, pp.1-13, 2012. ,
DOI : 10.1007/s10107-012-0540-0
A First-Order Primal-Dual Algorithm for Convex Problems with??Applications to Imaging, Journal of Mathematical Imaging and Vision, vol.60, issue.5, pp.120-145, 2011. ,
DOI : 10.1007/s10851-010-0251-1
URL : https://hal.archives-ouvertes.fr/hal-00490826
The Convex Geometry of Linear Inverse Problems, Foundations of Computational Mathematics, vol.1, issue.10, pp.805-849, 2012. ,
DOI : 10.1007/s10208-012-9135-7
Uncertainty principles and ideal atomic decomposition, IEEE Transactions on Information Theory, vol.47, issue.7, pp.2845-2862, 2001. ,
DOI : 10.1109/18.959265
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.9300
On Sparse Representations in Arbitrary Redundant Bases, IEEE Transactions on Information Theory, vol.50, issue.6, pp.1341-1344, 2004. ,
DOI : 10.1109/TIT.2004.828141
Linear convergence rates for Tikhonov regularization with positively homogeneous functionals, Inverse Problems, vol.27, issue.7, p.75014, 2011. ,
DOI : 10.1088/0266-5611/27/7/075014
Stable signal reconstruction via ? 1 -minimization in redundant, non-tight frames, IEEE Trans. on Sig. Proc, 2012. ,
A Unified Framework for High-Dimensional Analysis of $M$-Estimators with Decomposable Regularizers, Statistical Science, vol.27, issue.4, pp.538-557, 2012. ,
DOI : 10.1214/12-STS400SUPP
Robust Sparse Analysis Regularization, IEEE Transactions on Information Theory, vol.59, issue.4, 2012. ,
DOI : 10.1109/TIT.2012.2233859
URL : https://hal.archives-ouvertes.fr/hal-00627452