{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:52:28Z","timestamp":1760385148128},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,6,11]],"date-time":"2011-06-11T00:00:00Z","timestamp":1307750400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s10107-011-0471-1","type":"journal-article","created":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T09:08:06Z","timestamp":1307696886000},"page":"331-355","source":"Crossref","is-referenced-by-count":17,"title":["A block coordinate gradient descent method for regularized convex separable optimization and covariance selection"],"prefix":"10.1007","volume":"129","author":[{"given":"Sangwoon","family":"Yun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Tseng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim-Chuan","family":"Toh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,11]]},"reference":[{"key":"471_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-9859-3","volume-title":"Convex Analysis and Nonlinear Optimization: Theory and Examples","author":"J.M. Borwein","year":"2000","unstructured":"Borwein J.M., Lewis A.S.: Convex Analysis and Nonlinear Optimization: Theory and Examples. Springer, New York (2000)"},{"key":"471_CR2","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1080\/10556780802102693","volume":"23","author":"J. Dahl","year":"2008","unstructured":"Dahl J., Vandenberghe L., Roychowdhury V.: Covariance selection for non-chordal graphs via chordal embedding. Optim. Methods Softw. 23, 501\u2013520 (2008)","journal-title":"Optim. Methods Softw."},{"key":"471_CR3","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/060670985","volume":"30","author":"A. D\u2019Aspremont","year":"2008","unstructured":"D\u2019Aspremont A., Banerjee O., El Ghaoui L.: First-order methods for sparse covariance selection. SIAM J. Matrix Anal. Appl. 30, 56\u201366 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"471_CR4","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1093\/biostatistics\/kxm045","volume":"9","author":"J. Friedman","year":"2008","unstructured":"Friedman J., Hastie T., Tibshirani R.: Sparse inverse covariance estimation with the graphical lasso. Biostatistics 9, 432\u2013441 (2008)","journal-title":"Biostatistics"},{"key":"471_CR5","first-page":"263","volume":"15","author":"R. Goebel","year":"2008","unstructured":"Goebel R., Rockafellar R.T.: Local strong convexity and local Lipschitz continuity of the gradients of convex functions. J. Convex Anal. 15, 263\u2013270 (2008)","journal-title":"J. Convex Anal."},{"key":"471_CR6","volume-title":"Matrix Analysis","author":"R. Horn","year":"1999","unstructured":"Horn R., Johnson C.: Matrix Analysis. Cambridge University Press, Cambridge (1999)"},{"key":"471_CR7","doi-asserted-by":"crossref","first-page":"1807","DOI":"10.1137\/070695915","volume":"19","author":"Z. Lu","year":"2009","unstructured":"Lu Z.: Smooth optimization approach for covariance selection. SIAM J. Optim. 19, 1807\u20131827 (2009)","journal-title":"SIAM J. Optim."},{"key":"471_CR8","doi-asserted-by":"crossref","first-page":"2000","DOI":"10.1137\/080742531","volume":"31","author":"Z. Lu","year":"2010","unstructured":"Lu Z.: Adaptive first-order methods for general sparse inverse covariance selection. SIAM J. Matrix Anal. Appl. 31, 2000\u20132016 (2010)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"471_CR9","first-page":"372","volume":"27","author":"Y. Nesterov","year":"1983","unstructured":"Nesterov Y.: A method of solving a convex programming problem with convergence rate O(1\/k 2). Sov. Math. Doklady 27, 372\u2013376 (1983)","journal-title":"Sov. Math. Doklady"},{"key":"471_CR10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y. Nesterov","year":"2005","unstructured":"Nesterov Y.: Smooth minimization of nonsmooth functions. Math. Prog. 103, 127\u2013152 (2005)","journal-title":"Math. Prog."},{"key":"471_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J. Nocedal","year":"1999","unstructured":"Nocedal J., Wright S.J.: Numerical Optimization. Springer, New York (1999)"},{"key":"471_CR12","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"471_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"R.T. Rockafellar","year":"1998","unstructured":"Rockafellar R.T., Wets R.J.-B.: Variational Analysis. Springer, New York (1998)"},{"key":"471_CR14","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y. Saad","year":"1996","unstructured":"Saad Y.: Iterative Methods for Sparse Linear Systems. PWS Publishing Company, Boston (1996)"},{"key":"471_CR15","doi-asserted-by":"crossref","unstructured":"Scheinberg, K., Rish, I.: Learning sparse Gaussian markov networks using a greedy coordinate ascent approach. In: Machine Learning and Knowledge Discovery in Databases. Lecture Notes in Computer Science, vol. 6323, pp. 196\u2013212 (2010)","DOI":"10.1007\/978-3-642-15939-8_13"},{"key":"471_CR16","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P. Tseng","year":"2001","unstructured":"Tseng P.: Convergence of block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 109, 473\u2013492 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"471_CR17","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P. Tseng","year":"2009","unstructured":"Tseng P., Yun S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Prog. Ser. B 117, 387\u2013423 (2009)","journal-title":"Math. Prog. Ser. B"},{"key":"471_CR18","doi-asserted-by":"crossref","first-page":"2994","DOI":"10.1137\/090772514","volume":"20","author":"C. Wang","year":"2010","unstructured":"Wang C., Sun D., Toh K.-C.: Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm. SIAM J. Optim. 20, 2994\u20133013 (2010)","journal-title":"SIAM J. Optim."},{"key":"471_CR19","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1093\/biomet\/90.4.809","volume":"90","author":"F. Wong","year":"2003","unstructured":"Wong F., Carter C.K., Kohn R.: Efficient estimation of covariance selection models. Biometrika 90, 809\u2013830 (2003)","journal-title":"Biometrika"},{"key":"471_CR20","unstructured":"Yuan, X.: Alternating direction methods for sparse covariance selection. http:\/\/www.optimization-online.org\/DB_FILE\/2009\/09\/2390.pdf"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0471-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-011-0471-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0471-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T16:04:44Z","timestamp":1560269084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-011-0471-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,11]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["471"],"URL":"https:\/\/doi.org\/10.1007\/s10107-011-0471-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,11]]}}}