{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T08:49:04Z","timestamp":1786092544912,"version":"3.56.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,12,11]],"date-time":"2014-12-11T00:00:00Z","timestamp":1418256000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10107-014-0846-1","type":"journal-article","created":{"date-parts":[[2014,12,10]],"date-time":"2014-12-10T04:32:09Z","timestamp":1418185929000},"page":"267-305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":219,"title":["Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization"],"prefix":"10.1007","volume":"155","author":[{"given":"Saeed","family":"Ghadimi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guanghui","family":"Lan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongchao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,12,11]]},"reference":[{"key":"846_CR1","doi-asserted-by":"crossref","unstructured":"Andrad\u00f3ttir, S.: A review of simulation optimization techniques. In: Proceedings of the Winter Simulation Conference, pp. 151\u2013158 (1998)","DOI":"10.1109\/WSC.1998.744910"},{"key":"846_CR2","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":"846_CR3","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1137\/S0363012902407120","volume":"42","author":"H Bauschke","year":"2003","unstructured":"Bauschke, H., Borwein, J., Combettes, P.: Bregman monotone optimization algorithms. SIAM J. Control Optim. 42, 596\u2013636 (2003)","journal-title":"SIAM J. Control Optim."},{"key":"846_CR4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1137\/S1052623499354564","volume":"12","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Margalit, T., Nemirovski, A.S.: The ordered subsets mirror descent optimization method with applications to tomography. SIAM J. Optim. 12, 79\u2013108 (2001)","journal-title":"SIAM J. Optim."},{"key":"846_CR5","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"L Bregman","year":"1967","unstructured":"Bregman, L.: 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."},{"issue":"6","key":"846_CR6","doi-asserted-by":"crossref","first-page":"2833","DOI":"10.1137\/090774100","volume":"20","author":"C Cartis","year":"2010","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: On the complexity of steepest descent, Newton\u2019s and regularized Newton\u2019s methods for nonconvex unconstrained optimization. SIAM J. Optim. 20(6), 2833\u20132852 (2010)","journal-title":"SIAM J. Optim."},{"key":"846_CR7","first-page":"203","volume":"9","author":"O Chapelle","year":"2008","unstructured":"Chapelle, O., Sindhwani, V., Keerthi, S.S.: Optimization techniques for semi-supervised support vector machines. J. Mach. Learn. Res. 9, 203\u2013233 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"846_CR8","unstructured":"Dang, C.D., Lan, G.: On the Convergence Properties of Non-Euclidean Extragradient Methods for Variational Inequalities with Generalized Monotone Operators, manuscript, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA, April 2012. Available on http:\/\/www.optimization-online.org\/"},{"key":"846_CR9","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1137\/110831659","volume":"22","author":"JC Duchi","year":"2012","unstructured":"Duchi, J.C., Bartlett, P.L., Wainwright, M.J.: Randomized smoothing for stochastic optimization. SIAM J. Optim. 22, 674\u2013701 (2012)","journal-title":"SIAM J. Optim."},{"key":"846_CR10","unstructured":"Duchi, J.C., Shalev-shwartz, S., Singer, Y., Tewari, A.: Composite objective mirror descent. In: Proceedings of the Twenty Third Annual Conference on Computational Learning Theory (2010)"},{"key":"846_CR11","unstructured":"Flaxman, A.D., Kalai, A.T., McMahan, H.B.: Online convex optimization in the bandit setting: gradient descent without a gradient. J. Am. Stat. Assoc., 385\u2013394 (2005). Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms"},{"key":"846_CR12","unstructured":"Fu, M.: Gradient estimation. In: Henderson, S.G., Nelson, B.L. (eds). Handbooks in Operations Research and Management Science: Simulation. Elsevier, Amsterdam, pp. 575\u2013616 (2008)"},{"key":"846_CR13","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/ijoc.14.3.192.113","volume":"14","author":"M Fu","year":"2002","unstructured":"Fu, M.: Optimization for simulation: theory vs. practice. INFORMS J. Comput. 14, 192\u2013215 (2002)","journal-title":"INFORMS J. Comput."},{"key":"846_CR14","doi-asserted-by":"crossref","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":"846_CR15","doi-asserted-by":"crossref","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":"846_CR16","unstructured":"Ghadimi, S., Lan, G.: Accelerated Gradient Methods for Nonconvex Nonlinear and Stochastic Optimization. Technical Report. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA (2013)"},{"key":"846_CR17","volume-title":"Gradient Estimation Via Perturbation Analysis","author":"P Glasserman","year":"2003","unstructured":"Glasserman, P.: Gradient Estimation Via Perturbation Analysis. Kluwer, Boston, MA (2003)"},{"key":"846_CR18","unstructured":"Juditsky, A., Nemirovski, A.S.: Large Deviations of Vector-Valued Martingales in $$2$$ 2 -Smooth Normed Spaces, manuscript, Georgia Institute of Technology, Atlanta, GA, E-print: www2.isye.gatech.edu\/~nemirovs\/LargeDevSubmitted.pdf (2008)"},{"key":"846_CR19","volume-title":"Optimization for Machine Learning","author":"A Juditsky","year":"2011","unstructured":"Juditsky, A., Nemirovski, A.S.: First-order methods for nonsmooth convex large-scale optimization. I: general purpose methods. In: Sra, S., Nowozin, S., Wright, S.J. (eds.) Optimization for Machine Learning. MIT Press, Cambridge, MA (2011)"},{"key":"846_CR20","volume-title":"Simulation with Arena","author":"RPSWD Kelton","year":"2007","unstructured":"Kelton, R.P.S.W.D., Sturrock, D.T.: Simulation with Arena, 4th edn. McGraw-Hill, New York (2007)","edition":"4"},{"issue":"1","key":"846_CR21","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."},{"key":"846_CR22","doi-asserted-by":"crossref","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":"846_CR23","doi-asserted-by":"crossref","unstructured":"L\u00c9cuyer, P.: A unified view of the IPA, SF, and LR gradient estimation techniques. Manag. Sci. 36(11), 1364\u20131383 (1990)","DOI":"10.1287\/mnsc.36.11.1364"},{"key":"846_CR24","doi-asserted-by":"crossref","unstructured":"Mairal, J., Bach, F., Ponce, J., Sapiro, G.: Online dictionary learning for sparse coding. In: ICML, pp. 689\u2013696 (2009)","DOI":"10.1145\/1553374.1553463"},{"key":"846_CR25","first-page":"512","volume":"12","author":"L Mason","year":"1999","unstructured":"Mason, L., Baxter, J., Bartlett, P., Frean, M.: Boosting algorithms as gradient descent in function space. Proc. NIPS 12, 512\u2013518 (1999)","journal-title":"Proc. NIPS"},{"key":"846_CR26","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"AS Nemirovski","year":"2009","unstructured":"Nemirovski, A.S., 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":"846_CR27","unstructured":"Nemirovski, A.S., Yudin, D.: Problem Complexity and Method Efficiency in Optimization. Wiley-Interscience Series in Discrete Mathematics. John Wiley, Chichester, New York (1983)"},{"key":"846_CR28","doi-asserted-by":"crossref","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, Boston, MA (2004)"},{"key":"846_CR29","unstructured":"Nesterov, Y.E.: Random Gradient-Free Minimization of Convex Functions, Technical Report. Center for Operations Research and Econometrics (CORE), Catholic University of Louvain (2010)"},{"key":"846_CR30","first-page":"98","volume":"7","author":"B Polyak","year":"1990","unstructured":"Polyak, B.: New stochastic approximation type procedures. Automat. i Telemekh. 7, 98\u2013107 (1990)","journal-title":"Automat. i Telemekh."},{"key":"846_CR31","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/0330046","volume":"30","author":"B Polyak","year":"1992","unstructured":"Polyak, B., Juditsky, A.: Acceleration of stochastic approximation by averaging. SIAM J. Control Optim. 30, 838\u2013855 (1992)","journal-title":"SIAM J. Control Optim."},{"key":"846_CR32","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":"846_CR33","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational analysis, ser. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer, Berlin (1998)","DOI":"10.1007\/978-3-642-02431-3"},{"key":"846_CR34","volume-title":"Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method","author":"R Rubinstein","year":"1993","unstructured":"Rubinstein, R., Shapiro, A.: Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method. Wiley, New York (1993)"},{"key":"846_CR35","unstructured":"Schmidt, M., Roux, N.L., Bach, F.: Minimizing Finite Sums with the Stochastic Average Gradient, Technical Report (2013)"},{"key":"846_CR36","doi-asserted-by":"crossref","DOI":"10.1002\/0471722138","volume-title":"Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control","author":"J Spall","year":"2003","unstructured":"Spall, J.: Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control. Wiley, Hoboken, NJ (2003)"},{"key":"846_CR37","unstructured":"Sra, S.: Scalable nonconvex inexact proximal splitting. In: Pereira, F., Burges, C.J.C., Bottou, L., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems 25, pp. 530\u2013538. Curran Associates, Inc. (2012)"},{"key":"846_CR38","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."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0846-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0846-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0846-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T08:59:24Z","timestamp":1566118764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0846-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,11]]},"references-count":38,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["846"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0846-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,11]]}}}