{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T18:49:40Z","timestamp":1773514180051,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10107-010-0434-y","type":"journal-article","created":{"date-parts":[[2010,12,31]],"date-time":"2010-12-31T07:35:49Z","timestamp":1293780949000},"page":"365-397","source":"Crossref","is-referenced-by-count":212,"title":["An optimal method for stochastic composite optimization"],"prefix":"10.1007","volume":"133","author":[{"given":"Guanghui","family":"Lan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,1]]},"reference":[{"key":"434_CR1","doi-asserted-by":"crossref","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":"434_CR2","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1137\/S0363012902407120","volume":"42","author":"H.H. Bauschke","year":"2003","unstructured":"Bauschke H.H., Borwein J.M., Combettes P.L.: Bregman monotone optimization algorithms. SIAM J. Control Optim. 42, 596\u2013636 (2003)","journal-title":"SIAM J. Control Optim."},{"key":"434_CR3","volume-title":"Nesta: A Fast and Accurate First-Order Method for Sparse Recovery, Manuscript","author":"S. Becker","year":"2009","unstructured":"Becker S., Bobin J., Candes E.: Nesta: A Fast and Accurate First-Order Method for Sparse Recovery, Manuscript. California Institute of Technology, Pasadena (2009)"},{"key":"434_CR4","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10107-004-0553-4","volume":"102","author":"A. Ben-Tal","year":"2005","unstructured":"Ben-Tal A., Nemirovski A.: Non-euclidean restricted memory level method for large-scale convex optimization. Math. Program. 102, 407\u2013456 (2005)","journal-title":"Math. Program."},{"key":"434_CR5","unstructured":"Benveniste, A., M\u00e9tivier, M., Priouret, P.: Algorithmes adaptatifs et approximations stochastiques. Masson, 1987. English translation: Adaptive Algorithms and Stochastic Approximations. Springer (1993)"},{"key":"434_CR6","volume-title":"Nonlinear Programming","author":"D. Bertsekas","year":"1999","unstructured":"Bertsekas D.: Nonlinear Programming, 2nd edn. Athena Scientific, New York (1999)","edition":"2"},{"key":"434_CR7","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"L.M. 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":"434_CR8","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1137\/060676386","volume":"19","author":"A. d\u2019Aspremont","year":"2008","unstructured":"d\u2019Aspremont A.: Smooth optimization with approximate gradient. SIAM J. Optim. 19, 1171\u20131183 (2008)","journal-title":"SIAM J. Optim."},{"key":"434_CR9","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/060670985","volume":"30","author":"A. d\u2019Aspremont","year":"2008","unstructured":"d\u2019Aspremont A., Banerjee O., El Ghaoue L.: First-order methods for sparse covariance selection. SIAM J. Matrix Anal. Appl. 30, 56\u201366 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"434_CR10","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":"434_CR11","first-page":"89","volume":"4","author":"A. Gaivoronski","year":"1978","unstructured":"Gaivoronski A.: Nonstationary stochastic programming problems. Kybernetika 4, 89\u201392 (1978)","journal-title":"Kybernetika"},{"key":"434_CR12","doi-asserted-by":"crossref","first-page":"n.4","DOI":"10.1007\/s11122-006-0005-2","volume":"41","author":"A. Juditsky","year":"2005","unstructured":"Juditsky A., Nazin A., Tsybakov A.B., Vayatis N.: Recursive aggregation of estimators via the mirror descent algorithm with average. Probl. Inf. Transm. 41, n.4 (2005)","journal-title":"Probl. Inf. Transm."},{"key":"434_CR13","unstructured":"Juditsky, A., Nemirovski, A., Tauvel, C.: Solving Variational Inequalities with Stochastic Mirror-Prox Algorithm, Manuscript. Georgia Institute of Technology. Submitted to SIAM J. Control Optim Atlanta (2008)"},{"key":"434_CR14","doi-asserted-by":"crossref","first-page":"2183","DOI":"10.1214\/07-AOS546","volume":"36","author":"A. Juditsky","year":"2008","unstructured":"Juditsky A., Rigollet P., Tsybakov A.B.: Learning by mirror averaging. Ann. Stat. 36, 2183\u20132206 (2008)","journal-title":"Ann. Stat."},{"key":"434_CR15","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1137\/S0363012995281742","volume":"35","author":"K.C. Kiwiel","year":"1997","unstructured":"Kiwiel K.C.: Proximal minimization methods with generalized bregman functions. SIAM J. Control Optim. 35, 1142\u20131168 (1997)","journal-title":"SIAM J. Control Optim."},{"key":"434_CR16","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"A.J. Kleywegt","year":"2001","unstructured":"Kleywegt A.J., Shapiro A., Homem de Mello T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12, 479\u2013502 (2001)","journal-title":"SIAM J. Optim."},{"key":"434_CR17","volume-title":"Approximation and Recursive Algorithms and Applications, vol. 35 of Applications of Mathematics","author":"H. Kushner","year":"2003","unstructured":"Kushner H., Yin J., Shapiro G.: Approximation and Recursive Algorithms and Applications, vol. 35 of Applications of Mathematics. Springer, New York (2003)"},{"key":"434_CR18","doi-asserted-by":"crossref","unstructured":"Lan, G., Lu, Z., Monteiro, R.D.C.: Primal-dual first-order methods with $${{\\mathcal O}(1\/\\epsilon)}$$ iteration-complexity for cone programming. Math. Program. (2009, to appear)","DOI":"10.1007\/s10107-008-0261-6"},{"key":"434_CR19","unstructured":"Lan, G., Monteiro, R.D.C.: Iteration-Complexity of First-Order Penalty Methods for Convex Programming, Manuscript. School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta (June, 2008)"},{"key":"434_CR20","unstructured":"Lan G., Monteiro, R.D.C.: Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Programming, Manuscript. School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta (May, 2009)"},{"key":"434_CR21","unstructured":"Lan, G., Nemirovski, A., Shapiro, A.: Validation analysis of robust stochastic approximation method. submitted to Math. Program. (2008). http:\/\/www.optimization-online.org"},{"key":"434_CR22","volume-title":"A Proximal Method for Composite Minimization, Manuscript","author":"A.S. Lewis","year":"2009","unstructured":"Lewis A.S., Wright S.J.: A Proximal Method for Composite Minimization, Manuscript. Cornell University, Ithaca (2009)"},{"key":"434_CR23","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10479-006-6169-8","volume":"142","author":"J. Linderoth","year":"2006","unstructured":"Linderoth J., Shapiro A., Wright S.: The empirical behavior of sampling methods for stochastic programming. Ann. Oper. Res. 142, 215\u2013241 (2006)","journal-title":"Ann. Oper. Res."},{"key":"434_CR24","doi-asserted-by":"crossref","first-page":"1807","DOI":"10.1137\/070695915","volume":"19","author":"Z. Lu","year":"2009","unstructured":"Lu Z.: Smooth optimization approach for sparse covariance selection. SIAM J. Optim. 19, 1807\u20131827 (2009)","journal-title":"SIAM J. Optim."},{"key":"434_CR25","unstructured":"Lu, Z., Monteiro, R.D.C., Yuan, M.: Convex Optimization Methods for Dimension Reduction and Coefficient Estimation in Multivariate Linear Regression, Manuscript. School of ISyE, Georgia Tech, Atlanta (January, 2008)"},{"key":"434_CR26","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10107-006-0031-2","volume":"109","author":"Z. Lu","year":"2007","unstructured":"Lu Z., Nemirovski A., Monteiro R.D.C.: Large-scale semidefinite programming via saddle point mirror-prox algorithm. Math. Program. 109, 211\u2013237 (2007)","journal-title":"Math. Program."},{"key":"434_CR27","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0167-6377(98)00054-6","volume":"24","author":"W.K. Mak","year":"1999","unstructured":"Mak W.K., Morton D.P., Wood R.K.: Monte carlo bounding techniques for determining solution quality in stochastic programs. Oper. Res. Lett. 24, 47\u201356 (1999)","journal-title":"Oper. Res. Lett."},{"key":"434_CR28","doi-asserted-by":"crossref","unstructured":"Monteiro, R.D.C., Svaiter B.F.: On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean, Manuscript. School of ISyE, Georgia Tech, Atlanta (March, 2009)","DOI":"10.1137\/090753127"},{"key":"434_CR29","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A. Nemirovski","year":"2004","unstructured":"Nemirovski A.: Prox-method with rate of convergence o(1\/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15, 229\u2013251 (2004)","journal-title":"SIAM J. Optim."},{"key":"434_CR30","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, 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"434_CR31","volume-title":"Problem Complexity and Method Efficiency in Optimization. Wiley-Interscience Series in Discrete Mathematics, vol. XV","author":"A. Nemirovski","year":"1983","unstructured":"Nemirovski A., Yudin D.: Problem Complexity and Method Efficiency in Optimization. Wiley-Interscience Series in Discrete Mathematics, vol. XV. Wiley, New York (1983)"},{"key":"434_CR32","unstructured":"Nesterov, Y.E.: A method for unconstrained convex minimization problem with the rate of convergence O(1\/k 2). Doklady AN SSSR 269:543\u2013547 (1983). Translated as Soviet Math. Docl"},{"key":"434_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y.E. Nesterov","year":"2004","unstructured":"Nesterov Y.E.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer, Massachusetts (2004)"},{"key":"434_CR34","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y.E. Nesterov","year":"2005","unstructured":"Nesterov Y.E.: Smooth minimization of nonsmooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"434_CR35","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y.E. Nesterov","year":"2006","unstructured":"Nesterov Y.E.: Primal-dual subgradient methods for convex problems. Math. Program. 120, 221\u2013259 (2006)","journal-title":"Math. Program."},{"key":"434_CR36","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, September)"},{"key":"434_CR37","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10107-006-0001-8","volume":"110","author":"Y.E. Nesterov","year":"2007","unstructured":"Nesterov Y.E.: Smoothing technique and its applications in semidefinite optimization. Math. Program. 110, 245\u2013259 (2007)","journal-title":"Math. Program."},{"key":"434_CR38","first-page":"12","volume":"78","author":"J. Pe\u00f1a","year":"2008","unstructured":"Pe\u00f1a J.: Nash equilibria computation via smoothing techniques. Optima 78, 12\u201313 (2008)","journal-title":"Optima"},{"key":"434_CR39","doi-asserted-by":"crossref","unstructured":"Pflug, G.C.: Optimization of Stochastic Models. In: The Interface Between Simulation and Optimization. Kluwer, Boston (1996)","DOI":"10.1007\/978-1-4613-1449-3"},{"key":"434_CR40","first-page":"98","volume":"7","author":"B.T. Polyak","year":"1990","unstructured":"Polyak B.T.: New stochastic approximation type procedures. Automat. i Telemekh 7, 98\u2013107 (1990)","journal-title":"Automat. i Telemekh"},{"key":"434_CR41","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":"434_CR42","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, 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"key":"434_CR43","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"434_CR44","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BFb0121128","volume":"28","author":"A. Ruszczy\u0144ski","year":"1986","unstructured":"Ruszczy\u0144ski A., Sysk W.: A method of aggregate stochastic subgradients with on-line stepsize rules for convex stochastic programming problems. Math. Program. Study 28, 113\u2013131 (1986)","journal-title":"Math. Program. Study"},{"key":"434_CR45","volume-title":"Stochastic Programming","author":"A. Shapiro","year":"2003","unstructured":"Shapiro A.: Monte carlo sampling methods. In: Ruszczy\u0144ski, A., Shapiro, A. (eds) Stochastic Programming, North-Holland, Amsterdam (2003)"},{"key":"434_CR46","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/0-387-26771-9_4","volume-title":"Continuous Optimization: Current Trends and Applications","author":"A. Shapiro","year":"2005","unstructured":"Shapiro A., Nemirovski A.: On complexity of stochastic programming problems. In: Jeyakumar, V., Rubinov, A.M. (eds) Continuous Optimization: Current Trends and Applications, pp. 111\u2013144. Springer, Berlin (2005)"},{"key":"434_CR47","doi-asserted-by":"crossref","DOI":"10.1002\/0471722138","volume-title":"Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control","author":"J.C. Spall","year":"2003","unstructured":"Spall J.C.: Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control. Wiley, Hoboken (2003)"},{"key":"434_CR48","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1214\/aoms\/1177700153","volume":"30","author":"V. Strassen","year":"1965","unstructured":"Strassen V.: The existence of probability measures with given marginals. Ann. Math. Stat. 30, 423\u2013439 (1965)","journal-title":"Ann. Math. Stat."},{"key":"434_CR49","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1137\/S1052623495292130","volume":"7","author":"M. Teboulle","year":"1997","unstructured":"Teboulle M.: Convergence of proximal-like algorithms. SIAM J. Optim. 7, 1069\u20131083 (1997)","journal-title":"SIAM J. Optim."},{"key":"434_CR50","volume-title":"On Accelerated Proximal Gradient Methods for Convex-Concave Optimization, Manuscript","author":"P. Tseng","year":"2008","unstructured":"Tseng P.: On Accelerated Proximal Gradient Methods for Convex-Concave Optimization, Manuscript. University of Washington, Seattle (May 2008)"},{"key":"434_CR51","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1023\/A:1021814225969","volume":"24","author":"B. Verweij","year":"2003","unstructured":"Verweij B., Ahmed S., Kleywegt J.A., Nemhauser G., Shapiro A.: The sample average approximation method applied to stochastic routing problems: a computational study. Comput. Optim. Appl. 24, 289\u2013333 (2003)","journal-title":"Comput. Optim. Appl."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0434-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0434-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0434-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T17:43:48Z","timestamp":1685900628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0434-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":51,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["434"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0434-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}