{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T09:28:30Z","timestamp":1780478910488,"version":"3.54.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,1,9]],"date-time":"2014-01-09T00:00:00Z","timestamp":1389225600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10589-013-9633-9","type":"journal-article","created":{"date-parts":[[2014,1,8]],"date-time":"2014-01-08T17:53:03Z","timestamp":1389203583000},"page":"455-482","source":"Crossref","is-referenced-by-count":11,"title":["A sparsity preserving stochastic gradient methods for sparse regression"],"prefix":"10.1007","volume":"58","author":[{"given":"Qihang","family":"Lin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Javier","family":"Pe\u00f1a","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,1,9]]},"reference":[{"issue":"1","key":"9633_CR1","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-threshold algorithm for linear inverse problems. SIAM J. Image Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Image Sci."},{"key":"9633_CR2","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1214\/aoms\/1177728716","volume":"25","author":"K.L. Chung","year":"1954","unstructured":"Chung, K.L.: On a stochastic approximation method. Ann. Math. Stat. 25, 463\u2013483 (1954)","journal-title":"Ann. Math. Stat."},{"key":"9633_CR3","volume-title":"Advances in Neural Information Processing Systems (NIPS)","author":"A. Cotter","year":"2011","unstructured":"Cotter, A., Shamir, O., Srebro, N., Sridharan, K.: Better mini-batch algorithms via accelerated gradient methods. In: Advances in Neural Information Processing Systems (NIPS) (2011)"},{"key":"9633_CR4","first-page":"165","volume":"13","author":"O. Dekel","year":"2012","unstructured":"Dekel, O., Gilad-Bachrach, R., Shamir, O., Xiao, L.: Optimal distributed online prediction using mini-batches. J. Mach. Learn. Res. 13, 165\u2013202 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"9633_CR5","first-page":"2873","volume":"10","author":"J. Duchi","year":"2009","unstructured":"Duchi, J., Singer, Y.: Efficient online and batch learning using forward-backward splitting. J. Mach. Learn. Res. 10, 2873\u20132898 (2009)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"9633_CR6","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1137\/110831659","volume":"22","author":"J.C. Duchi","year":"2012","unstructured":"Duchi, J.C., Bartlett, P.L., Wainwright, M.J.: Randomized smoothing for stochastic optimization. SIAM J. Optim. 22(2), 674\u2013701 (2012)","journal-title":"SIAM J. Optim."},{"key":"9633_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/17442508308833246","volume":"9","author":"Y. Ermoliev","year":"1983","unstructured":"Ermoliev, Y.: Stochastic quasigradient methods and their application to system optimization. Stochastics 9, 1\u201336 (1983)","journal-title":"Stochastics"},{"key":"9633_CR8","first-page":"89","volume":"4","author":"A.A. Gaivoronski","year":"1978","unstructured":"Gaivoronski, A.A.: Nonstationary stochastic programming problems. Kybernetika 4, 89\u201392 (1978)","journal-title":"Kybernetika"},{"key":"9633_CR9","volume-title":"Advances in Neural Information Processing Systems (NIPS)","author":"C. Hu","year":"2009","unstructured":"Hu, C., Kwok, J.T., Pan, W.: Accelerated gradient methods for stochastic optimization and online learning. In: Advances in Neural Information Processing Systems (NIPS) (2009)"},{"key":"9633_CR10","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1214\/aoms\/1177729392","volume":"23","author":"J. Kiefer","year":"1952","unstructured":"Kiefer, J., Wolfowitz, J.: Stochastic estimation of the maximum of a regression function. Ann. Math. Stat. 23, 462\u2013466 (1952)","journal-title":"Ann. Math. Stat."},{"key":"9633_CR11","volume-title":"Stochastic Approximation Algorithms and Applications","author":"H.J. Kushner","year":"2003","unstructured":"Kushner, H.J., Yin, G.G.: Stochastic Approximation Algorithms and Applications. Springer, New York (2003)"},{"issue":"1","key":"9633_CR12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-010-0434-y","volume":"133","author":"G. Lan","year":"2012","unstructured":"Lan, G.: An optimal method for stochastic composite optimization. Math. Program. 133(1), 365\u2013397 (2012)","journal-title":"Math. Program."},{"issue":"4","key":"9633_CR13","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1137\/110848864","volume":"22","author":"G. Lan","year":"2012","unstructured":"Lan, G., Ghadimi, S.: Optimal stochastic approximation algorithm for strongly convex stochastic composite optimization, I: a generic algorithmic framework. SIAM J. Optim. 22(4), 1469\u20131492 (2012)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9633_CR14","doi-asserted-by":"crossref","first-page":"2061","DOI":"10.1137\/110848876","volume":"23","author":"G. Lan","year":"2013","unstructured":"Lan, G., Ghadimi, S.: Optimal stochastic approximation algorithm for strongly convex stochastic composite optimization, II: shrinking procedures and optimal algorithms. SIAM J. Optim. 23(4), 2061\u20132069 (2013)","journal-title":"SIAM J. Optim."},{"key":"9633_CR15","first-page":"2873","volume":"10","author":"J. Langford","year":"2009","unstructured":"Langford, J., Li, L., Zhang, T.: Sparse online learning via truncated gradient. J. Mach. Learn. Res. 10, 2873\u20132908 (2009)","journal-title":"J. Mach. Learn. Res."},{"key":"9633_CR16","first-page":"1705","volume":"13","author":"S. Lee","year":"2012","unstructured":"Lee, S., Wright, S.J.: Manifold identification in dual averaging methods for regularized stochastic online learning. J. Mach. Learn. Res. 13, 1705\u20131744 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"9633_CR17","volume-title":"The Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (UAI)","author":"J. Liu","year":"2009","unstructured":"Liu, J., Ji, S., Ye, J.: Multi-task feature learning via efficient \u2113 1\/\u2113 2 norm minimization. In: The Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (UAI) (2009)"},{"issue":"4","key":"9633_CR18","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A. Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"9633_CR19","unstructured":"Nemirovski, A., Yudin, D.: On Cezari\u2019s convergence of the steepest descent method for approximating saddle point of convex-concave functions. Soviet Mathematics Doklady 19 (1978)"},{"key":"9633_CR20","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A. Nemirovski","year":"1983","unstructured":"Nemirovski, A., Yudin, D.: Problem Complexity and Method Efficiency in Optimization. Wiley, New York (1983)"},{"key":"9633_CR21","unstructured":"Nesterov, Y.E.: Gradient methods for minimizing composite objective function. Technical report, CORE (2007)"},{"key":"9633_CR22","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y. Nesterov","year":"2003","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer, Amsterdam (2003)"},{"issue":"1","key":"9633_CR23","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 non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"9633_CR24","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y. Nesterov","year":"2009","unstructured":"Nesterov, Y.: Primal-dual subgradient methods for convex problems. Math. Program. 120, 221\u2013259 (2009)","journal-title":"Math. Program."},{"key":"9633_CR25","volume-title":"Optimization of Stochastic Models, the Interface Between Simulation and Optimization","author":"G.C. Pflug","year":"1996","unstructured":"Pflug, G.C.: Optimization of Stochastic Models, the Interface Between Simulation and Optimization. Kluwer, Boston (1996)"},{"key":"9633_CR26","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/0330046","volume":"30","author":"B.T. Polyak","year":"1992","unstructured":"Polyak, B.T., Juditsky, A.B.: Acceleration of stochastic approximation by averaging. SIAM J. Control Optim. 30, 838\u2013855 (1992)","journal-title":"SIAM J. Control Optim."},{"key":"9633_CR27","first-page":"98","volume":"7","author":"B.T. Polyak","year":"1990","unstructured":"Polyak, B.T.: New stochastic approximation type procedures. Automat. Telemekh. 7, 98\u2013107 (1990)","journal-title":"Automat. Telemekh."},{"issue":"6","key":"9633_CR28","doi-asserted-by":"crossref","first-page":"3465","DOI":"10.1137\/090763184","volume":"20","author":"T.K. Pong","year":"2010","unstructured":"Pong, T.K., Tseng, P., Ji, S., Ye, J.: Trace norm regularization: reformulations, algorithms, and multi-task learning. SIAM J. Optim. 20(6), 3465\u20133489 (2010)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9633_CR29","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H. Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 22(3), 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"key":"9633_CR30","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BFb0121128","volume":"28","author":"A. Ruszczynski","year":"1986","unstructured":"Ruszczynski, A., Syski, W.: A method of aggregate stochastic subgradients with on-line stepsize rules for convex stochastic programming problems. Math. Program. Stud. 28, 113\u2013131 (1986)","journal-title":"Math. Program. Stud."},{"key":"9633_CR31","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1214\/aoms\/1177706619","volume":"29","author":"J. Sacks","year":"1958","unstructured":"Sacks, J.: Asymptotic distribution of stochastic approximation. Ann. Math. Stat. 29, 373\u2013409 (1958)","journal-title":"Ann. Math. Stat."},{"key":"9633_CR32","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. B 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. B"},{"key":"9633_CR33","first-page":"615","volume":"6","author":"K.-C. Toh","year":"2010","unstructured":"Toh, K.-C., Yun, S.: An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Pac. J. Optim. 6, 615\u2013640 (2010)","journal-title":"Pac. J. Optim."},{"key":"9633_CR34","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization. Technical report, University of Washington (2008)"},{"key":"9633_CR35","first-page":"2543","volume":"11","author":"L. Xiao","year":"2010","unstructured":"Xiao, L.: Dual averaging methods for regularized stochastic learning and online optimization. J. Mach. Learn. Res. 11, 2543\u20132596 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"9633_CR36","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M. Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. B 68, 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. B"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9633-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-013-9633-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9633-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T18:26:00Z","timestamp":1716402360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-013-9633-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,9]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["9633"],"URL":"https:\/\/doi.org\/10.1007\/s10589-013-9633-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,9]]}}}