{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T22:13:43Z","timestamp":1773267223441,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,9,18]],"date-time":"2018-09-18T00:00:00Z","timestamp":1537228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["Discovery Grant, 2015-06068"],"award-info":[{"award-number":["Discovery Grant, 2015-06068"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["Discovery Grant, 355571-2013"],"award-info":[{"award-number":["Discovery Grant, 355571-2013"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s11590-018-1325-z","type":"journal-article","created":{"date-parts":[[2018,9,18]],"date-time":"2018-09-18T12:26:36Z","timestamp":1537273596000},"page":"645-655","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["\u201cActive-set complexity\u201d of proximal gradient: How long does it take to find the sparsity pattern?"],"prefix":"10.1007","volume":"13","author":[{"given":"Julie","family":"Nutini","sequence":"first","affiliation":[]},{"given":"Mark","family":"Schmidt","sequence":"additional","affiliation":[]},{"given":"Warren","family":"Hare","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,18]]},"reference":[{"issue":"1","key":"1325_CR1","doi-asserted-by":"publisher","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":"2","key":"1325_CR2","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/TAC.1976.1101194","volume":"21","author":"DP Bertsekas","year":"1976","unstructured":"Bertsekas, D.P.: On the Goldstein\u2013Levitin\u2013Polyak gradient projection method. IEEE Trans. Autom. Control 21(2), 174\u2013184 (1976)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1325_CR3","volume-title":"Convex Optimization Algorithms","author":"DP Bertsekas","year":"2015","unstructured":"Bertsekas, D.P.: Convex Optimization Algorithms. Athena Scientific, Belmont (2015)"},{"key":"1325_CR4","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"2016","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 3rd edn. Athena Scientific, Belmont (2016)","edition":"3"},{"key":"1325_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"3","key":"1325_CR6","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1137\/140978971","volume":"26","author":"C Buchheim","year":"2016","unstructured":"Buchheim, C., De Santis, M., Lucidi, S., Rinaldi, F., Trieu, L.: A feasible active set method with reoptimization for convex quadratic mixed-integer programming. SIAM J. Optim. 26(3), 1695\u20131714 (2016)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"1325_CR7","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1137\/0725068","volume":"25","author":"JV Burke","year":"1988","unstructured":"Burke, J.V., Mor\u00e9, J.J.: On the identification of active constraints. SIAM J. Numer. Anal. 25(5), 1197\u20131211 (1988)","journal-title":"SIAM J. Numer. Anal."},{"key":"1325_CR8","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward\u2013backward splitting. Multiscale Model. Simul. 4, 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"key":"1325_CR9","first-page":"273","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Mach. Learn. 20, 273\u2013297 (1995)","journal-title":"Mach. Learn."},{"key":"1325_CR10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10589-014-9681-9","volume":"60","author":"FE Curtis","year":"2015","unstructured":"Curtis, F.E., Han, Z., Robinson, D.P.: A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization. Comput. Optim. Appl. 60, 311\u2013341 (2015)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1325_CR11","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1137\/141000737","volume":"26","author":"M Santis De","year":"2016","unstructured":"De Santis, M., Lucidi, S., Rinaldi, F.: A fast active set block coordinate descent algorithm for $$\\ell _1$$ \u2113 1 -regularized least squares. SIAM J. Optim. 26(1), 781\u2013809 (2016)","journal-title":"SIAM J. Optim."},{"key":"1325_CR12","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-1-4419-9569-8_13","volume-title":"Fixed-Point Algorithms for Inverse Problems in Science and Engineering","author":"WL Hare","year":"2011","unstructured":"Hare, W.L.: Identifying active manifolds in regularization problems. In: Bauschke, H.H., Burachik, R.S., Combettes, P.L., Elser, V., Luke, D.R., Wolkowicz, H. (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 261\u2013271. Springer, New York (2011)"},{"issue":"2","key":"1325_CR13","first-page":"251","volume":"11","author":"WL Hare","year":"2004","unstructured":"Hare, W.L., Lewis, A.S.: Identifying active constraints via partial smoothness and prox-regularity. J. Convex Anal. 11(2), 251\u2013266 (2004)","journal-title":"J. Convex Anal."},{"issue":"11","key":"1325_CR14","doi-asserted-by":"publisher","first-page":"2766","DOI":"10.1109\/TIP.2007.908079","volume":"16","author":"D Krishnan","year":"2007","unstructured":"Krishnan, D., Lin, P., Yip, A.M.: A primal-dual active-set method for non-negativity constrained total variation deblurring problems. IEEE Trans. Image Process. 16(11), 2766\u20132777 (2007)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"1325_CR15","first-page":"1705","volume":"13","author":"S Lee","year":"2012","unstructured":"Lee, S., Wright, S.J.: Manifold identification in dual averaging for regularized stochastic online learning. J. Mach. Learn. Res. 13(1), 1705\u20131744 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"1325_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"ES Levitin","year":"1966","unstructured":"Levitin, E.S., Polyak, B.T.: Constrained minimization methods. USSR Comput. Math. Math. Phys. 6, 1\u201350 (1966)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"1","key":"1325_CR17","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1137\/16M106340X","volume":"27","author":"J Liang","year":"2017","unstructured":"Liang, J., Fadili, J., Peyr\u00e9, G.: Activity identification and local linear convergence of forward\u2013backward-type methods. SIAM J. Optim. 27(1), 408\u2013437 (2017)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1325_CR18","first-page":"563","volume":"9","author":"R Mifflin","year":"2002","unstructured":"Mifflin, R., Sagastiz\u00e1bal, C.: Proximal points are on the fast track. J. Convex Anal. 9(2), 563\u2013579 (2002)","journal-title":"J. Convex Anal."},{"key":"1325_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, Dordrecht (2004)"},{"key":"1325_CR20","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. Ser. B 140, 125\u2013161 (2013)","journal-title":"Math. Program. Ser. B"},{"key":"1325_CR21","unstructured":"Nutini, J., Laradji, I., Schmidt, M.: Let\u2019s make block coordinate descent go fast: Faster greedy rules, message-passing, active-set complexity, and superlinear convergence. arXiv:1712.08859 (2017)"},{"key":"1325_CR22","unstructured":"Schmidt, M., Roux, N.L., Bach, F.R.: Convergence rates of inexact proximal-gradient methods for convex optimization. In: Proceedings of the 24th International Conference on Neural Information Processing Systems, pp. 1458\u20131466. Grenada, Spain (2011)"},{"issue":"6","key":"1325_CR23","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1080\/10556788.2015.1028062","volume":"30","author":"S Solntsev","year":"2015","unstructured":"Solntsev, S., Nocedal, J., Byrd, R.H.: An algorithm for quadratic $$\\ell _1$$ \u2113 1 -regularized optimization with flexible active-set strategy. Optim. Method Softw. 30(6), 1213\u20131237 (2015)","journal-title":"Optim. Method Softw."},{"issue":"1","key":"1325_CR24","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B"},{"issue":"4","key":"1325_CR25","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1137\/090747695","volume":"32","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Yin, W., Goldfarb, D., Zhang, Y.: A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation. SIAM J. Sci. Comput. 32(4), 1832\u20131857 (2010)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"1325_CR26","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1137\/0331048","volume":"31","author":"SJ Wright","year":"1993","unstructured":"Wright, S.J.: Identifiable surfaces in constrained optimization. SIAM J. Control Optim. 31(4), 1063\u20131079 (1993)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"1325_CR27","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1137\/100808563","volume":"22","author":"SJ Wright","year":"2012","unstructured":"Wright, S.J.: Accelerated block-coordinate relaxation for regularized optimization. SIAM J. Optim. 22(1), 159\u2013186 (2012)","journal-title":"SIAM J. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1325-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-018-1325-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1325-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T13:02:21Z","timestamp":1720616541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-018-1325-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,18]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["1325"],"URL":"https:\/\/doi.org\/10.1007\/s11590-018-1325-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,18]]},"assertion":[{"value":"17 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}