{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:19:50Z","timestamp":1757452790340,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T00:00:00Z","timestamp":1480464000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T00:00:00Z","timestamp":1480464000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1128817","1509789"],"award-info":[{"award-number":["1128817","1509789"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s00186-016-0566-9","type":"journal-article","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T17:16:50Z","timestamp":1480526210000},"page":"19-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Inexact proximal Newton methods for self-concordant functions"],"prefix":"10.1007","volume":"85","author":[{"given":"Jinchao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin S.","family":"Andersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lieven","family":"Vandenberghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,30]]},"reference":[{"key":"566_CR1","unstructured":"Andersen MS, Vandenberghe, L (2015) CHOMPACK: a python package for chordal matrix computations, Version 2.2.1. cvxopt.github.io\/chompack"},{"issue":"3","key":"566_CR2","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1080\/10556788.2012.684353","volume":"28","author":"MS Andersen","year":"2013","unstructured":"Andersen MS, Dahl J, Vandenberghe L (2013) Logarithmic barriers for sparse matrix cones. Optim Methods Softw 28(3):396\u2013423","journal-title":"Optim Methods Softw"},{"key":"566_CR3","unstructured":"Andersen M, Dahl J, Vandenberghe L (2015) CVXOPT: a python package for convex optimization. www.cvxopt.org"},{"issue":"3","key":"566_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12532-011-0029-5","volume":"3","author":"SR Becker","year":"2011","unstructured":"Becker SR, Cand\u00e8s EJ, Grant MC (2011) Templates for convex cone problems with applications to sparse signal recovery. Math Program Comput 3(3):165\u2013218","journal-title":"Math Program Comput"},{"issue":"1","key":"566_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imaging Sci 2(1):183\u2013202","journal-title":"SIAM J Imaging Sci"},{"key":"566_CR6","volume-title":"Convex optimization theory","author":"DP Bertsekas","year":"2009","unstructured":"Bertsekas DP (2009) Convex optimization theory. Athena Scientific, Belmont"},{"key":"566_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge"},{"key":"566_CR8","doi-asserted-by":"crossref","unstructured":"Byrd RH, Nocedal J, Oztoprak F (2016) An inexact successive quadratic approximation method for L-1 regularized optimization. Math Program 157(2):375\u2013396","DOI":"10.1007\/s10107-015-0941-y"},{"key":"566_CR9","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis TA, Hu Y (2011) The University of Florida sparse matrix collection. ACM Trans Math Softw 38:1\u201325","journal-title":"ACM Trans Math Softw"},{"issue":"2","key":"566_CR10","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/0719025","volume":"19","author":"RS Dembo","year":"1982","unstructured":"Dembo RS, Eisenstat SC, Steihaug T (1982) Inexact Newton methods. SIAM J Numer Anal 19(2):400\u2013408","journal-title":"SIAM J Numer Anal"},{"key":"566_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.2307\/2528966","volume":"28","author":"AP Dempster","year":"1972","unstructured":"Dempster AP (1972) Covariance selection. Biometrics 28:157\u2013175","journal-title":"Biometrics"},{"issue":"1","key":"566_CR12","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1137\/0917003","volume":"17","author":"SC Eisenstat","year":"1996","unstructured":"Eisenstat SC, Walker HF (1996) Choosing the forcing terms in an inexact Newton method. SIAM J Sci Comput 17(1):16\u201332","journal-title":"SIAM J Sci Comput"},{"key":"566_CR13","doi-asserted-by":"crossref","DOI":"10.1201\/b18401","volume-title":"Statistical learning with sparsity. The lasso and generalizations","author":"T Hastie","year":"2015","unstructured":"Hastie T, Tibshirani R, Wainwright M (2015) Statistical learning with sparsity. The lasso and generalizations. CRC Press, Boca Raton"},{"key":"566_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex analysis and minimization algorithms I, volume 305 of Grundlehren der mathematischen Wissenschaften","author":"J-B Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty J-B, Lemar\u00e9chal C (1993) Convex analysis and minimization algorithms I, volume 305 of Grundlehren der mathematischen Wissenschaften. Springer, New York"},{"key":"566_CR15","first-page":"2330","volume":"24","author":"C-J Hsieh","year":"2011","unstructured":"Hsieh C-J, Sustik MA, Dhillon IS, Ravikumar P (2011) Sparse inverse covariance matrix estimation using quadratic approximation. Adv Neural Inf Process (NIPS) 24:2330\u20132338","journal-title":"Adv Neural Inf Process (NIPS)"},{"key":"566_CR16","doi-asserted-by":"crossref","unstructured":"Kyrillidis A, Karimi-Mahabadi R, Tran-Dinh Q, Cevher V (2014) Scalable sparse covariance estimation via self-concordance. In: Proceedings of the 28th AAAI conference on artificial intelligence, pp 1946\u20131952","DOI":"10.1609\/aaai.v28i1.8960"},{"issue":"3","key":"566_CR17","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1137\/130921428","volume":"24","author":"JD Lee","year":"2014","unstructured":"Lee JD, Sun Y, Saunders MA (2014) Proximal Newton-type methods for minimizing composite functions. SIAM J Optim 24(3):1420\u20131443","journal-title":"SIAM J Optim"},{"key":"566_CR18","doi-asserted-by":"publisher","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"JJ Moreau","year":"1965","unstructured":"Moreau JJ (1965) Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bull Math Soc Fr 93:273\u2013299","journal-title":"Bull Math Soc Fr"},{"key":"566_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory lectures on convex optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov Y (2004) Introductory lectures on convex optimization. Kluwer Academic Publishers, Dordrecht"},{"issue":"4\u20135","key":"566_CR20","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1080\/10556788.2011.567270","volume":"27","author":"Y Nesterov","year":"2012","unstructured":"Nesterov Y (2012) Towards non-symmetric conic optimization. Optim Methods Softw 27(4\u20135):893\u2013917","journal-title":"Optim Methods Softw"},{"key":"566_CR21","volume-title":"Interior-point polynomial methods in convex programming, volume 13 of studies in applied mathematics","author":"Y Nesterov","year":"1994","unstructured":"Nesterov Y, Nemirovskii A (1994) Interior-point polynomial methods in convex programming, volume 13 of studies in applied mathematics. SIAM, Philadelphia"},{"key":"566_CR22","first-page":"764","volume":"25","author":"PA Olsen","year":"2012","unstructured":"Olsen PA, Oztoprak F, Nocedal J, Rennie SJ (2012) Newton-like methods for sparse inverse covariance estimation. Adv Neural Inf Process (NIPS) 25:764\u2013772","journal-title":"Adv Neural Inf Process (NIPS)"},{"key":"566_CR23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718812","volume-title":"A mathematical view of interior-point methods in convex optimization","author":"J Renegar","year":"2001","unstructured":"Renegar J (2001) A mathematical view of interior-point methods in convex optimization. SIAM, Philadelphia"},{"key":"566_CR24","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10208-014-9189-9","volume":"14","author":"K Scheinberg","year":"2014","unstructured":"Scheinberg K, Goldfarb D, Bai X (2014) Fast first-order methods for composite convex optimization with backtracking. Found Comput Math 14:389\u2013417","journal-title":"Found Comput Math"},{"key":"566_CR25","first-page":"455","volume-title":"Optimization for machine learning","author":"K Scheinberg","year":"2012","unstructured":"Scheinberg K, Ma S (2012) Optimization methods for sparse inverse covariance selection. In: Sra S, Nowozin S, Wright SJ (eds) Optimization for machine learning. MIT Press, Cambridge, pp 455\u2013477"},{"key":"566_CR26","unstructured":"Scheinberg K, Tang X (2013) Complexity of inexact proximal Newton methods. Technical Report 13T-02-R1, COR@L. Lehigh University, 2013"},{"issue":"4","key":"566_CR27","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1137\/130944539","volume":"24","author":"Q Tran-Dinh","year":"2014","unstructured":"Tran-Dinh Q, Kyrillidis A, Cevher V (2014) An inexact proximal path-following algorithm for constrained convex optimization. SIAM J Optim 24(4):1718\u20131745","journal-title":"SIAM J Optim"},{"key":"566_CR28","first-page":"371","volume":"16","author":"Q Tran-Dinh","year":"2015","unstructured":"Tran-Dinh Q, Kyrillidis A, Cevher V (2015) Composite self-concordant minimization. J Mach Learn Res 16:371\u2013416","journal-title":"J Mach Learn Res"},{"issue":"4","key":"566_CR29","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1561\/2400000006","volume":"1","author":"L Vandenberghe","year":"2014","unstructured":"Vandenberghe L, Andersen MS (2014) Chordal graphs and semidefinite optimization. Found Trends Optim 1(4):241\u2013433","journal-title":"Found Trends Optim"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-016-0566-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-016-0566-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-016-0566-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T18:29:43Z","timestamp":1657909783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-016-0566-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,30]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["566"],"URL":"https:\/\/doi.org\/10.1007\/s00186-016-0566-9","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2016,11,30]]},"assertion":[{"value":"2 November 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}