{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T10:53:07Z","timestamp":1775040787874,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,10,22]],"date-time":"2015-10-22T00:00:00Z","timestamp":1445472000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,10,22]],"date-time":"2015-10-22T00:00:00Z","timestamp":1445472000000},"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":["CMMI-1254446"],"award-info":[{"award-number":["CMMI-1254446"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1319050"],"award-info":[{"award-number":["DMS-1319050"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-13-1-0036"],"award-info":[{"award-number":["N00014-13-1-0036"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10107-015-0955-5","type":"journal-article","created":{"date-parts":[[2015,10,22]],"date-time":"2015-10-22T14:31:09Z","timestamp":1445524269000},"page":"201-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Gradient sliding for composite optimization"],"prefix":"10.1007","volume":"159","author":[{"given":"Guanghui","family":"Lan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,22]]},"reference":[{"key":"955_CR1","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"A Auslender","year":"2006","unstructured":"Auslender, A., Teboulle, M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16, 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"key":"955_CR2","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/S0363012902407120","volume":"42","author":"HH Bauschke","year":"2003","unstructured":"Bauschke, H.H., Borwein, J.M., Combettes, P.L.: Bregman monotone optimization algorithms. SIAM J. Controal Optim. 42, 596\u2013636 (2003)","journal-title":"SIAM J. Controal Optim."},{"key":"955_CR3","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, 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"955_CR4","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Phys. 7, 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Phys."},{"key":"955_CR5","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, 1469\u20131492 (2012)","journal-title":"SIAM J. Optim."},{"key":"955_CR6","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, 2061\u20132089 (2013)","journal-title":"SIAM J. Optim."},{"key":"955_CR7","doi-asserted-by":"crossref","unstructured":"Jacob, L., Obozinski, G., Vert, J.-P.: Group lasso with overlap and graph lasso. In: Proceedings of the 26th International Conference on Machine Learning (2009)","DOI":"10.1145\/1553374.1553431"},{"key":"955_CR8","volume-title":"Solving Variational Inequalities with Stochastic Mirror-Prox Algorithm","author":"A Juditsky","year":"2011","unstructured":"Juditsky, A., Nemirovski, A.S., Tauvel, C.: Solving Variational Inequalities with Stochastic Mirror-Prox Algorithm. Georgia Institute of Technology, Atlanta (2011)"},{"key":"955_CR9","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1137\/S0363012995281742","volume":"35","author":"KC Kiwiel","year":"1997","unstructured":"Kiwiel, K.C.: Proximal minimization methods with generalized Bregman functions. SIAM J. Controal Optim. 35, 1142\u20131168 (1997)","journal-title":"SIAM J. Controal Optim."},{"issue":"3","key":"955_CR10","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"issue":"1","key":"955_CR11","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."},{"key":"955_CR12","unstructured":"Lan, G.: The Complexity of Large-Scale Convex Programming Under a Linear Optimization Oracle. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL (2013). \n                    http:\/\/www.optimization-online.org\/"},{"key":"955_CR13","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10107-011-0442-6","volume":"134","author":"G Lan","year":"2012","unstructured":"Lan, G., Nemirovski, A.S., Shapiro, A.: Validation analysis of mirror descent stochastic approximation method. Math. Program. 134, 425\u2013458 (2012)","journal-title":"Math. Program."},{"key":"955_CR14","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":"955_CR15","first-page":"543","volume":"269","author":"YE Nesterov","year":"1983","unstructured":"Nesterov, Y.E.: A method for unconstrained convex minimization problem with the rate of convergence $$O(1\/k^2)$$. Dokl. SSSR 269, 543\u2013547 (1983)","journal-title":"Dokl. SSSR"},{"key":"955_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"YE Nesterov","year":"2004","unstructured":"Nesterov, Y.E.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, Massachusetts (2004)"},{"key":"955_CR17","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"YE Nesterov","year":"2005","unstructured":"Nesterov, Y.E.: Smooth minimization of nonsmooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"955_CR18","unstructured":"Nesterov, Y.E.: Gradient Methods for Minimizing Composite Objective Functions. Technical report, Center for Operations Research and Econometrics (CORE), Catholic University of Louvain (2007)"},{"key":"955_CR19","first-page":"1458","volume":"24","author":"M Schmidt","year":"2011","unstructured":"Schmidt, M., Roux, N.L., Bach, F.R.: Convergence rates of inexact proximal-gradient methods for convex optimization. Adv. Neural Inf. Process. Syst. 24, 1458\u20131466 (2011)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"1","key":"955_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1111\/j.1467-9868.2005.00490.x","volume":"67","author":"R Tibshirani","year":"2005","unstructured":"Tibshirani, R., Saunders, M., Rosset, S., Zhu, J., Knight, K.: Sparsity and smoothness via the fused lasso. J. R. Stat. Soc. B 67(1), 91\u2013108 (2005)","journal-title":"J. R. Stat. Soc. B"},{"key":"955_CR21","unstructured":"Tomioka, R., Suzuki, T., Hayashi, K., Kashima, H.: Statistical performance of convex tensor decomposition. Adv. Neural Inf. Process. Syst. 24 (2011)"},{"key":"955_CR22","volume-title":"On Accelerated Proximal Gradient Methods for Convex\u2013Concave Optimization","author":"P Tseng","year":"2008","unstructured":"Tseng, P.: On Accelerated Proximal Gradient Methods for Convex\u2013Concave Optimization. University of Washington, Seattle (2008)"},{"key":"955_CR23","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1137\/110844805","volume":"3","author":"S Villa","year":"2013","unstructured":"Villa, S., Salzo, S., Baldassarre, L., Verri, A.: Accelerated and inexact forward\u2013backward algorithms. SIAM J. Optim. 3, 1607\u20131633 (2013)","journal-title":"SIAM J. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0955-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0955-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0955-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0955-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:16:35Z","timestamp":1589645795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0955-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,22]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["955"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0955-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,22]]},"assertion":[{"value":"11 June 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}