{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T02:14:27Z","timestamp":1771294467391,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T00:00:00Z","timestamp":1550102400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T00:00:00Z","timestamp":1550102400000},"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-1522654"],"award-info":[{"award-number":["DMS-1522654"]}],"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":["J Sci Comput"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10915-019-00915-4","type":"journal-article","created":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T09:09:40Z","timestamp":1550135380000},"page":"1854-1881","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Generalized Uniformly Optimal Methods for Nonlinear Programming"],"prefix":"10.1007","volume":"79","author":[{"given":"Saeed","family":"Ghadimi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2103-087X","authenticated-orcid":false,"given":"Guanghui","family":"Lan","sequence":"additional","affiliation":[]},{"given":"Hongchao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,14]]},"reference":[{"key":"915_CR1","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":"915_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, 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"915_CR3","first-page":"2618","volume":"25","author":"Stephen Becker","year":"2012","unstructured":"Becker, Stephen, Fadili, Jalal M.: A quasi-newton proximal splitting method. Adv. Neural Inf. Process. Syst. 25, 2618\u20132626 (2012)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"915_CR4","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10107-004-0553-4","volume":"102","author":"A Ben-Tal","year":"2005","unstructured":"Ben-Tal, A., Nemirovski, A.S.: Non-Euclidean restricted memory level method for large-scale convex optimization. Math. Program. 102, 407\u2013456 (2005)","journal-title":"Math. Program."},{"issue":"4","key":"915_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01582063","volume":"63","author":"RH Byrd","year":"1994","unstructured":"Byrd, R.H., Nocedal, J., Schnabel, R.B.: Representations of quasi-newton matrices and their use in limited memory methods. Math. Program. 63(4), 129\u2013156 (1994)","journal-title":"Math. Program."},{"issue":"6","key":"915_CR6","doi-asserted-by":"publisher","first-page":"2833","DOI":"10.1137\/090774100","volume":"20","author":"C Cartis","year":"2010","unstructured":"Cartis, C., Gould, N.I.M., Toint, PhL: 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":"915_CR7","doi-asserted-by":"crossref","unstructured":"Chen, Y., Lan, G., Ouyang, Y., Zhang, W.: Fast bundle-level type methods for unconstrained and ball-constrained convex optimization. Manuscript, University of Florida, Gainesville, FL 32611, USA, December 2014. \n                    http:\/\/www.optimization-online.org\/","DOI":"10.21236\/ADA612792"},{"key":"915_CR8","first-page":"13481360","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, 13481360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"915_CR9","doi-asserted-by":"publisher","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":"915_CR10","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":"915_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0871-8","author":"S Ghadimi","year":"2015","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic optimization. Math. Program. (2015). \n                    https:\/\/doi.org\/10.1007\/s10107-015-0871-8","journal-title":"Math. Program."},{"key":"915_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0846-1","author":"S Ghadimi","year":"2014","unstructured":"Ghadimi, S., Lan, G., Zhang, H.: Mini-batch stochastic approximation methods for constrained nonconvex stochastic programming. Math. Program. (2014). \n                    https:\/\/doi.org\/10.1007\/s10107-014-0846-1","journal-title":"Math. Program."},{"key":"915_CR13","unstructured":"Hager, W.W., Zhang, H.: Projection on a polyhedron that exploits sparsity. Manuscript, University of Florida and Louisiana State University, Gainesville, FL 32611, USA and Baton Rouge, LA (June 2015)"},{"issue":"1","key":"915_CR14","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":"915_CR15","first-page":"145","volume":"149","author":"G Lan","year":"2015","unstructured":"Lan, G.: Bundle-level type methods uniformly optimal for smooth and non-smooth convex optimization. Math. Program. 149(1), 145 (2015)","journal-title":"Math. Program."},{"key":"915_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, USA (June 2013). \n                    http:\/\/www.optimization-online.org"},{"key":"915_CR17","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":"915_CR18","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C Lemar\u00e9chal","year":"1995","unstructured":"Lemar\u00e9chal, C., Nemirovski, A.S., Nesterov, Y.E.: New variants of bundle methods. Math. Program. 69, 111\u2013148 (1995)","journal-title":"Math. Program."},{"key":"915_CR19","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":"915_CR20","unstructured":"Mason, L., Baxter, J., Bartlett, P., Frean, M.: Boosting algorithms as gradient descent in function space. In: Proceedings of the NIPS, vol. 12, pp. 512\u2013518 (1999)"},{"key":"915_CR21","volume-title":"Problem Complexity and Method Efficiency in Optimization. Wiley-Interscience Series in Discrete Mathematics","author":"AS Nemirovski","year":"1983","unstructured":"Nemirovski, A.S., Yudin, D.: Problem Complexity and Method Efficiency in Optimization. Wiley-Interscience Series in Discrete Mathematics. Wiley, XV, New York (1983)"},{"key":"915_CR22","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. Acad. Nauk SSSR 269, 543\u2013547 (1983)","journal-title":"Dokl. Acad. Nauk SSSR"},{"key":"915_CR23","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, Boston (2004)"},{"key":"915_CR24","doi-asserted-by":"publisher","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":"915_CR25","doi-asserted-by":"publisher","unstructured":"Nesterov, Y.E.: Universal gradient methods for convex optimization problems. Math.Program. Ser. A (2014). \n                    https:\/\/doi.org\/10.1007\/s10107-014-0790-0","DOI":"10.1007\/s10107-014-0790-0"},{"issue":"151","key":"915_CR26","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating quasi-newton matrices with limited storage. Math. Comput. 35(151), 773\u2013782 (1980)","journal-title":"Math. Comput."},{"key":"915_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1999)"},{"key":"915_CR28","unstructured":"Devolder, O., Glineur, F., Nesterov, Y.E.: First-order methods of smooth convex optimization with inexact oracle. CORE, Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium, Manuscript (December 2010)"},{"key":"915_CR29","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization. University of Washington, Seattle, Manuscript (May 2008)"},{"key":"915_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-015-0936-x","author":"M Yashtini","year":"2015","unstructured":"Yashtini, M.: On the global convergence rate of the gradient descent method for functions with H\u00f6lder continuous gradients. Optim. Lett. (2015). \n                    https:\/\/doi.org\/10.1007\/s11590-015-0936-x","journal-title":"Optim. Lett."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10915-019-00915-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-019-00915-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-019-00915-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T09:39:18Z","timestamp":1589708358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10915-019-00915-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,14]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["915"],"URL":"https:\/\/doi.org\/10.1007\/s10915-019-00915-4","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,14]]},"assertion":[{"value":"14 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}