M. Lustig, D. L. Donoho, J. M. Santos, and J. M. Pauly, Compressed Sensing MRI, IEEE Signal Processing Magazine, vol.25, issue.2, pp.72-82, 2008.

E. J. Candès and M. B. Wakin, An Introduction To Compressive Sampling, IEEE Signal Proc. Magazine, pp.21-30, 2008.

S. Foucart and H. Rauhut, A Mathematical Introduction to Compressive Sensing, Applied and Numerical Harmonic Analysis

J. A. Tropp and S. J. Wright, Computational methods for sparse solution of linear inverse problems, Proceedings of the IEEE, pp.948-958, 2010.

M. F. Duarte and Y. C. Eldar, Structured Compressed Sensing: From Theory to Applications, IEEE Transactions on Signal Processing, vol.59, issue.9, pp.4053-4085, 2011.

T. Blumensath and M. E. Davies, Iterative hard thresholding for compressed sensing, Applied and Computational Harmonic Analysis, vol.27, issue.3, pp.265-274, 2009.

S. S. Chen, D. D. Donoho, and M. A. Saunders, Atomic Decomposition by Basis Pursuit, SIAM Review, vol.43, issue.1, pp.129-159, 2001.

S. Boyd and L. Vandenberghe, Convex Optimization, 2004.

R. Chartrand and W. Yin, Iteratively reweighted algorithms for compressive sensing, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, 2008.

H. Mohimani, M. Babaie-zadeh, and C. Jutten, A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm, IEEE Transactions on Signal Processing, vol.57, issue.1, pp.289-301, 2009.

H. S. Mousavi, V. Monga, and T. D. Tran, Iterative Convex Refinement for Sparse Recovery, IEEE Signal Proc. Letters, pp.1903-1907, 2015.

N. Parikh and S. Boyd, Proximal Algorithms, Foundations and Trends?? in Optimization, vol.1, issue.3, pp.123-231, 2014.

M. Sadeghi and M. Babaie-zadeh, Iterative Sparsification-Projection: Fast and Robust Sparse Signal Approximation, IEEE Transactions on Signal Processing, vol.64, issue.21, pp.5536-5548, 2016.

R. Eghbali, A. Kazerooni, A. Rashidinejad, and F. Marvasti, Iterative method with adaptive thresholding for sparse signal reconstruction, International Workshop on Sampling Theory and Applications (SAMPTA), 2011.

M. Azghani and F. Marvasti, Iterative methods for random sampling and compressed sensing recovery, Proceedings of the 10th International Conference on Sampling Theory and Applications (SAMPTA), 2013.

M. Azghani, P. Kosmas, and F. Marvasti, Microwave Medical Imaging Based on Sparsity and an Iterative Method With Adaptive Thresholding, IEEE Transactions on Medical Imaging, vol.34, issue.2, pp.357-365, 2015.

F. Marvasti and M. Boloursaz, Wideband analog to digital conversion by random or level crossing sampling, 2017.

P. Combettes and J. Pesquet, Proximal splitting methods in signal processing Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp.185-212, 2011.

J. Bolte, S. Sabach, and M. Teboulle, Proximal alternating linearized minimization for nonconvex and nonsmooth problems, Mathematical Programming, pp.459-494, 2014.

Y. Xu and W. Yin, A Globally Convergent Algorithm for Nonconvex Optimization Based on Block Coordinate Update, Journal of Scientific Computing, vol.38, issue.2, pp.1-35, 2017.
DOI : 10.1214/09-AOS729

I. Daubechies, M. Defrise, and C. De, An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, Communications on Pure and Applied Mathematics, vol.58, issue.11, pp.1413-1457, 2004.
DOI : 10.1002/0471221317

Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course, of Applied Optimization, 2004.

A. Beck and M. Teboulle, A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems, SIAM Journal on Imaging Sciences, vol.2, issue.1, pp.183-202, 2009.
DOI : 10.1137/080716542

P. Tseng, Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization, Journal of Optimization Theory and Applications, vol.109, issue.3, pp.475-494, 2001.

Y. Xu and W. Yin, A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion, SIAM Journal on Imaging Sciences, vol.6, issue.3, pp.1758-1789, 2013.
DOI : 10.1137/120887795

H. Attouch, J. Bolte, and B. F. Svaiter, Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward???backward splitting, and regularized Gauss???Seidel methods, Mathematical Programming, pp.91-129, 2013.

A. Blake and A. Zisserman, Visual Reconstruction, 1987.

M. Malek-mohammadi, A. Koochakzadeh, M. Babaie-zadeh, M. Jansson, and C. R. Rojas, Successive Concave Sparsity Approximation for Compressed Sensing, IEEE Transactions on Signal Processing, vol.64, issue.21, pp.5657-5671, 2016.

L. Zheng, A. Maleki, X. Wang, and T. Long, Does p-minimization outperform 1 -minimization?, 2015.

J. Fan and R. Li, Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties, Journal of the American Statistical Association, vol.96, issue.456, pp.1348-1360, 2001.

T. Zhang, Analysis of multi-stage convex relaxation for sparse regularization, Journal of Machine Learning Research, vol.11, pp.1081-1107, 2010.

J. Friedman, Fast sparse regression and classification, International Journal of Forecasting, vol.28, issue.3, pp.722-738, 2012.

S. Foucart and M. Lai, Sparsest solutions of underdetermined linear systems via <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msub><mml:mi>???</mml:mi><mml:mi>q</mml:mi></mml:msub></mml:math>-minimization for <mml:math altimg="si2.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mn>0</mml:mn><mml:mo><</mml:mo><mml:mi>q</mml:mi><mml:mo>???</mml:mo><mml:mn>1</mml:mn></mml:math>, Applied and Computational Harmonic Analysis, vol.26, issue.3, pp.395-407, 2009.

G. Gasso, A. Rakotomamonjy, and S. Canu, Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming, IEEE Transactions on Signal Processing, vol.57, issue.12, pp.4686-4698, 2009.

J. P. Vila and P. Schniter, Expectation-Maximization Gaussian-Mixture Approximate Message Passing, IEEE Transactions on Signal Processing, vol.61, issue.19, pp.4658-4672, 2013.

J. Wang, S. Kwon, and B. Shim, Generalized Orthogonal Matching Pursuit, IEEE Transactions on Signal Processing, vol.60, issue.12, pp.6202-6216, 2012.

R. Tibshirani, Regression shrinkage and selection via the lasso, J. Royal. Statist. Soc B, vol.58, issue.1, pp.267-288, 1996.

V. Cevher, Learning with compressible priors, Advances in Neural Information Processing Systems, 2009.

N. Hurley and S. Rickard, Comparing Measures of Sparsity, IEEE Transactions on Information Theory, vol.55, issue.10, pp.4723-4741, 2009.

J. Zhang, C. Zhao, D. Zhao, and W. Gao, Image compressive sensing recovery using adaptively learned sparsifying basis via L0 minimization, Signal Processing, vol.103, pp.114-126, 2014.

W. H. Young, On Classes of Summable Functions and their Fourier Series, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.87, issue.594, pp.225-229, 1912.

H. Attouch and J. Bolte, On the convergence of the proximal algorithm for nonsmooth functions involving analytic features, Mathematical Programming, vol.4, issue.1-2, pp.5-16, 2009.

F. Ghayem-received-her and B. Sc, degree in electrical engineering (communications), from EE department, 2013.

M. Babaie-zadeh, Iran in 1994, and the M.S degree in electrical engineering from Sharif University of Technology, Tehran, Iran, in 1996, and the Ph.D. degree in Signal Processing from Institute National Polytechnique of Grenoble (INPG), firstly as an assistant professor and since 2008 as an associate professor, His main research areas are Blind Source Separation (BSS) and Independent Component Analysis Sparse Signal Processing, and Statistical Signal Processing, 2002.

M. Skoglund, 97-SM'04) received the Ph.D. degree in 1997 from Chalmers University of Technology, Sweden, where he was appointed to the Chair in Communication Theory in 2003. At KTH, he heads the Department of Information Science and Engi- neering, 1997.

. Dr, He has authored and co-authored more than 138 journal and some 330 conference papers. Dr. Skoglund has served on numerous technical program committees for IEEE sponsored conferences Christian Jutten (AM 92-M 03-SM 06-F 08) received Ph.D. and Doctor es Sciences degrees in signal processing from Grenoble Institute of Technology (GIT), France, in 1981 and 1987, respectively . From 1982, he was an Associate Professor at GIT, before being Full Professor at University Joseph Fourier of Grenoble Since 80s, his research interests have been machine learning and source separation, including theory (separability, source separation in nonlinear mixtures, sparsity, multimodality) and applications (brain and hyperspectral imaging, chemical sensor array, speech) He is author or coauthor of more than 100 papers in international journals, 4 books, 27 keynote plenary talks and about 225 communications in international conferences. He has been visiting professor at Swiss Federal Polytechnic Institute He was director or deputy director of his lab from, During 2003?08 he was an associate editor with the IEEE Transactions on Communications and during 2008?12 he was on the editorial board for the IEEE Transactions on Information Theory at Riken labs (Japan, 1996) and at Campinas University especially head of the signal processing department (120 people) and deputy director of GIPSA-lab, 1989.

F. , F. National, and R. Center, From he was deputy director at the Institute for Information Sciences (INS2I) at French National Center of Research (CNRS) in charge of signal and image processing Christian Jutten was organizer or program chair of many international conferences, especially of the 1st International Conference on Blind Signal Separation and Independent Component Analysis in 1999 (ICA99) He has been a member of a few IEEE Technical Committees, and currently in SP Theory and Methods of the IEEE Signal Processing society. He received best paper awards of EURASIP (1992) and of IEEE GRSS (2012), and Medal Blondel (1997) from the French Electrical Engineering society for his contributions in source separation and independent component analysis. He was elevated as IEEE fellow, EURASIP fellow (2013) and as a Senior Member of Institut Universitaire de France since 2008. He is the recipient of a 2012 ERC Advanced Grant for the project Challenges in Extraction and Separation of Sources (CHESS). In 2016, he was awarded one Grand Prix of the French Acadmie des Sciences, 2008.