A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 2, 2013, Pages 930-938

  Dinh, Quoc Tran ^a   Kyrillidis, Anastasios ^a   Cevher, Volkan ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING SYSTEMS;

ALGORITHMIC FRAMEWORK; CHOLESKY DECOMPOSITION; COMPOSITE FUNCTIONS; CONVEX MINIMIZATION; DISTRIBUTED IMPLEMENTATION; LOCAL QUADRATIC CONVERGENCE; MATRIX INVERSIONS; SPECIFIC PROBLEMS;

ALGORITHMS;

EID: 84897505713     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Banerjee, O., El Ghaoui, L., and d'Aspremont, A. Model selection through sparse maximum likelihood estimation for multivariate gaussian or binary data. The Journal of Machine Learning Research, 9:485-516, 2008. (Pubitemid 351469014)
2. Beck, A. and Teboulle, M. A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems. SIAM J. Imaging Sciences, 2(1):183-202, 2009.
3. Bertsekas, D.P. and Tsitsiklis, J. N. Parallel and distributed computation: Numerical methods. Prentice Hall, 1989.
4. Boyd, S. and Vandenberghe, L. Convex Optimization. University Press, Cambridge, 2004.
5. Dempster, A. P. Covariance selection. Biometrics, 28:157-175, 1972.
6. Hsieh, C. J., Sustik, M.A., Dhillon, I.S., and Ravikumar, P. Sparse inverse covariance matrix estimation using quadratic approximation. Advances in Neutral Information Processing Systems (NIPS), 24:1-18, 2011.
7. Lee, J.D., Sun, Y., and Saunders, M.A. Proximal newton-type methods for convex optimization. Tech. Report., pp. 1-25, 2012.
8. Li, L. and Toh, K.C. An inexact interior point method for 11-regularized sparse covariance selection. Mathematical Programming Computation, 2(3):291-315, 2010.
9. Lu, Z. Adaptive first-order methods for general sparse inverse covariance selection. SIAM Journal on Matrix Analysis and Applications, 31(4):2000-2016, 2010.
10. Nesterov, Y. Introductory lectures on convex optimization: a basic course, volume 87 of Applied Optimization. Kluwer Academic Publishers, 2004.
11. Nesterov, Y. Gradient methods for minimizing composite objective function. CORE Discussion paper, 76, 2007.
12. Nesterov, Y. and Nemirovski, A. Interior-point Polynomial Algorithms in Convex Programming. Society for Industrial Mathematics, 1994.
13. Olsen, P.A., Oztoprak, F., Nocedal, J, and Rennie, S.J. Newton-like methods for sparse inverse covariance estimation. Optimization Online, 2012.
14. Ravikumar, P., Wainwright, M. J., Raskutti, G., and Yu, B. High-dimensional covariance estimation by minimizing 11-penalized log-determinant divergence. Electron. J. Statist., 5:935-988, 2011.
15. Rolfs, B., Rajaratnam, B., Guillot, D., Wong, I., and Maleki, A. Iterative thresholding algorithm for sparse inverse covariance estimation. In Advances in Neural Information Processing Systems 25, pp. 1583-1591, 2012.
16. Scheinberg, K. and Rish, I. Sinco-a greedy coordinate ascent method for sparse inverse covariance selection problem. preprint, 2009.
17. Scheinberg, K., Ma, S., and Goldfarb, D. Sparse inverse covariance selection via alternating linearization methods. arXiv preprint arXiv.1011.0097, 2010.
18. Yuan, X. Alternating direction method for covariance selection models. Journal of Scientific Computing, 51(2):261-273, 2012.