{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T08:36:36Z","timestamp":1771576596713,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,8,11]],"date-time":"2017-08-11T00:00:00Z","timestamp":1502409600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,8,11]],"date-time":"2017-08-11T00:00:00Z","timestamp":1502409600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11301505"],"award-info":[{"award-number":["11301505"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1522654"],"award-info":[{"award-number":["1522654"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10589-017-9932-7","type":"journal-article","created":{"date-parts":[[2017,8,11]],"date-time":"2017-08-11T14:18:37Z","timestamp":1502461117000},"page":"579-618","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Inexact proximal stochastic gradient method for convex composite optimization"],"prefix":"10.1007","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3492-9235","authenticated-orcid":false,"given":"Xiao","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuxiong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongchao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,11]]},"reference":[{"issue":"3","key":"9932_CR1","first-page":"383","volume":"4","author":"HH Bauschke","year":"2008","unstructured":"Bauschke, H.H., Combettes, P.L.: A dykstra-like algorithm for two monotone operators. Pac. J. Optim. 4(3), 383\u2013391 (2008)","journal-title":"Pac. J. Optim."},{"issue":"1","key":"9932_CR2","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."},{"key":"9932_CR3","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont, Massachusetts (1999)","edition":"2"},{"key":"9932_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10107-011-0472-0","volume":"129","author":"DP Bertsekas","year":"2011","unstructured":"Bertsekas, D.P.: Incremental proximal methods for large scale convex optimization. Math. Program. Ser. B 129, 163\u2013195 (2011)","journal-title":"Math. Program. Ser. B"},{"key":"9932_CR5","unstructured":"Bertsekas, D.P.: Incremental gradient, subgradient, and proximal methods for convex optimization: a survey. \n                    arXiv: 1507.01030v1\n                    \n                  , 3 July (2015)"},{"issue":"4","key":"9932_CR6","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai, J.-F., Cand\u00e8s, E.J., She, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"key":"9932_CR7","unstructured":"Cai, J.-F., Cand\u00e8s, E.J., She, Z.: Fast newton-type methods for total variation regularization. In: ICML (2011)"},{"key":"9932_CR8","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: Saga: a fast incremental gradient method with support for non-strongly convex composite objectives. In: NIPS, pp. 1646\u20131654 (2014)"},{"key":"9932_CR9","first-page":"2121","volume":"12","author":"J Duchi","year":"2015","unstructured":"Duchi, J., Hazan, E., Singe, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12, 2121\u20132159 (2015)","journal-title":"J. Mach. Learn. Res."},{"issue":"12","key":"9932_CR10","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1109\/TIP.2006.881969","volume":"54","author":"M Elad","year":"2006","unstructured":"Elad, M., Aharon, M.: Image denoising via sparse and redundant representations over learned dictionaries. IEEE Trans. Image Process. 54(12), 3736\u20133745 (2006)","journal-title":"IEEE Trans. Image Process."},{"issue":"3","key":"9932_CR11","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1109\/TIP.2010.2072512","volume":"20","author":"J Fadili","year":"2011","unstructured":"Fadili, J., Peyr\u00e8, G.: Total variation projection with first order schemes. IEEE Trans. Image Process. 20(3), 657\u2013669 (2011)","journal-title":"IEEE Trans. Image Process."},{"issue":"4","key":"9932_CR12","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1137\/110848864","volume":"22","author":"S Ghadimi","year":"2012","unstructured":"Ghadimi, S., Lan, G.: Optimal stochastic approximation algorithms 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":"9932_CR13","doi-asserted-by":"publisher","first-page":"2061","DOI":"10.1137\/110848876","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, II: shrinking procedures and optimal algorithms. SIAM J. Optim. 23(4), 2061\u20132089 (2013)","journal-title":"SIAM J. Optim."},{"key":"9932_CR14","unstructured":"Hovhannisyan, V., Parpas, P., Zafeiriou, S.: Magma: multi-level accelerated gradient mirror descent algorithm for large-scale convex composite minimization. \n                    arXiv: 1509.05715v3\n                    \n                  , July (2016)"},{"issue":"3","key":"9932_CR15","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1137\/110847081","volume":"22","author":"K Jang","year":"2012","unstructured":"Jang, K., Sun, D., Toh, K.C.: An inexact accelerated proximal gradient method for large scale linearly constrained convex sdp. SIAM J. Optim. 22(3), 1042\u20131064 (2012)","journal-title":"SIAM J. Optim."},{"key":"9932_CR16","unstructured":"Jenatton, R., Mairal, J., Bach, F.R., Obozinski, G.R.: Proximal methods for sparse hierarchical dictionary learning. In: ICML, pp. 487\u2013494 (2010)"},{"key":"9932_CR17","unstructured":"Johnson R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. In: NIPS, pp. 315\u2013323 (2013)"},{"key":"9932_CR18","doi-asserted-by":"crossref","unstructured":"Kavukcuoglu, K., Ranzato, M., Fergus, R., LeCun, Y.: Learning invariant features through topographic filter maps. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2009)","DOI":"10.1109\/CVPR.2009.5206545"},{"issue":"2","key":"9932_CR19","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/JSTSP.2015.2505682","volume":"10","author":"J Kone\u010dn\u00fd","year":"2016","unstructured":"Kone\u010dn\u00fd, J., Liu, J., Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Mini-batch semi-stochastic gradient descent in the proximal setting. IEEE J. Sel. Top. Signal Process. 10(2), 242\u2013255 (2016)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"issue":"1","key":"9932_CR20","doi-asserted-by":"publisher","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":"1","key":"9932_CR21","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"S Ma","year":"2011","unstructured":"Ma, S., Goldfarb, D., Chen, L.: Fixed point and bregman iterative methods for matrix rank minimization. Math. Program. 128(1), 321\u2013353 (2011)","journal-title":"Math. Program."},{"issue":"3","key":"9932_CR22","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1073\/pnas.0803205106","volume":"106","author":"MW Mahoney","year":"2009","unstructured":"Mahoney, M.W., Drineas, P.: CUR matrix decompositions for improved data analysis. Proc. Natl. Acad. Sci. 106(3), 697 (2009)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"9932_CR23","first-page":"2681","volume":"12","author":"J Mairal","year":"2011","unstructured":"Mairal, J., Jenatton, R., Obozinski, G., Bach, F.: Convex and network flow optimization for structured sparsity. J. Mach. Learn. Res. 12, 2681\u20132720 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"9932_CR24","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"YE Nesterov","year":"2013","unstructured":"Nesterov, Y.E.: Gradient methods for minimizing composite objective function. Math. Program. Ser. B 140, 341\u2013362 (2013)","journal-title":"Math. Program. Ser. B"},{"key":"9932_CR25","unstructured":"Nitanda, A.: Stochastic proximal gradient descent with acceleration techniques. In: NIPS, pp. 1574\u20131582 (2014)"},{"issue":"2","key":"9932_CR26","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s11222-008-9111-x","volume":"20","author":"G Obozinski","year":"2009","unstructured":"Obozinski, G., Taskar, B., Jordan, M.I.: Joint covariate selection and joint subspace selection for multiple classification problems. Stat. Comput. 20(2), 231\u2013252 (2009)","journal-title":"Stat. Comput."},{"issue":"19","key":"9932_CR27","first-page":"1167","volume":"4","author":"S Salzo","year":"2012","unstructured":"Salzo, S., Villa, S.: Inexact and accelerated proximal point algorithms. J. Convex Anal. 4(19), 1167\u20131192 (2012)","journal-title":"J. Convex Anal."},{"key":"9932_CR28","doi-asserted-by":"publisher","unstructured":"Scheinberg, K., Tang, X.: Practical inexact proximal quasi-Newton method with global complexity analysis. Math. Program. (2016). doi:\n                    10.1007\/s10107-016-0997-3","DOI":"10.1007\/s10107-016-0997-3"},{"key":"9932_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1030-6","author":"M Schmidt","year":"2016","unstructured":"Schmidt, M., Le Roux, N., Bach, F.: Minimizing finite sums with the stochastic average gradient. Math. Program. (2016). doi:\n                    10.1007\/s10107-016-1030-6","journal-title":"Math. Program."},{"key":"9932_CR30","unstructured":"Schmidt, M., Le Roux, N., Bach, F.: Supplementary material for the paper convergence rates of inexact proximal-gradient methods for convex optimization. In: NIPS (2011)"},{"key":"9932_CR31","first-page":"567","volume":"14","author":"S Shalev-Shwartz","year":"2013","unstructured":"Shalev-Shwartz, S., Zhang, T.: Stochastic dual coordinate ascent methods for regularized loss minimization. J. Mach. Learn. Res. 14, 567\u2013599 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"9932_CR32","unstructured":"Tibshirani, R., Hastie, T., Friedman, J.: The elements of statistical learning: data mining, 2nd edn. In: Inference. Springer, New York (2009)"},{"issue":"3","key":"9932_CR33","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1137\/110844805","volume":"23","author":"S Villa","year":"2011","unstructured":"Villa, S., Salzo, S., Baldassarre, L., Verri, A.: Accelerated and inexact forward\u2013backward algorithms. SIAM J. Optim. 23(3), 1607\u20131633 (2011)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9932_CR34","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-014-0769-x","volume":"150","author":"M Wang","year":"2015","unstructured":"Wang, M., Bertsekas, D.P.: Incremental constraint projection methods for variational inequalities. Math. Program. 150(2), 321\u2013363 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"9932_CR35","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1137\/130931278","volume":"26","author":"M Wang","year":"2016","unstructured":"Wang, M., Bertsekas, D.P.: Stochastic first-order methods with random constraint projection. SIAM J. Optim. 26(1), 681\u2013717 (2016)","journal-title":"SIAM J. Optim."},{"key":"9932_CR36","doi-asserted-by":"publisher","first-page":"2057","DOI":"10.1137\/140961791","volume":"24","author":"L Xiao","year":"2014","unstructured":"Xiao, L., Zhang, T.: A proximal stochastic gradient method with progressive variance reduction. SIAM J. Optim. 24, 2057\u20132075 (2014)","journal-title":"SIAM J. Optim."},{"key":"9932_CR37","doi-asserted-by":"publisher","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"},{"key":"9932_CR38","doi-asserted-by":"publisher","DOI":"10.1142\/5021","volume-title":"Convex Analysis in General Vector Spaces","author":"C Z\u0103linescu","year":"2002","unstructured":"Z\u0103linescu, C.: Convex Analysis in General Vector Spaces. World Scientific Publishing Co. Inc., Singapore (2002)"},{"key":"9932_CR39","unstructured":"Zhang, Y., Lin, X.: Stochastic primal-dual coordinate method for regularized empirical risk minimization. In: ICML (2015)"},{"key":"9932_CR40","unstructured":"Zhu, Z.A., Yuan, Y.: Univr: A universal variance reduction framework for proximal stochastic gradient method. \n                    arXiv: 1506.01972v1\n                    \n                  , 5 June (2015)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-017-9932-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9932-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9932-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T10:56:53Z","timestamp":1589713013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-017-9932-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,11]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["9932"],"URL":"https:\/\/doi.org\/10.1007\/s10589-017-9932-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,11]]},"assertion":[{"value":"9 September 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2017","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}