[19] P. Ravikumar, M. J. Wainwright, G. Raskutti, and B. Yu, “High-dimensional covariance estimation by minimizing  $\ell_1$ -penalized log-determinant divergence,” *Electronic Journal of Statistics*, vol. 5, pp. 935–980, 2011.
[20] M. Yuan and Y. Lin, "Model selection and estimation in the Gaussian graphical model," Biometrika, vol. 94, no. 1, pp. 19-35, 2007.
[21] J. Duchi, S. Gould, and D. Koller, “Projected subgradient methods for learning sparse Gaussians,” in Conference on Uncertainty in Artificial Intelligence, 2008, p. 153–160.
[22] J. Friedman, T. Hastie, and R. Tibshirani, "Sparse inverse covariance estimation with the graphical lasso," Biostatistics, vol. 9, no. 3, pp. 432-441, 2008.
[23] Z. Lu, “Smooth optimization approach for sparse covariance selection,” SIAM Journal on Optimization, vol. 19, no. 4, pp. 1807–1827, 2009.
[24] Q. Sun, K. M. Tan, H. Liu, and T. Zhang, “Graphical nonconvex optimization via an adaptive convex relaxation,” in Proceedings of the 35th International Conference on Machine Learning, vol. 80, 2018, pp. 4810–4817.
[25] K. Scheinberg, S. Ma, and D. Goldfarb, "Sparse inverse covariance selection via alternating linearization methods," in Advances in Neural Information Processing Systems, vol. 23, 2010, pp. 2101-2109.
[26] A. Eftekhari, D. Pasadakis, M. Bollhöfer, S. Scheidegger, and O. Schenk, "Block-enhanced precision matrix estimation for large-scale datasets," Journal of computational science, vol. 53, p. 101389, 2021.
[27] J. Chen, P. Xu, L. Wang, J. Ma, and Q. Gu, “Covariate adjusted precision matrix estimation via nonconvex optimization,” in Proceedings of the 35th International Conference on Machine Learning, vol. 80, 2018, pp. 921–930.
[28] P. Xu, J. Ma, and Q. Gu, "Speeding up latent variable Gaussian graphical model estimation via nonconvex optimization," in Advances in Neural Information Processing Systems, vol. 30, 2017, pp. 1933-1944.
[29] E. Treister and J. S. Turek, "A block-coordinate descent approach for large-scale sparse inverse covariance estimation," Advances in neural information processing systems, vol. 27, 2014.
[30] Q. T. Dinh, A. Kyrillidis, and V. Cevher, “A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions,” in International Conference on Machine Learning, vol. 28, 2013, pp. 271–279.
[31] C.-J. Hsieh, M. A. Sustik, I. S. Dhillon, and P. Ravikumar, “QUIC: quadratic approximation for sparse inverse covariance estimation,” The Journal of Machine Learning Research, vol. 15, no. 1, pp. 2911–2947, 2014.
[32] L. Li and K.-C. Toh, "An inexact interior point method for  $L_{1}$ -regularized sparse covariance selection," Mathematical Programming Computation, vol. 2, no. 3, pp. 291-315, 2010.
[33] C. Wang, D. Sun, and K.-C. Toh, "Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm," SIAM Journal on Optimization, vol. 20, no. 6, pp. 2994-3013, 2010.
[34] E. M. Gafni and D. P. Bertsekas, “Two-metric projection methods for constrained optimization,” SIAM Journal on Control and Optimization, vol. 22, no. 6, pp. 936–964, 1984.
[35] D. P. Bertsekas, "Projected Newton methods for optimization problems with simple constraints," SIAM Journal on Control and Optimization, vol. 20, no. 2, pp. 221-246, 1982.
[36] D. Kim, S. Sra, and I. S. Dhillon, "Tackling box-constrained optimization via a new projected Quasi-Newton approach," SIAM Journal on Scientific Computing, vol. 32, no. 6, pp. 3548-3563, 2010.
[37] ——, “Fast Newton-type methods for the least squares nonnegative matrix approximation problem,” in SIAM International Conference on Data Mining, 2007, pp. 343–354.
[38] C.-J. Hsieh, M. A. Sustik, I. S. Dhillon, P. K. Ravikumar, and R. Poldrack, “BIG & QUIC: Sparse inverse covariance estimation for a million variables,” in Advances in Neural Information Processing Systems, vol. 26, 2013, pp. 3165–3173.