{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T02:51:37Z","timestamp":1775616697599,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T00:00:00Z","timestamp":1440547200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10107-015-0941-y","type":"journal-article","created":{"date-parts":[[2015,8,25]],"date-time":"2015-08-25T14:03:22Z","timestamp":1440511402000},"page":"375-396","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":53,"title":["An inexact successive quadratic approximation method for L-1 regularized optimization"],"prefix":"10.1007","volume":"157","author":[{"given":"Richard H.","family":"Byrd","sequence":"first","affiliation":[]},{"given":"Jorge","family":"Nocedal","sequence":"additional","affiliation":[]},{"given":"Figen","family":"Oztoprak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,26]]},"reference":[{"key":"941_CR1","doi-asserted-by":"crossref","unstructured":"Andrew, G., Gao, J.: Scalable training of $${L}_1$$ L 1 -regularized log-linear models. In: Proceedings of the 24th International Conference on Machine Learning. ACM, pp. 33\u201340. (2007)","DOI":"10.1145\/1273496.1273501"},{"key":"941_CR2","first-page":"485","volume":"9","author":"O Banerjee","year":"2008","unstructured":"Banerjee, O., El Ghaoui, L., d\u2019Aspremont, A.: Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data. J. Mach. Learn. Res. 9, 485\u2013516 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"941_CR3","doi-asserted-by":"crossref","unstructured":"Banerjee, O., El Ghaoui, L., d\u2019Aspremont, A., Natsoulis, G.: Convex optimization techniques for fitting sparse Gaussian graphical models. In: Proceedings of the 23rd International Conference on Machine learning. ACM, pp. 89\u201396 (2006)","DOI":"10.1145\/1143844.1143856"},{"issue":"1","key":"941_CR4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"941_CR5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s12532-011-0029-5","volume":"3","author":"SR Becker","year":"2011","unstructured":"Becker, S.R., Cand\u00e9s, E.J., Grant, M.C.: Templates for convex cone problems with applications to sparse signal recovery. Math. Program. Comput. 3(3), 165\u2013218 (2011)","journal-title":"Math. Program. Comput."},{"key":"941_CR6","unstructured":"Byrd, R.H., Chin, G.M., Nocedal, J., Oztoprak, F.: A family of second-order methods for convex L1 regularized optimization. Technical report, Optimization Center Report 2012\/2, Northwestern University (2012)"},{"issue":"1","key":"941_CR7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-012-0572-5","volume":"134","author":"RH Byrd","year":"2012","unstructured":"Byrd, R.H., Chin, G.M., Nocedal, J., Wu, Y.: Sample size selection in optimization methods for machine learning. Math. Program. 134(1), 127\u2013155 (2012)","journal-title":"Math. Program."},{"issue":"4","key":"941_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01582063","volume":"63","author":"RH Byrd","year":"1994","unstructured":"Byrd, R.H., Nocedal, J., Schnabel, R.: Representations of quasi-Newton matrices and their use in limited memory methods. Math. Program. 63(4), 129\u2013156 (1994)","journal-title":"Math. Program."},{"issue":"2","key":"941_CR9","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1137\/0719025","volume":"19","author":"RS Dembo","year":"1982","unstructured":"Dembo, R.S., Eisenstat, S.C., Steihaug, T.: Inexact-Newton methods. SIAM J. Numer. Anal. 19(2), 400\u2013408 (1982)","journal-title":"SIAM J. Numer. Anal."},{"key":"941_CR10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10107-013-0664-x","volume":"139","author":"AL Dontchev","year":"2013","unstructured":"Dontchev, A.L., Rockafellar, R.T.: Convergence of inexact Newton methods for generalized equations. Math. Program. 139, 115\u2013137 (2013)","journal-title":"Math. Program."},{"key":"941_CR11","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. 2. Springer, Berlin (2003)"},{"key":"941_CR12","first-page":"2330","volume":"24","author":"CJ Hsieh","year":"2011","unstructured":"Hsieh, C.J., Sustik, M.A., Ravikumar, P., Dhillon, I.S.: Sparse inverse covariance matrix estimation using quadratic approximation. Adv. Neural Inf. Process. Syst. 24, 2330\u20132338 (2011)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"941_CR13","unstructured":"Lee, J., Sun, Y., Saunders, M.: Proximal Newton-type methods for convex optimization. In: Advances in Neural Information Processing Systems, pp. 836\u2013844 (2012)"},{"issue":"3","key":"941_CR14","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s12532-010-0020-6","volume":"2","author":"L Li","year":"2010","unstructured":"Li, L., Toh, K.C.: An inexact interior point method for L1-regularized sparse covariance selection. Math. Program. Comput. 2(3), 291\u2013315 (2010)","journal-title":"Math. Program. Comput."},{"key":"941_CR15","unstructured":"Le Roux, N., Schmidt, M.W., Bach, F.: Convergence rates of inexact proximal-gradient methods for convex optimization. In: NIPS, pp. 1458\u20131466 (2011)"},{"issue":"1","key":"941_CR16","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/120892167","volume":"24","author":"A Milzarek","year":"2014","unstructured":"Milzarek, A., Ulbrich, M.: A semismooth Newton method with multi-dimensional filter globalization for L1-optimization. SIAM J. Optim. 24(1), 298\u2013333 (2014)","journal-title":"SIAM J. Optim."},{"key":"941_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"Jorge Nocedal","year":"1999","unstructured":"Nocedal, Jorge, Wright, Stephen: Numerical Optimization, 2nd edn. Springer, New York (1999)","edition":"2"},{"key":"941_CR18","unstructured":"Olsen, P., Oztoprak, F., Nocedal, J., Rennie, S.: Newton-like methods for sparse inverse covariance estimation. In: Bartlett, P., Pereira, F.C.N., Burges, C.J.C., Bottou, L., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 25, pp. 764\u2013772 (2012)"},{"key":"941_CR19","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"JM Ortega","year":"1970","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, London (1970)"},{"issue":"2","key":"941_CR20","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/S105262349427577X","volume":"8","author":"M Patriksson","year":"1998","unstructured":"Patriksson, M.: Cost approximation: a unified framework of descent algorithms for nonlinear programs. SIAM J. Optim. 8(2), 561\u2013582 (1998)","journal-title":"SIAM J. Optim."},{"key":"941_CR21","volume-title":"Nonlinear Programming and Variational Inequality Problems, a Unified Approach","author":"M Patriksson","year":"1998","unstructured":"Patriksson, M.: Nonlinear Programming and Variational Inequality Problems, a Unified Approach. Kluwer, Dordrecht (1998)"},{"issue":"1","key":"941_CR22","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1198\/tech.2006.s352","volume":"48","author":"JD Picka","year":"2006","unstructured":"Picka, J.D.: Gaussian Markov random fields: theory and applications. Technometrics 48(1), 146\u2013147 (2006)","journal-title":"Technometrics"},{"issue":"4","key":"941_CR23","first-page":"1167","volume":"19","author":"S Salzo","year":"2012","unstructured":"Salzo, S., Villa, S.: Inexact and accelerated proximal point algorithms. J. Convex Anal. 19(4), 1167\u20131192 (2012)","journal-title":"J. Convex Anal."},{"key":"941_CR24","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/8996.001.0001","volume-title":"Optimization for Machine Learning","author":"S Sra","year":"2011","unstructured":"Sra, S., Nowozin, S., Wright, S.J.: Optimization for Machine Learning. Mit Press, Cambridge (2011)"},{"key":"941_CR25","unstructured":"Tan, X., Scheinberg, K.: Complexity of Inexact Proximal Newton Method. Technical report, Dept. of ISE, Lehigh University (2013)"},{"key":"941_CR26","unstructured":"Tappenden, R., Richt\u00e1rik, P., Gondzio, J.: Inexact coordinate descent: complexity and preconditioning. arXiv preprint arXiv:1304.5530 (2013)"},{"issue":"1","key":"941_CR27","first-page":"3183","volume":"11","author":"G-X Yuan","year":"2010","unstructured":"Yuan, G.-X., Chang, K., Hsie, C., Lin, C.-J.: A comparison of optimization methods and software for large-scale l1-regularized linear classification. J. Mach. Learn. Res. 11(1), 3183\u20133234 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"941_CR28","first-page":"1999","volume":"13","author":"G-X Yuan","year":"2012","unstructured":"Yuan, G.-X., Ho, C.-H., Lin, C.-J.: An improved glmnet for l1-regularized logistic regression. J. Mach. Learn. Res. 13(1), 1999\u20132030 (2012)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0941-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0941-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0941-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T20:31:59Z","timestamp":1567110719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0941-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,26]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["941"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0941-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,26]]}}}