{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T03:47:40Z","timestamp":1775101660922,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,2,21]],"date-time":"2015-02-21T00:00:00Z","timestamp":1424476800000},"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,3]]},"DOI":"10.1007\/s10107-015-0871-8","type":"journal-article","created":{"date-parts":[[2015,2,20]],"date-time":"2015-02-20T01:38:27Z","timestamp":1424396307000},"page":"59-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":290,"title":["Accelerated gradient methods for nonconvex nonlinear and stochastic programming"],"prefix":"10.1007","volume":"156","author":[{"given":"Saeed","family":"Ghadimi","sequence":"first","affiliation":[]},{"given":"Guanghui","family":"Lan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,21]]},"reference":[{"key":"871_CR1","doi-asserted-by":"crossref","unstructured":"Andrad\u00f3ttir, S.: A review of simulation optimization techniques. In: Proceedings of the 1998 Winter Simulation Conference, pp. 151\u2013158 (1998)","DOI":"10.1109\/WSC.1998.744910"},{"key":"871_CR2","volume-title":"Stochastic Simulation: Algorithm and Analysis","author":"S Asmussen","year":"2000","unstructured":"Asmussen, S., Glynn, P.W.: Stochastic Simulation: Algorithm and Analysis. Springer, New York (2000)"},{"key":"871_CR3","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-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2, 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"6","key":"871_CR4","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":"871_CR5","doi-asserted-by":"crossref","unstructured":"Chen, X., Ge, D., Wang, Z., Ye, Y.: Complexity of unconstrained $$l_2-l_p$$ l 2 - l p minimization. Math. Program. (2012). doi: 10.1007\/s10107-012-0613-0","DOI":"10.1007\/s10107-012-0613-0"},{"key":"871_CR6","unstructured":"Dang, C.D., Lan, G.: Stochastic block mirror descent methods for nonsmooth and stochastic optimization. Manuscript, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA (2013)"},{"key":"871_CR7","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96, 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"871_CR8","unstructured":"Feng, M., Mitchell, J.E., Pang, J.-S., Shen, X., W\u00e4chter, A.: Complementarity formulations of $$l_0$$ l 0 -norm optimization problems. Manuscript (2013)"},{"key":"871_CR9","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":"871_CR10","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":"871_CR11","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."},{"issue":"4","key":"871_CR12","doi-asserted-by":"crossref","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first- and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23(4), 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"key":"871_CR13","unstructured":"Ghadimi, S., Lan, G., Zhang, H.: Mini-batch stochastic approximation methods for constrained nonconvex stochastic programming. Manuscript, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA. Mathematical Programming (Under second-round review) (2014)"},{"key":"871_CR14","doi-asserted-by":"crossref","unstructured":"Lemarechal, C., Hiriart-Urruty, J.-B.: Convex Analysis and Minimization Algorithms II. A Series of Comperhensive Studies in Mathematics. Springer Science & Business Media, Heidelberg (1993)","DOI":"10.1007\/978-3-662-06409-2"},{"issue":"1","key":"871_CR15","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":"871_CR16","unstructured":"Lan, G.: The complexity of large-scale convex programming under a linear optimization oracle. Manuscript, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA. http:\/\/www.optimization-online.org\/ (2013)"},{"key":"871_CR17","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10107-012-0588-x","volume":"138","author":"G Lan","year":"2013","unstructured":"Lan, G., Monteiro, R.D.C.: Iteration-complexity of first-order penalty methods for convex programming. Math. Program. 138, 115\u2013139 (2013)","journal-title":"Math. Program."},{"key":"871_CR18","unstructured":"Lan, G., Monteiro, R.D.C.: Iteration-complexity of first-order augmented lagrangian methods for convex programming. Technical report, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA. Mathematical Programming (Under second-round review) (2013)"},{"key":"871_CR19","volume-title":"Simulation Modeling and Analysis","author":"AM Law","year":"2007","unstructured":"Law, A.M.: Simulation Modeling and Analysis. McGraw Hill, New York (2007)"},{"key":"871_CR20","unstructured":"Lewis, A.S., Wright, S.J.: A proximal method for composite minimization. Manuscript, Cornell University, Ithaca, NY (2009)"},{"key":"871_CR21","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":"871_CR22","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods. Manuscript, School of ISyE, Georgia Tech, Atlanta, GA, 30332, USA (2011)"},{"key":"871_CR23","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":"871_CR24","unstructured":"Nemirovski, A.S., Yudin, D.: Problem complexity and method efficiency in optimization. In: Graham, R.L., Lenstra, J.K. (eds.) Wiley-Interscience Series in Discrete Mathematics. Wiley, XV (1983)"},{"key":"871_CR25","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)$$ O ( 1 \/ k 2 ) . Doklady AN SSSR 269, 543\u2013547 (1983)","journal-title":"Doklady AN SSSR"},{"key":"871_CR26","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 Academic Publishers, Massachusetts (2004)"},{"key":"871_CR27","doi-asserted-by":"crossref","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":"871_CR28","first-page":"10","volume":"88","author":"YE Nesterov","year":"2012","unstructured":"Nesterov, Y.E.: How to make gradients small. Optima 88, 10\u201311 (2012)","journal-title":"Optima"},{"key":"871_CR29","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"YE Nesterov","year":"2013","unstructured":"Nesterov, Y.E.: Gradient methods for minimizing composite objective functions. Math. Program. Ser. B 140, 125\u2013161 (2013)","journal-title":"Math. Program. Ser. B"},{"key":"871_CR30","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/0330046","volume":"30","author":"BT 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":"871_CR31","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":"871_CR32","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1137\/050623012","volume":"19","author":"A Sartenaer","year":"2008","unstructured":"Sartenaer, A., Gratton, S., Toint, P.L.: Recursive trust-region methods for multiscale nonlinear optimization. SIAM J. Optim. 19, 414\u2013444 (2008)","journal-title":"SIAM J. Optim."},{"key":"871_CR33","doi-asserted-by":"crossref","DOI":"10.1002\/0471722138","volume-title":"Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control","author":"JC Spall","year":"2003","unstructured":"Spall, J.C.: Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control. Wiley, Hoboken (2003)"},{"key":"871_CR34","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex\u2013concave optimization. Manuscript, University of Washington, Seattle (May 2008)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0871-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0871-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0871-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T23:23:33Z","timestamp":1566343413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0871-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,21]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["871"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0871-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,21]]}}}