Fast algorithms for sparse inverse covariance estimation

References

• O. Banerjee, L. El Ghaoui, and A. d'Aspremont, Model selection through sparse maximum likelihood estimation for multivariate gaussian or binary data, J. Mach. Learn. Res. 9 (2008), pp. 485–516.
   Web of Science ®Google Scholar
• T. Cai, W. Liu, and X. Luo, A constrained ℓ1 minimization approach to sparse precision matrix estimation, J. Amer. Statist. Assoc. 106 (2011), pp. 594–607. doi: 10.1198/jasa.2011.tm10155
   Web of Science ®Google Scholar
• T.T. Cai, W. Liu, and H.H. Zhou, Estimating sparse precision matrix: Optimal rates of convergence and adaptive estimation, Ann. Statist. 44 (2016), pp. 455–488. doi: 10.1214/13-AOS1171
   Web of Science ®Google Scholar
• X. Chen, Y.H. Kim, and Z.J. Wang, Efficient minimax estimation of a class of high-dimensional sparse precision matrices, IEEE. Trans. Signal Process. 60(6) (2012), pp. 2899–2912. doi: 10.1109/TSP.2012.2189109
   Web of Science ®Google Scholar
• C. Chen, B. He, Y. Ye, and X. Yuan, The direct extension of admm for multi-block convex minimization problems is not necessarily convergent, Math. Program. 155 (2016), pp. 57–79. doi: 10.1007/s10107-014-0826-5
   Web of Science ®Google Scholar
• Y.H. Dai, D. Han, X. Yuan, and W.Z. Zhang, A sequential updating scheme of the lagrange multiplier for separable convex programming, Math. Comput. 86 (2017), pp. 315–343. doi: 10.1090/mcom/3104
   Web of Science ®Google Scholar
• A. D'Aspremont, O. Banerjee, and L.E. Ghaoui, First-order methods for sparse covariance selection, SIAM J. Matrix Anal. Appl. 30(1) (2006), pp. 56–66. doi: 10.1137/060670985
   Web of Science ®Google Scholar
• A. d'Aspremont, O. Banerjee, and L. El Ghaoui, First-order methods for sparse covariance selection, SIAM J. Matrix Anal. Appl. 30(1) (2008), pp. 56–66. doi: 10.1137/060670985
   Web of Science ®Google Scholar
• W. Deng and W. Yin, On the global and linear convergence of the generalized alternating direction method of multipliers, J. Sci. Comput. 66(3) (2016), pp. 889–916. doi: 10.1007/s10915-015-0048-x
   Web of Science ®Google Scholar
• J. Fan, Y. Feng, and Y. Wu, Network exploration via the adaptive lasso and scad penalties, Ann. Appl. Statist. 3(2) (2009), pp. 521–541. doi: 10.1214/08-AOAS215
   PubMed Web of Science ®Google Scholar
• Z.Z. Feng, L. Fang, and G. He, An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming, Optimization 63(5) (2014), pp. 679–691. doi: 10.1080/02331934.2012.678849
   Web of Science ®Google Scholar
• J. Friedman, T. Hastie, and R. Tibshirani, Sparse inverse covariance estimation with the graphical lasso, Biostatist 9 (2008), pp. 432–441. doi: 10.1093/biostatistics/kxm045
   PubMed Web of Science ®Google Scholar
• T. Goldstein and S. Osher, The split Bregman method for L1-regularized problems, SIAM J. Imaging Sci. 2(2) (2009), pp. 323–343. doi: 10.1137/080725891
   Web of Science ®Google Scholar
• D. Han and X. Yuan, A note on the alternating direction method of multipliers, J. Optim. Theory Appl. 155(1) (2012), pp. 227–238. doi: 10.1007/s10957-012-0003-z
   Web of Science ®Google Scholar
• C. Han, T. Feng, G. He, and T. Guo, Parallel variable distribution algorithm for constrained optimization with nonmonotone technique, J. Appl. Math. 2013(1) (2013), pp. 401–420.
   Google Scholar
• C.-Y. Han, F.-Y. Zheng, T.-D. Guo, and G. He, Parallel algorithms for large-scale linearly constrained minimization problem, Acta Math. Appl. Sin. Engl. Ser. 30(3) (2014), pp. 707–720. doi: 10.1007/s10255-013-0300-9
   Web of Science ®Google Scholar
• B. He, H. Yang, and S. Wang, Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities, J. Optim. Theory Appl. 106(2) (2000), pp. 337–356. doi: 10.1023/A:1004603514434
   Web of Science ®Google Scholar
• B. He, L. Liao, D. Han, and H. Yang, A new inexact alternating directions method for monotone variational inequalities, Math. Program. 92(1, Ser. A) (2002), pp. 103–118. doi: 10.1007/s101070100280
   Web of Science ®Google Scholar
• B. He, M. Tao, and X. Yuan, Alternating direction method with gaussian back substitution for separable convex programming, SIAM J. Optim. 22(2) (2011), pp. 313–340. doi: 10.1137/110822347
   Web of Science ®Google Scholar
• K.R. Hess, K. Anderson, W.F. Symmans, V. Valero, N. Ibrahim, J.A. Mejia, D. Booser, R.L. Theriault, A.U. Buzdar, P.J. Dempsey, R. Rouzier, N. Sneige, J.S. Ross, T. Vidaurre, H.L. Gómez, G.N. Hortobagyi, and L. Pusztai, Pharmacogenomic predictor of sensitivity to preoperative chemotherapy with paclitaxel and fluorouracil, doxorubicin, and cyclophosphamide in breast cancer, J. Clin. Oncol. 24 (2006), pp. 4236–4244. doi: 10.1200/JCO.2006.05.6861
   PubMed Web of Science ®Google Scholar
• C. Lam and J. Fan, Sparsistency and rates of convergence in large covariance matrix estimation, Ann. Stat. 37(6B) (2009), pp. 4254–4278. doi: 10.1214/09-AOS720
   PubMed Web of Science ®Google Scholar
• S.L. Lauritzen, Graphical Models, Oxford Statistical Science Series, Oxford University Press, New York, 1996.
   Google Scholar
• C. Liu, Y. Shang, and P. Han, A new infeasible-interior-point algorithm for linear programming over symmetric cones, Acta Math. Appl. Sin. Engl. Ser. 33(3) (2017), pp. 771–788. doi: 10.1007/s10255-017-0697-7
   Web of Science ®Google Scholar
• S. Ma, D. Goldfarb, and L. Chen, Fixed point and Bregman iterative methods for matrix rank minimization, Math. Program. 128 (2011), pp. 321–353. doi: 10.1007/s10107-009-0306-5
   Web of Science ®Google Scholar
• N. Padmanabhan, M. White, H.H. Zhou, and R. O'Connell, Estimating sparse precision matrices, Mon. Not. R. Astron. Soc. 460(2) (2016), pp. 1567–1576. doi: 10.1093/mnras/stw1042
   Web of Science ®Google Scholar
• N. Parikh and S. Boyd, Proximal algorithms, Found. Trends Optim. 1(3) (2014), pp. 127–239. doi: 10.1561/2400000003
   Google Scholar
• A.J. Rothman, P.J. Bickel, E. Levina, and J. Zhu, Sparse permutation invariant covariance estimation, Electron. J. Stat. 2(3) (2008), pp. 494–515. doi: 10.1214/08-EJS176
   Web of Science ®Google Scholar
• K. Scheinberg, S. Ma, and D. Goldfarb, Sparse inverse covariance selection via alternating linearization methods, Twenty-Fourth Annual Conference on Neural Information Processing Systems (NIPS), Vancouver, British Columbia, Canada, December 6–9, 2010.
   Google Scholar
• D. Sun, K.C. Toh, and L. Yang, A convergent 3-block semi-proximal alternating direction method of multipliers for conic programming with 4-type of constraints, SIAM J. Optim. 25 (2015), pp. 882–915. doi: 10.1137/140964357
   Web of Science ®Google Scholar
• J. Tang, G. He, L. Dong, and L. Fang, A new one-step smoothing Newton method for second-order cone programming, Appl. Math. 57(4) (2012), pp. 311–331. doi: 10.1007/s10492-012-0019-6
   Web of Science ®Google Scholar
• J. Tang, G. He, L. Dong, L. Fang, and J. Zhou, A smoothing Newton method for the second-order cone complementarity problem, Appl. Math. 58(2) (2013), pp. 223–247. doi: 10.1007/s10492-013-0011-9
   Web of Science ®Google Scholar
• J. Tang, G. He, and L. Fang, A new non-interior continuation method for second-order cone programming, J. Numer. Math. 21(4) (2013), pp. 301–323. doi: 10.1515/jnum-2013-0012
   Web of Science ®Google Scholar
• H. Wang, A. Banerjee, C.J. Hsieh, et al., Large scale distributed sparse precision estimation, Adv. Neural. Inf. Process. Syst. (2013), pp. 584–592.
   Google Scholar
• Z. Wen, D. Goldfarb, and W. Yin, Alternating direction augmented lagrangian methods for semidefinite programming, Math. Program. Comput. 2 (2010), pp. 203–230. doi: 10.1007/s12532-010-0017-1
   Google Scholar
• J.F. Yang and Y. Zhang, Alternating direction algorithms for l1-problems in compressive sensing, SIAM J. Sci. Comput. 33(1) (2011), pp. 250–278. doi: 10.1137/090777761
   Web of Science ®Google Scholar
• J. Yu, M. Li, Y. Wang, and G. He, A decomposition method for large-scale box constrained optimization, Appl. Math. Comput. 231(12) (2014), pp. 9–15.
   Google Scholar
• X. Yuan, Alternating direction methods for sparse covariance selection, preprint (2009).
   Google Scholar
• M. Yuan, High dimensional inverse covariance matrix estimation via linear programming, J. Mach. Learn. Res. 11(12) (2010), pp. 2261–2286.
   Google Scholar
• M. Yuan and Y. Lin, Model selection and estimation in the gaussian graphical model, Biometrika 94(1) (2007), pp. 19–35. doi: 10.1093/biomet/asm018
   Web of Science ®Google Scholar
• R.Y. Zhang, F.F. Xu, and J.C. Huang, Reconstructing local volatility using total variation, Acta. Math. Sin. Engl. Ser. 33(2) (2017), pp. 263–277. doi: 10.1007/s10114-017-5178-7
   Web of Science ®Google Scholar