H. Attouch, J. Bolte, P. Redont, and A. Soubeyran, Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the Kurdyka-?ojasiewicz inequality, Mathematics of Operations Research, vol.35, issue.2, pp.438-457, 2010.

H. Attouch, J. Bolte, and B. Svaiter, Convergence of descent methods for semi-algebraic and tame problems: Proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods, Mathematical Programming, vol.137, issue.1-2, pp.91-129, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00790042

M. Aharon, M. Elad, and A. Bruckstein, An algorithm for designing overcomplete dictionaries for sparse representation, IEEE Transactions on signal processing, vol.54, issue.11, p.4311, 2006.

V. Abolghasemi, S. Ferdowsi, and S. Sanei, Fast and incoherent dictionary learning algorithms with application to fMRI. Signal, Image and Video Processing, vol.9, pp.147-158, 2015.

A. Atamturk, A. Gomez, and S. Han, Sparse and smooth signal estimation: Convexification of l0 formulations, 2018.

A. Amir-ali-ahmadi, P. A. Olshevsky, J. N. Parrilo, and . Tsitsiklis,

, NP-hardness of deciding convexity of quartic polynomials and related problems, Mathematical Programming, vol.137, issue.1-2, pp.453-476, 2013.

B. Taylor, R. J. Arnold, and . Tibshirani, Efficient implementations of the generalized lasso dual path algorithm, Journal of Computational and Graphical Statistics, vol.25, issue.1, pp.1-27, 2016.

R. Bracewell, R. Belotti, P. Bonami, M. Fischetti, A. Lodi et al., On handling indicator constraints in mixed integer programming, Computational Optimization and Applications, vol.65, issue.3, pp.545-566, 1986.

C. Bliek1ú, P. Bonami, and A. Lodi, Solving mixed-integer quadratic programming problems with IBM-CPLEX: A progress report, Proceedings of the twenty-sixth RAMP symposium, pp.16-17, 2014.

T. Blumensath and M. E. Davies, Iterative thresholding for sparse approximations, Journal of Fourier analysis and Applications, vol.14, issue.5-6, pp.629-654, 2008.

T. Blumensath and M. E. Davies, Iterative hard thresholding for compressed sensing, vol.27, pp.265-274, 2009.

M. José, . Bioucas-dias, . Mário, and . Figueiredo, A new twist: Twostep iterative shrinkage/thresholding algorithms for image restoration, IEEE Transactions on Image processing, vol.16, issue.12, pp.2992-3004, 2007.

A. Billionnet and S. Elloumi, Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem, Mathematical Programming, vol.109, issue.1, pp.55-68, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01124790

. Van-den, . Berg, F. Ewout, and P. Michael, Probing the Pareto frontier for basis pursuit solutions, SIAM Journal on Scientific Computing, vol.31, issue.2, pp.890-912, 2008.

P. Dimitri and . Bertsekas, Nonlinear programming, Journal of the Operational Research Society, vol.48, issue.3, pp.334-334, 1997.

P. Dimitri and . Bertsekas, Nonlinear programming. Athena scientific Belmont, 1999.

E. Robert and . Bixby, A brief history of linear and mixed-integer programming computation, Documenta Mathematica, pp.107-121, 2012.

C. Bao, H. Ji, Y. Quan, and Z. Shen, L0 norm based dictionary learning by proximal methods with global convergence, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp.3858-3865, 2014.

P. Bonami, A. Lodi, A. Tramontani, and S. Wiese, On mathematical programming with indicator constraints. Mathematical programming, vol.151, pp.191-223, 2015.

B. Borchers and J. E. Mitchell, Using an interior point method in a branch and bound algorithm for integer programming, Mathematical Sciences, vol.195, 1991.

B. Borchers and J. E. Mitchell, A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs, Computers & Operations Research, vol.24, issue.8, pp.699-701, 1997.

S. Bourguignon, J. Ninin, H. Carfantan, and M. Mongeau, Exact sparse approximation problems via mixed-integer programming: Formulations and computational performance, IEEE Transactions on Signal Processing, vol.64, issue.6, pp.1405-1419, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01254856

C. Bao, Y. Quan, and H. Ji, A convergent incoherent dictionary learning algorithm for sparse coding, European Conference on Computer Vision, pp.302-316, 2014.

L. Bo, X. Ren, and D. Fox, Hierarchical matching pursuit for image classification: Architecture and fast algorithms, Advances in neural information processing systems, pp.2115-2123, 2011.

L. Bo, X. Ren, and D. Fox, Multipath sparse coding using hierarchical matching pursuit, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp.660-667, 2013.

J. Bolte, S. Sabach, and M. Teboulle, Proximal alternating linearized minimization for nonconvex and nonsmooth problems, Mathematical Programming, vol.146, issue.1-2, pp.459-494, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00916090

I. Buciu, Image denoising via sparse data representation: A comparative study, Fundamentals of Electrical Engineering, 2014.

, International Symposium on, 2014.

T. Blumensath, M. Yaghoobi, and M. E. Davies, Iterative hard thresholding and l0 regularisation, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing-ICASSP'07, vol.3, 2007.

S. Chen, L. David, and . Donoho, Examples of basis pursuit, Wavelet Applications in Signal and Image Processing III, vol.2569, pp.564-575, 1995.

D. L. Scott-shaobing-chen, M. Donoho, and . Saunders, Atomic decomposition by basis pursuit, SIAM review, vol.43, issue.1, pp.129-159, 2001.

L. Chen and Y. Gu, Local and global optimality of lp minimization for sparse recovery, 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.3596-3600

, IEEE, 2015.

C. F. Chen and C. H. Hsiao, Haar wavelet method for solving lumped and distributed-parameter systems, IEE Proceedings-Control Theory and Applications, vol.144, issue.1, pp.87-94, 1997.

K. Charles and . Chui, An introduction to wavelets, 2016.

W. Chen, H. Ji, and Y. You, An augmented Lagrangian method for 1-regularized optimization problems with orthogonality constraints, SIAM Journal on Scientific Computing, vol.38, issue.4, pp.570-592, 2016.

T. Chang and C. Kuo, Texture analysis and classification with tree-structured wavelet transform, IEEE Transactions on image processing, vol.2, issue.4, pp.429-441, 1993.

R. Chalasani, C. Jose, N. Principe, and . Ramakrishnan, A fast proximal method for convolutional sparse coding, The 2013 International Joint Conference on Neural Networks (IJCNN), pp.1-5

, IEEE, 2013.

J. Emmanuel, J. K. Candes, T. Romberg, and . Tao, Stable signal recovery from incomplete and inaccurate measurements, Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences, vol.59, issue.8, pp.1207-1223, 2006.

B. S-grace-chang, M. Yu, and . Vetterli, Adaptive wavelet thresholding for image denoising and compression, IEEE transactions on image processing, vol.9, pp.1532-1546, 2000.

B. S-grace-chang, M. Yu, and . Vetterli, Spatially adaptive wavelet thresholding with context modeling for image denoising, IEEE Transactions on image Processing, vol.9, issue.9, pp.1522-1531, 2000.

I. Daubechies, Orthonormal bases of compactly supported wavelets, Communications on pure and applied mathematics, vol.41, issue.7, pp.909-996, 1988.

I. Daubechies, M. Defrise, and C. D. Mol, An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences, vol.57, issue.11, pp.1413-1457, 2004.

D. Leigh-donoho, I. Drori, Y. Tsaig, and J. Starck, Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit, 2006.

F. Dabov, K. , and K. Egiazarian, Image denoising by sparse 3-D transform-domain collaborative filtering, IEEE Transactions on image processing, vol.16, issue.8, pp.2080-2095, 2007.

L. David, X. Donoho, and . Huo, Uncertainty principles and ideal atomic decomposition, IEEE transactions on information theory, vol.47, issue.7, pp.2845-2862, 2001.

W. Dai and O. Milenkovic, Subspace pursuit for compressive sensing signal reconstruction, IEEE transactions on Information Theory, vol.55, pp.2230-2249, 2009.

B. Daniele and D. Mark, Learning incoherent dictionaries for sparse approximation using iterative projections and rotations, IEEE Transactions on Signal Processing, vol.61, issue.8, pp.2055-2065, 2013.

L. David and . Donoho, For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution, Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences, vol.59, issue.6, pp.797-829, 2006.

N. Minh, M. Do, and . Vetterli, The contourlet transform: An efficient directional multiresolution image representation, IEEE Transactions on image processing, vol.14, issue.12, pp.2091-2106, 2005.

W. Dong, L. Zhang, G. Shi, and X. Wu, Image deblurring and super-resolution by adaptive sparse domain selection and adaptive regularization, IEEE Transactions on Image Processing, vol.20, issue.7, pp.1838-1857, 2011.

M. Elad and M. Aharon, Image denoising via sparse and redundant representations over learned dictionaries, IEEE Transactions on Image processing, vol.15, issue.12, pp.3736-3745, 2006.

K. Engan, S. O. Aase, and J. Husoy, Method of optimal directions for frame design, 1999.

S. Acoustics and S. Processing, Proceedings. ICASSP99 (Cat. No. 99CH36258), vol.5, pp.2443-2446, 1999.

M. Elad, A. T. Mario, Y. Figueiredo, and . Ma, On the role of sparse and redundant representations in image processing, Proceedings of the IEEE, vol.98, issue.6, pp.972-982, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00568893

T. Bradley-efron, I. Hastie, R. Johnstone, and . Tibshirani, Least angle regression. The Annals of statistics, vol.32, pp.407-499, 2004.

M. Elad, Sparse and redundant representations: From theory to applications in signal and image processing, 2010.

Y. Fujiwara and Y. Ida, Hiroaki Shiokawa, and Sotetsu Iwamura. Fast lasso algorithm via selective coordinate descent, Thirtieth AAAI Conference on Artificial Intelligence, 2016.

M. Fischetti, A. Lodi, and A. Tramontani, On the separation of disjunctive cuts, Mathematical Programming, vol.128, issue.1-2, pp.205-230, 2011.

G. M. Fung and . Ol-mangasarian, Equivalence of minimal l0-and lpnorm solutions of linear equalities, inequalities and linear programs for sufficiently small p, vol.151, pp.1-10, 2011.

M. Feng, J. E. Mitchell, J. Pang, X. Shen, A. Wächter-;-zizhu-fan et al., L0-norm sparse representation based on modified genetic algorithm for face recognition, Journal of Visual Communication and Image Representation, vol.14, issue.2, pp.15-20, 2015.

S. Foucart, Hard thresholding pursuit: An algorithm for compressive sensing, SIAM Journal on Numerical Analysis, vol.49, issue.6, pp.2543-2563, 2011.

A. Golts and M. Elad, Linearized kernel dictionary learning, IEEE Journal of Selected Topics in Signal Processing, vol.10, issue.4, pp.726-739, 2016.

P. Garrigues and L. E. Ghaoui, An homotopy algorithm for the lasso with online observations, Advances in neural information processing systems, pp.489-496, 2009.

R. Gribonval, R. Jenatton, and F. Bach, Sparse and spurious: Dictionary learning with noise and outliers, IEEE Transactions on Information Theory, vol.61, issue.11, pp.6298-6319, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01025503

R. Garg and R. Khandekar, Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property, Proceedings of the 26th International Confer-ence on Machine Learning, vol.9, pp.337-344, 2009.

E. Philip, W. Gill, . Murray, A. Michael, J. A. Saunders et al., On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method, Mathematical programming, vol.36, issue.2, pp.183-209, 1986.

A. Graps, An introduction to wavelets, IEEE computational science and engineering, vol.2, issue.2, pp.50-61, 1995.

M. Ambros, S. Gleixner, and . Weltge, Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming

, International Conference on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems, pp.355-361, 2013.

K. Huang and S. Aviyente, Sparse representation for signal classification, Advances in neural information processing systems, pp.609-616, 2007.

K. Kyle, A. C. Herrity, J. A. Gilbert, and . Tropp, Sparse approximation via iterative thresholding, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings, vol.3, 2006.

A. Hyvärinen, P. Hoyer, and E. Oja, Image denoising by sparse code shrinkage, Intelligent Signal Processing, 1999.

P. Honeine, Analyzing sparse dictionaries for online learning with kernels, IEEE Transactions on Signal Processing, vol.63, issue.23, pp.6343-6353, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01965568

P. Honeine, Approximation errors of online sparsification criteria
URL : https://hal.archives-ouvertes.fr/hal-01965565

, IEEE Transactions on Signal Processing, vol.63, issue.17, pp.4700-4709, 2015.

P. Honeine, An eigenanalysis of data centering in machine learning
URL : https://hal.archives-ouvertes.fr/hal-01966116

. Corr, , vol.2904, pp.1-13, 2016.

L. Karla, T. K. Hoffman, and . Ralphs, Integer and combinatorial optimization. Encyclopedia of Operations Research and Management Science, pp.771-783, 2013.

C. Robert and . Jeroslow, There cannot be any algorithm for integer programming with quadratic constraints, Operations Research, vol.21, issue.1, pp.221-224, 1973.

Z. Jiang, Z. Lin, and L. Davis, Label consistent K-SVD: Learning a discriminative dictionary for recognition. IEEE transactions on pattern analysis and machine intelligence, vol.35, pp.2651-2664, 2013.

R. Jenatton, J. Mairal, G. Obozinski, and F. Bach, Proximal methods for sparse hierarchical dictionary learning

, ICML, vol.1, 2010.

S. Jokar and M. E. Pfetsch, Exact and approximate sparse solutions of underdetermined linear equations, SIAM Journal on Scientific Computing, vol.31, issue.1, pp.23-44, 2008.

V. Katkovnik-karen-egiazarian-kostadin-dabov and A. Foi, BM3D image denoising with shape-adaptive principal component analysis, Workshop on Signal Processing Adaptive Sparse Structed Representations, 2009.

K. Kumar and C. Desrosiers, A sparse coding approach for the efficient representation and segmentation of white matter fibers, 2016 IEEE 13th International Symposium on Biomedical Imaging (ISBI), pp.915-919, 2016.

R. Karuppiah and I. E. Grossmann, A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures, Journal of global optimization, vol.41, issue.2, pp.163-186, 2008.

J. Kim, Y. Kim, and Y. Kim, A gradient-based optimization algorithm for lasso, Journal of Computational and Graphical Statistics, vol.17, issue.4, pp.994-1009, 2008.

J. Kormylo, Maximum likelihood detection and estimation of Bernoulli-Gaussian processes, IEEE transactions on information theory, vol.28, pp.482-488, 1982.

M. Kowalski, Thresholding rules and iterative shrinkage/thresholding algorithm: A convergence study, IEEE International Conference on Image Processing (ICIP), pp.4151-4155, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01102810

, IEEE, 2014.

Y. Kruger, On Fréchet subdifferentials, Journal of Mathematical Sciences, vol.116, issue.3, pp.3325-3358, 2003.

W. M-amin-khajehnejad, . Xu, B. Salman-avestimehr, and . Hassibi, Improving the thresholds of sparse recovery: An analysis of a two-step reweighted basis pursuit algorithm, IEEE Transactions on Information Theory, vol.61, issue.9, pp.5116-5128, 2015.

H. Kushner and . George-yin, Stochastic approximation and recursive algorithms and applications, vol.35, 2003.

H. Lee, A. Battle, R. Raina, and A. Ng, Efficient sparse coding algorithms, Advances in neural information processing systems, pp.801-808, 2007.

Y. Liu, S. Canu, P. Honeine, and S. Ruan, Mixed integer programming for sparse coding: Application to image denoising, IEEE Transactions on Computational Imaging, vol.5, issue.3, pp.354-365, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02183028

Z. Lin, M. Chen, L. Wu, and Y. Ma, The augmented Lagrange multiplier method for exact recovery of corrupted low-rank X BIBLIOGRAPHY matrices, Coordinated Science Laboratory Report, p.247, 2009.

Z. Li, S. Ding, T. Hayashi, and Y. Li, Incoherent dictionary learning with log-regularizer based on proximal operators

, Digital Signal Processing, vol.63, pp.86-99, 2017.

Z. Li, S. Ding, and Y. Li, A fast algorithm for learning overcomplete dictionary for sparse representation based on proximal operators, Neural computation, vol.27, issue.9, pp.1951-1982, 2015.

L. Tai-sing, Image representation using 2D Gabor wavelets, IEEE Transactions, vol.18, issue.10, pp.959-971, 1996.

Z. Li, T. Hayashi, S. Ding, and X. Li, An efficient algorithm for incoherent analysis dictionary learning based on proximal operator, Systems, Man, and Cybernetics (SMC), 2016 IEEE International Conference on, pp.3546-003549, 2016.

H. Li, X. He, D. Tao, Y. Tang, and R. Wang, Joint medical image fusion, denoising and enhancement via discriminative low-rank sparse dictionaries learning, Pattern Recognition, vol.79, pp.130-146, 2018.

L. Li, S. Li, and Y. Fu, Learning low-rank and discriminative dictionary for image classification, Image and Vision Computing, vol.32, issue.10, pp.814-823, 2014.

T. Lin, S. Liu, and H. Zha, Incoherent dictionary learning for sparse representation, Proceedings of the 21st International Conference on Pattern Recognition (ICPR2012), pp.1237-1240, 2012.

L. Erwan, S. Pennec, and . Mallat, Image compression with geometrical wavelets, Proceedings 2000 International Conference on Image Processing, vol.1, pp.661-664

, IEEE, 2000.

T. Jeff, . Linderoth, W. P. Martin, and . Savelsbergh, A computational study of search strategies for mixed integer programming, INFORMS Journal on Computing, vol.11, issue.2, pp.173-187, 1999.

Y. Liu and Y. Wu, Variable selection via a combination of the l0 and l1 penalties, Journal of Computational and Graphical Statistics, vol.16, issue.4, pp.782-798, 2007.

S. Mallat, A wavelet tour of signal processing, 1999.

M. Masood, T. Meinshausen, and P. Bühlmann, High-dimensional graphs and variable selection with the lasso. The annals of statistics, IEEE Transactions on Signal Processing, vol.61, issue.21, pp.1436-1462, 2006.

J. Mairal, F. Bach, and J. Ponce, Task-driven dictionary learning. IEEE transactions on pattern analysis and machine intelligence, vol.34, pp.791-804, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00521534

B. Mailhé, D. Barchiesi, M. D. Plumbley, . Ink-svd-;-julien, F. Mairal et al., Learning incoherent dictionaries for sparse representations, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), vol.8, pp.85-283, 2012.

J. Mairal, F. Bach, J. Ponce, and G. Sapiro, Online dictionary learning for sparse coding, Proceedings of the 26th annual international conference on machine learning, pp.689-696

J. Mairal, F. Bach, J. Ponce, and G. Sapiro, Online learning for matrix factorization and sparse coding, Journal of Machine Learning Research, vol.11, pp.19-60, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00408716

M. G-hosein-mohimani, C. Babaie-zadeh, and . Jutten, Fast sparse representation based on smoothed l0 norm, International Conference on Independent Component Analysis and Signal Separation, pp.389-396, 2007.

M. Dmitry, M. Malioutov, A. S. Cetin, and . Willsky, Optimal sparse representations in general overcomplete bases, IEEE International Conference on Acoustics, Speech, and Signal Processing, p.793, 2004.

D. Malioutov, M. Cetin, and A. S. Willsky, A sparse signal reconstruction perspective for source localization with sensor arrays, IEEE transactions on signal processing, vol.53, issue.8, pp.3010-3022, 2005.

M. Dmitry, M. Malioutov, A. S. Cetin, and . Willsky, Homotopy continuation for sparse signal representation, IEEE International Conference on Acoustics, Speech, and Signal Processing, vol.5, 2005.

N. Meinshausen, Relaxed lasso, Computational Statistics & Data Analysis, vol.52, issue.1, pp.374-393, 2007.

Y. Meyer, Wavelets and operators, vol.1, 1995.

E. John and . Mitchell, Branch-and-cut algorithms for combinatorial optimization problems. Handbook of applied optimization, vol.1, pp.65-77, 2002.

S. Panos-p-markopoulos, S. Kundu, D. A. Chamadia, and . Pados, Efficient l1-norm principal-component analysis via bit flipping, IEEE Transactions on Signal Processing, vol.65, issue.16, pp.4252-4264, 2017.

J. Ponce, Discriminative sparse image models for class-specific edge detection and image interpretation, European Conference on Computer Vision, pp.43-56, 2008.

H. Marchand, A. Martin, R. Weismantel, and L. Wolsey, Cutting planes in integer and mixed integer programming, Discrete Applied Mathematics, vol.123, issue.1-3, pp.397-446, 2002.

L. Mancera, J. Portilla-;-julien, J. Mairal, G. Ponce, A. Sapiro et al., L0-norm-based sparse representation through alternate projections, 2006 International Conference on Image Processing, pp.2089-2092, 2006.

R. Francis and . Bach, Supervised dictionary learning, Advances in neural information processing systems, pp.1033-1040, 2009.

J. Mairal, G. Sapiro, and M. Elad, Learning multiscale sparse representations for image and video restoration, Multiscale Modeling & Simulation, vol.7, pp.214-241, 2008.

F. C. João, . Mota, M. F. João, . Xavier, M. Q. Pedro et al., Distributed basis pursuit, IEEE Transactions on Signal Processing, vol.60, issue.4, pp.1942-1956, 2011.

N. Meinshausen and B. Yu, Lasso-type recovery of sparse representations for high-dimensional data. The annals of statistics, vol.37, pp.246-270, 2009.

J. Mairal and B. Yu, Complexity analysis of the lasso regularization path, Proceedings of the 29th International Coference on International Conference on Machine Learning, pp.1835-1842, 2012.

G. Stéphane, Z. Mallat, and . Zhang, Matching pursuits with time-frequency dictionaries, IEEE Transactions on signal processing, vol.41, issue.12, pp.3397-3415, 1993.

F. Nie, H. Huang, X. Cai, and C. H. Ding, Efficient and robust feature selection via joint l2, 1-norms minimization, Advances in neural information processing systems, pp.1813-1821, 2010.

M. Nikolova, Description of the minimizers of least squares regularized with l0-norm: Uniqueness of the global minimizer, SIAM Journal on Imaging Sciences, vol.6, issue.2, pp.904-937, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00723812

M. Nikolova, Relationship between the optimal solutions of least squares regularized with l0-norm and constrained by k-sparsity, Applied and Computational Harmonic Analysis, vol.41, pp.237-265, 2016.
URL : https://hal.archives-ouvertes.fr/hal-00944006

A. John, R. Nelder, and . Mead, A simplex method for function minimization, The computer journal, vol.7, issue.4, pp.308-313, 1965.

A. Neumaier and O. Shcherbina, Safe bounds in linear and mixed-integer linear programming, Mathematical Programming, vol.99, issue.2, pp.283-296, 2004.

D. Needell and . Tropp, CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, Applied and computational harmonic analysis, vol.26, issue.3, pp.301-321, 2009.

D. Needell and R. Vershynin, Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit, Foundations of computational mathematics, vol.9, issue.3, pp.317-334, 2009.

J. Nocedal and S. Wright, Numerical optimization, 2006.

A. Bruno, D. Olshausen, and . Field, Emergence of simple-cell receptive field properties by learning a sparse code for natural images, Nature, vol.381, issue.6583, p.607, 1996.

N. Parikh and S. Boyd, Proximal algorithms, Foundations and Trends in Optimization, vol.1, issue.3, pp.127-239, 2014.

T. Park and G. Casella, The Bayesian lasso, Journal of the American Statistical Association, vol.103, issue.482, pp.681-686, 2008.

M. Y. Park and T. Hastie, L1-regularization path algorithm for generalized linear models, Journal of the Royal Statistical Society: Series B (Statistical Methodology), vol.69, issue.4, pp.659-677, 2007.

R. Peharz and F. Pernkopf, Sparse nonnegative matrix factorization with l0-constraints, Neurocomputing, vol.80, pp.38-46, 2012.

Y. Chandra-pati, R. Rezaiifar, and P. Krishnaprasad, Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition, Proceedings of 27th Asilomar conference on signals, systems and computers, pp.40-44, 1993.

R. Rubinstein, A. M. Bruckstein, and M. Elad, Dictionaries for sparse representation modeling, Proceedings of the IEEE, vol.98, issue.6, pp.1045-1057, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00565811

I. Ramírez, F. Lecumberry, and G. Sapiro, Sparse modeling with universal priors and learned incoherent dictionaries, University of Minnesota. Institute for Mathematics and Its Applications, 2009.

N. Rao, R. Nowak, C. Cox, and T. Rogers, Classification with the sparse group lasso, IEEE Transactions on Signal Processing, vol.64, issue.2, pp.448-463, 2015.

S. Ravishankar, R. R. Nadakuditi, and J. A. Fessler, Efficient sum of outer products dictionary learning (soup-dil) and its application to inverse problems, IEEE transactions on computational imaging, vol.3, issue.4, pp.694-709, 2017.

F. Rodriguez and G. Sapiro, Sparse representations for image classification: Learning discriminative and reconstructive nonparametric dictionaries, 2008.

F. Rinaldi, F. Schoen, and M. Sciandrone, Concave programming for minimizing the zero-norm over polyhedral sets, Computational Optimization and Applications, vol.46, issue.3, pp.467-486, 2010.

R. Rubinstein, M. Zibulevsky, and M. Elad, Efficient implementation of the K-SVD algorithm using batch orthogonal matching pursuit, Computer Science Department, 2008.

E. Soubies, L. Blanc-féraud, and G. Aubert, A unified view of exact continuous penalties for l2-l0 minimization, SIAM Journal on Optimization, vol.27, issue.3, pp.2034-2060, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01267701

J. Starck, E. J. Candès, and D. L. Donoho, The curvelet transform for image denoising, IEEE Transactions on image processing, vol.11, issue.6, pp.670-684, 2002.

K. Schnass, On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD. Applied and Computational Harmonic Analysis, vol.37, pp.464-491, 2014.

T. Schouwenaars, B. D. Moor, E. Feron, and J. How, Mixed integer programming for multi-vehicle path planning, 2001.

, European Control Conference (ECC), pp.2603-2608, 2001.

N. Leslie, M. Smith, and . Elad, Improving dictionary learning: Multiple dictionary updates and coefficient reuse, IEEE Signal Processing Letters, vol.20, issue.1, pp.79-82, 2012.

M. Umut?en and H. Erdogan, Linear classifier combination and selection using group sparse regularization and hinge loss. Pattern Recognition Letters, vol.34, pp.265-274, 2013.

C. Soussen, J. Idier, D. Brie, and J. Duan, From Bernoulli-Gaussian deconvolution to sparse signal restoration, IEEE Transactions on Signal Processing, vol.59, issue.10, pp.4572-4584, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00443842

C. Soussen, J. Idier, J. Duan, and D. Brie, Homotopy based algorithms for L0-regularized least-squares, IEEE Transactions on Signal Processing, vol.63, issue.13, pp.3301-3316, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00948313

J. Starck, F. Murtagh, and J. Fadili, Sparse image and signal processing: Wavelets and related geometric multiscale analysis, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01658853

D. Solow, Linear and nonlinear programming, 2007.

P. Schniter, C. Lee, J. Potter, and . Ziniel, Fast Bayesian matching pursuit, 2008 Information Theory and Applications Workshop, pp.326-333, 2008.

S. Sen, D. Hanif, and . Sherali, Decomposition with branch-andcut approaches for two-stage stochastic mixed-integer programming, Mathematical Programming, vol.106, issue.2, pp.203-223, 2006.

R. Slama and H. Wannous, Mohamed Daoudi, and Anuj Srivastava. Accurate 3D action recognition using learning on the Grassmann manifold, Pattern Recognition, vol.48, issue.2, pp.556-567, 2015.

X. Shi, Y. Yang, Z. Guo, and Z. Lai, Face recognition by sparse discriminant analysis via joint l2, 1-norm minimization, Pattern Recognition, vol.47, issue.7, pp.2447-2453, 2014.

A. Joel, A. C. Tropp, and . Gilbert, Signal recovery from random measurements via orthogonal matching pursuit, IEEE Transactions on information theory, vol.53, pp.4655-4666, 2007.

R. Tibshirani, Regression shrinkage and selection via the lasso, Journal of the Royal Statistical Society: Series B (Methodological), vol.58, issue.1, pp.267-288, 1996.

. Tlz-+-19]-hongzhong, X. Tang, X. Li, D. Zhang, and . Zhang,

T. Mao and . Liu, Coherence-regularized discriminative dictionary learning for histopathological image classification. Signal, Image and Video Processing, vol.13, pp.923-931, 2019.

A. Joel and . Tropp, Greed is good: Algorithmic results for sparse approximation, IEEE Transactions on Information theory, vol.50, issue.10, pp.2231-2242, 2004.

M. Tawarmalani, V. Nikolaos, and . Sahinidis, Global optimization of mixed-integer nonlinear programs: A theoretical and computational study, Mathematical programming, vol.99, issue.3, pp.563-591, 2004.

M. Unser-;-michael-ulbrich, Z. Wen, C. Yang, D. Klockner, and Z. Lu, A proximal gradient method for ensemble density functional theory, IEEE Transactions on image processing, vol.4, issue.11, pp.1975-2002, 1995.

J. P. Vielma, S. Ahmed, and G. L. Nemhauser, A lifted linear programming branch-and-bound algorithm for mixedinteger conic quadratic programs, INFORMS Journal on Computing, vol.20, issue.3, pp.438-450, 2008.

. Hien-van-nguyen, M. Vishal, . Patel, M. Nasser, R. Nasrabadi et al., Kernel dictionary learning, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.2021-2024, 2012.

M. Oskar-von-stryk and . Glocker, Decomposition of mixed-integer optimal control problems using branch and bound and sparse direct collocation, The 4th International Conference on Automation of Mixed Processes: Hybrid Dynamic Systems, pp.99-104, 2000.

Q. Wang, J. Gao, and H. Li, Grassmannian manifold optimization assisted sparse spectral clustering, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp.5258-5266, 2017.

Z. Wen, D. Goldfarb, and W. Yin, Alternating direction augmented Lagrangian methods for semidefinite programming

F. Wu, X. Jing, X. You, D. Yue, R. Hu et al., Multi-view low-rank dictionary learning for image classification, Mathematical Programming Computation, vol.2, issue.3-4, pp.143-154, 2010.

J. Wang, S. Kwon, and B. Shim, Generalized orthogonal matching pursuit, IEEE Transactions on signal processing, vol.60, issue.12, pp.6202-6216, 2012.

T. Tong, K. Wu, and . Lange, Coordinate descent algorithms for lasso penalized regression, The Annals of Applied Statistics, vol.2, issue.1, pp.224-244, 2008.

J. Stephen, R. D. Wright, . Nowak, and . Figueiredo, Sparse reconstruction by separable approximation, IEEE Transactions on Signal Processing, vol.57, issue.7, pp.2479-2493, 2009.

+. Wright, A. Y. Yang, A. Ganesh, Y. Shankar-sastry, and . Ma, Robust face recognition via sparse representation, IEEE transactions on pattern analysis and machine intelligence, vol.31, pp.210-227, 2008.

M. Wang, S. Yang, Y. Wan, and J. Wang, High resolution radar imaging based on compressed sensing and fast Bayesian matching pursuit, 2011 International Workshop on Multi-Platform/Multi-Sensor Remote Sensing and Mapping, pp.1-5, 2011.

L. Xu, S. Zheng, and J. Jia, Unnatural l0 sparse representation for natural image deblurring, Proceedings of the IEEE conference on computer vision and pattern recognition, pp.1107-1114, 2013.

X. Yuan, X. Liu, and S. Yan, Visual classification with multitask joint sparse representation, IEEE Transactions on Image Processing, vol.21, issue.10, pp.4349-4360, 2012.

X. Yuan, P. Li, and T. Zhang, Gradient hard thresholding pursuit for sparsity-constrained optimization, International Conference on Machine Learning, pp.127-135, 2014.

X. Yuan, P. Li, and T. Zhang, Gradient hard thresholding pursuit, Journal of Machine Learning Research, vol.18, pp.1-43, 2018.

J. Yang, Y. Peng, W. Xu, and Q. Dai, Ways to sparse representation: An overview. Science in China series F: information sciences, vol.52, pp.695-703, 2009.

J. Yang and X. Yuan, Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization, Mathematics of computation, vol.82, issue.281, pp.301-329, 2013.

Y. Zhou, J. Han, X. Yuan, Z. Wei, and R. Hong, Inverse sparse group lasso model for robust object tracking, IEEE Transactions on Multimedia, vol.19, issue.8, pp.1798-1810, 2017.

Y. Zhang, Z. Jiang, and L. Davis, Learning structured low-rank representations for image classification, Proceedings of the IEEE conference on computer vision and pattern recognition, pp.676-683, 2013.

Q. Zhang and B. Li, Discriminative K-SVD for dictionary learning in face recognition, IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp.2691-2698, 2010.

W. Zuo, D. Meng, L. Zhang, X. Feng, and D. Zhang, A generalized iterated shrinkage algorithm for non-convex sparse coding, Proceedings of the IEEE international conference on computer vision, pp.217-224, 2010.

H. Zou, ;. Zhang, H. Sun, and Z. Ji, Kernel dictionary learning based discriminant analysis, Guiyu Xia, Lei Feng, and Quansen Sun, vol.101, pp.470-484, 2006.

Z. Zhang, Y. Xu, J. Yang, X. Li, and D. Zhang, A survey of sparse representation: Algorithms and applications, vol.3, pp.490-530, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01311245

P. Zhao and B. Yu, On model selection consistency of lasso, Journal of Machine learning research, vol.7, pp.2541-2563, 2006.

K. Zhang, W. Zuo, Y. Chen, D. Meng, and L. Zhang, Beyond a Gaussian denoiser: Residual learning of deep CNN for image denoising, IEEE Transactions on Image Processing, vol.26, issue.7, pp.3142-3155, 2017.

H. Zhu, X. Zhang, D. Chu, and L. Liao, Résumé Cette monographie traite du problème d'apprentissage de dictionnaire parcimonieux associé à la pseudo-norme 0 . Ce problème est classiquement traité par une procédure de relaxation alternée itérative en deux phases : un codage parcimonieux (sparse coding) et une réactualisation du dictionnaire. Cependant, le problème d'optimisation associé à ce codage parcimonieux s'avère être non convexe et NP-difficile, ce qui a justifié la recherche de relaxations et d'algorithmes gloutons pour obtenir une bonne approximation de la solution globale du problème. A l'inverse, nous reformulons le problème comme un programme quadratique mixte en nombres entiers (MIQP) permettant d'obtenir l'optimum global du problème. La principale difficulté de cette approche étant le temps de calcul, nous proposons deux méthodes (la relaxation par l'ajout de contraintes complémentaires et l'initialisation par la méthode du gradient proximal) permettant de le réduire, Nonconvex and nonsmooth optimization with generalized orthogonality constraints: An approximate augmented Lagrangian method, vol.72, pp.331-372, 2017.