F. J. Aragón-artacho and J. M. Borwein, Global convergence of a non-convex Douglas???Rachford iteration, Journal of Global Optimization, vol.73, issue.6, pp.753-769, 2013.
DOI : 10.1090/S0002-9904-1967-11761-0

M. S. Aslan, X. Chen, and H. Cheng, Analyzing and learning sparse and scale-free 712 networks using Gaussian graphical models, L. El Ghaoui, and A. d'Aspremont, Model selection through sparse maximum 715 likelihood estimation for multivariate Gaussian or binary data, J. Mach. Learn. Res. J. Mach. Learn. Res, vol.1, issue.9, pp.99-109, 2008.
DOI : 10.1007/s41060-016-0009-y

H. H. Bauschke, J. M. Borwein, and P. L. Combettes, Essential smoothness, essential strict 718 convexity, and Legendre functions in Banach spaces, Comm. Contemp. Math, vol.3, pp.719-615, 2001.

H. H. Bauschke, J. M. Borwein, and P. L. Combettes, Bregman monotone optimization 721 algorithms, SIAM J. Control Optim, Bauschke and P. L. Combettes, Convex Analysis and Monotone Operator Theory, pp.596-636, 2003.
DOI : 10.1137/s0363012902407120
URL : http://epubs.siam.org/doi/pdf/10.1137/S0363012902407120

H. Spaces, H. H. Bauschke, P. L. Combettes, and D. Noll, Joint minimization with alternating Breg- 727 man proximity operators, Pac. J. Optim, vol.2, pp.401-424, 2006.

A. Benfenati and V. Ruggiero, Inexact Bregman iteration with an application to Poisson 729 data reconstruction, Inverse Problems, vol.29, pp.1-32, 2013.
DOI : 10.1088/0266-5611/29/6/065016

A. Benfenati, V. Ruggiero, I. Bengtsson, K. Zyczkowski, S. Boyd et al., Geometry of Quantum States: An Introduction to Quan- 734 tum Entanglement https://doi.org/10 Convex Analysis and Nonlinear Optimization Distributed optimization and 738 statistical learning via the alternating direction method of multipliers, Found. Trends Mach. 739 Learn The Relaxation Method of Finding the Common Point of Convex Sets and Its 741 Application to the Solution of Problems, Inexact Bregman iteration for deconvolution of superimposed 731 extended and point sources, Commun. Nonlinear Sci. Numer. Simul. Convex Programming, USSR Computational 742 Mathematics and Mathematical Physics Brune, A. Sawatzky, and M. Burger, Primal and dual Bregman methods with application 744 to optical nanoscopy] M. Burger, A. Sawatzky, and G. Steidl, First Order Algorithms in Variational Image 747, pp.882-732, 1967.

J. Processing, E. J. Cai, Z. Cands, T. Shen, W. Cai et al., A singular value thresholding algorithm for matrix com- 750 pletion A constrained 1 minimization approach to sparse precision 752 matrix estimation Latent variable graphical model 755 selection via convex optimization Nonconvex splitting for regularized low-rank + sparse decomposition, SIAM J. Optim. J. Am. Stat. Assoc, vol.20, issue.106, pp.345-407, 2010.

. Trans, C. Process, P. L. Chaux, J. Combettes, V. R. Pesquet et al., A variational formulation for 760 frame-based inverse problems Nested iterative algorithms for convex con- 762 strained image recovery problem, Convergence Rate Analysis of the Majorize-Minimize 764, pp.5810-5819, 2007.

S. Algorithm, . Process, P. L. Lett, J. Combettes, . Pesquet et al., Rachford splitting approach to nonsmooth 767 convex variational signal recovery Fast projection onto the simplex and the 1 ball First-order methods for sparse covariance 780 selection, Proximal Splitting Methods in Signal Processing 770 Fixed-Point Algorithms for Inverse Problems in Science and Engineering On 775 the Lambert W function, pp.1284-1288, 1972.

]. J. Friedman, T. Hastie, R. Tibshirani, and J. , Sparse inverse covariance estimation with the 787 graphical lasso The split Bregman method for l1-regularized problems, Intelligence Biostatistics, issue.9, pp.145-152, 2008.

J. Guo, E. Levina, G. Michailidis, and J. Zhu, Joint estimation of multiple graphical models, Biometrika, vol.98, issue.1, pp.323-343, 2009.
DOI : 10.1093/biomet/asq060

G. Hardy, J. Littlewood, G. Pólya, D. R. Hunter, K. Lange et al., Inequalities, Cambridge Mathematical Library, Biometrika A tutorial on MM algorithms Amer. Statist, vol.79435, issue.58, pp.98-795, 1952.

M. W. Jacobson, J. A. Fessler, N. Komodakis, J. C. Pesquet, A. S. Lewis et al., Playing with duality: An overview of recent primal?dual 801 approaches for solving large-scale optimization problems Convex analysis on the Hermitian matrices Pong, Douglas?Rachford splitting for nonconvex optimization with application 806 to nonconvex feasibility problems An inexact interior point method for 1 ?regularized sparse covari- 809 ance selection Splitting algorithms for the sum of two nonlinear operators Smooth optimization approach for sparse covariance selection Adaptive first-order methods for general sparse inverse covariance selection, IEEE Signal Process. Mag. SIAM J. Optim. Math. Programm. Math. Program. Comput. 812 SIAM J. Numer. Anal. SIAM J. Optim, vol.16, issue.19, pp.2411-2422, 1979.

M. Anal, S. Appl, L. Ma, H. Xue, J. R. Zou et al., Matrix Differential Calculus with Applications in Statistics 821 and Econometrics Inequalities: Theory of Majorization 823 and its Applications The graphical lasso: New insights and alternatives, Electron1214/12-EJS740. 827 [48] N. Meinshausen and P. Bhlmann, High-dimensional graphs and variable selection 828 with the lasso Proximit et dualit dans un espace hilbertien Smooth minimization of non-smooth functions A parallel inertial proximal optimization method High-dimensional covariance 839 estimation by minimizing 1 -penalized log-determinant divergence, Electron Vayatis, Estimation of simultaneously sparse and low 842 rank matrices Rockafellar, Convex Analysis, Princeton landmarks in mathematics and physics Sparse permutation invariant co- 848 variance estimation Sparse inverse covariance selection via alternating 851 linearization methods, Alternating direction methods for latent variable Gaussian graph- 818 ical model selection Proceedings of the 29th International Conference on Machine Learning Advances in Neural Information Processing Systems] Y. Sun, P. Babu, and D. P. Palomar, Majorization-Minimization algorithms in signal pro- 854 cessing, communications, and machine learning Sparse Bayesian learning and the relevance vector machine, J. Mach. Learn. 857 Res.] E. van den Berg and M. P. Friedlander, Probing the Pareto frontier for basis pursuit solu- 859 This manuscript is for review purposes only, pp.31-2000, 1965.

S. J. Newton, D. P. Optim, B. D. Wipf, C. F. Rao, S. Wu et al., Sparse Bayesian learning for basis selection On the convergence properties of the EM algorithm Fused multiple graphical lasso Bregman iterative algorithms for 1 - 870 minimization with applications to compressed sensing Alternating direction methods for sparse covariance selection, Lin, Model selection and estimation in the Gaussian graphical model69] W. I. Zangwill, Nonlinear programming : a unified approach, pp.2994-3013, 1983.

P. Zhang, M. Burger, X. Bresson, S. Osher, X. Zhang et al., Bregmanized nonlocal regularization for 879 deconvolution and sparse reconstruction A unified primal-dual algorithm framework based 882 on Bregman iteration, Xiu, Z. Luo, and L. Kong, Sparse and low-rank covariance matrices estimation, pp.253-276, 1969.
DOI : 10.1137/090746379
URL : http://www.math.ucla.edu/~xbresson/papers/cam09-03.pdf