{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T12:04:20Z","timestamp":1782389060733,"version":"3.54.5"},"reference-count":71,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"publisher","award":["24YF2702500"],"award-info":[{"award-number":["24YF2702500"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"publisher","award":["SIMIS-ID-2024-CN"],"award-info":[{"award-number":["SIMIS-ID-2024-CN"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"publisher","award":["SIMISID-2024-WE"],"award-info":[{"award-number":["SIMISID-2024-WE"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12501704"],"award-info":[{"award-number":["12501704"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.ejor.2025.11.010","type":"journal-article","created":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T09:23:37Z","timestamp":1763630617000},"page":"720-734","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Nesterov\u2013Spokoiny acceleration achieves strict o(1\/k2) convergence"],"prefix":"10.1016","volume":"334","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-3778-6695","authenticated-orcid":false,"given":"Weibin","family":"Peng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-9426-3499","authenticated-orcid":false,"given":"Yu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6206-8359","authenticated-orcid":false,"given":"Tianyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2025.11.010_bib0001","unstructured":"Allen-Zhu, Z., & Orecchia, L. (2014). Linear coupling: An ultimate unification of gradient and mirror descent. arXiv: 1407.1537."},{"key":"10.1016\/j.ejor.2025.11.010_bib0002","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1023\/A:1011253113155","article-title":"An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping","volume":"9","author":"Alvarez","year":"2001","journal-title":"Set-Valued Analysis"},{"issue":"8","key":"10.1016\/j.ejor.2025.11.010_bib0003","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1016\/S0021-7824(01)01253-3","article-title":"A second-order gradient-like dissipative dynamical system with hessian-driven damping.: Application to optimization and mechanics","volume":"81","author":"Alvarez","year":"2002","journal-title":"Journal de Math\u00e9matiques Pures et Appliqu\u00e9es"},{"key":"10.1016\/j.ejor.2025.11.010_bib0004","series-title":"Mathematical methods of classical mechanics","volume":"vol. 60","author":"Arnold","year":"1989"},{"key":"10.1016\/j.ejor.2025.11.010_bib0005","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-020-01591-1","article-title":"First-order optimization algorithms via inertial systems with hessian driven damping","volume":"193","author":"Attouch","year":"2022","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2025.11.010_bib0006","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10107-016-0992-8","article-title":"Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity","volume":"168","author":"Attouch","year":"2018","journal-title":"Mathematical Programming"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.010_bib0007","doi-asserted-by":"crossref","first-page":"1824","DOI":"10.1137\/15M1046095","article-title":"The rate of convergence of Nesterov\u2019s accelerated forward-backward method is actually faster than 1\/k2","volume":"26","author":"Attouch","year":"2016","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.010_bib0008","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1137\/130910294","article-title":"A dynamical approach to an inertial forward-backward algorithm for convex minimization","volume":"24","author":"Attouch","year":"2014","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/j.ejor.2025.11.010_bib0009","first-page":"2","article-title":"Rate of convergence of the Nesterov accelerated gradient method in the subcritical case \u03b1\u202f\u2264\u202f3","volume":"25","author":"Attouch","year":"2019","journal-title":"ESAIM: COCV"},{"issue":"10","key":"10.1016\/j.ejor.2025.11.010_bib0010","doi-asserted-by":"crossref","first-page":"5734","DOI":"10.1016\/j.jde.2016.08.020","article-title":"Fast convex optimization via inertial dynamics with hessian driven damping","volume":"261","author":"Attouch","year":"2016","journal-title":"Journal of Differential Equations"},{"key":"10.1016\/j.ejor.2025.11.010_bib0011","first-page":"1","article-title":"Zeroth-order nonconvex stochastic optimization: Handling constraints, high dimensionality, and saddle points","volume":"22","author":"Balasubramanian","year":"2021","journal-title":"Foundations of Computational Mathematics"},{"key":"10.1016\/j.ejor.2025.11.010_bib0012","series-title":"First-order methods in optimization","author":"Beck","year":"2017"},{"issue":"11","key":"10.1016\/j.ejor.2025.11.010_bib0013","doi-asserted-by":"crossref","first-page":"2419","DOI":"10.1109\/TIP.2009.2028250","article-title":"Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems","volume":"18","author":"Beck","year":"2009","journal-title":"IEEE Transactions on Image Processing"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.010_bib0014","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","article-title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems","volume":"2","author":"Beck","year":"2009","journal-title":"SIAM Journal on Imaging Sciences"},{"key":"10.1016\/j.ejor.2025.11.010_bib0015","unstructured":"Bubeck, S., Lee, Y. T., & Singh, M. (2015). A geometric alternative to Nesterov\u2019s accelerated gradient descent. arXiv: 1506.08187."},{"key":"10.1016\/j.ejor.2025.11.010_bib0016","series-title":"Calculus on normed vector spaces","author":"Coleman","year":"2012"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.010_bib0017","first-page":"25","article-title":"On the convergence of the iterates of\u201d FISTA\u201d","volume":"166","author":"Chambolle","year":"2015","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/j.ejor.2025.11.010_bib0018","unstructured":"Chen, S., Shi, B., & Yuan, Y.-x. (2022). Gradient norm minimization of Nesterov acceleration: o(1\/k3). arXiv: 2209.08862."},{"issue":"4","key":"10.1016\/j.ejor.2025.11.010_bib0019","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","article-title":"Signal recovery by proximal forward-backward splitting","volume":"4","author":"Combettes","year":"2005","journal-title":"Multiscale Modeling & Simulation"},{"key":"10.1016\/j.ejor.2025.11.010_bib0020","series-title":"Introduction to derivative-free optimization","author":"Conn","year":"2009"},{"issue":"11","key":"10.1016\/j.ejor.2025.11.010_bib0021","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1002\/cpa.20042","article-title":"An iterative thresholding algorithm for linear inverse problems with a sparsity constraint","volume":"57","author":"Daubechies","year":"2004","journal-title":"Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.010_bib0022","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1137\/18M1172314","article-title":"The approximate duality gap technique: A unified theory of first-order methods","volume":"29","author":"Diakonikolas","year":"2019","journal-title":"SIAM Journal on Optimization"},{"issue":"5","key":"10.1016\/j.ejor.2025.11.010_bib0023","doi-asserted-by":"crossref","first-page":"2788","DOI":"10.1109\/TIT.2015.2409256","article-title":"Optimal rates for zero-order convex optimization: The power of two function evaluations","volume":"61","author":"Duchi","year":"2015","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.010_bib0024","doi-asserted-by":"crossref","DOI":"10.1093\/imaiai\/iaad014","article-title":"Stochastic zeroth-order gradient and Hessian estimators: Variance reduction and refined bias bounds","volume":"12","author":"Feng","year":"2023","journal-title":"Information and Inference: A Journal of the IMA"},{"key":"10.1016\/j.ejor.2025.11.010_bib0025","unstructured":"Fisher, R. A. (1936). Iris. UCI Machine Learning Repository. 10.24432\/C56C76."},{"key":"10.1016\/j.ejor.2025.11.010_bib0026","series-title":"Annual conference computational learning theory","article-title":"From averaging to acceleration, there is only a step-size","author":"Flammarion","year":"2015"},{"key":"10.1016\/j.ejor.2025.11.010_bib0027","series-title":"Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms","first-page":"385","article-title":"Online convex optimization in the bandit setting: Gradient descent without a gradient","author":"Flaxman","year":"2005"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.010_bib0028","doi-asserted-by":"crossref","first-page":"2341","DOI":"10.1137\/120880811","article-title":"Stochastic first-and zeroth-order methods for nonconvex stochastic programming","volume":"23","author":"Ghadimi","year":"2013","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/j.ejor.2025.11.010_bib0029","series-title":"International conference on machine learning","first-page":"3100","article-title":"Improved zeroth-order variance reduced algorithms and analysis for nonconvex optimization","author":"Ji","year":"2019"},{"issue":"6245","key":"10.1016\/j.ejor.2025.11.010_bib0030","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1126\/science.aaa8415","article-title":"Machine learning: Trends, perspectives, and prospects","volume":"349","author":"Jordan","year":"2015","journal-title":"Science"},{"key":"10.1016\/j.ejor.2025.11.010_bib0031","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1214\/aoms\/1177729392","article-title":"Stochastic estimation of the maximum of a regression function","volume":"23","author":"Kiefer","year":"1952","journal-title":"The Annals of Mathematical Statistics"},{"key":"10.1016\/j.ejor.2025.11.010_bib0032","series-title":"Proceedings of the 28th international conference on neural information processing systems - volume 2","first-page":"2845","article-title":"Accelerated mirror descent in continuous and discrete time","author":"Krichene","year":"2015"},{"key":"10.1016\/j.ejor.2025.11.010_bib0033","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1017\/S0962492919000060","article-title":"Derivative-free optimization methods","volume":"28","author":"Larson","year":"2019","journal-title":"Acta Numerica"},{"issue":"254","key":"10.1016\/j.ejor.2025.11.010_bib0034","first-page":"10","article-title":"Cauchy and the gradient method","volume":"251","author":"Lemar\u00e9chal","year":"2012","journal-title":"Doc Math Extra"},{"key":"10.1016\/j.ejor.2025.11.010_bib0035","series-title":"Optimal control","author":"Lewis","year":"2012"},{"key":"10.1016\/j.ejor.2025.11.010_bib0036","first-page":"379","article-title":"Accelerated proximal gradient methods for nonconvex programming","volume":"28","author":"Li","year":"2015","journal-title":"Advances in Neural Information Processing Systems"},{"key":"10.1016\/j.ejor.2025.11.010_bib0037","series-title":"International conference on machine learning","first-page":"2111","article-title":"Convergence analysis of proximal gradient with momentum for nonconvex optimization","author":"Li","year":"2017"},{"key":"10.1016\/j.ejor.2025.11.010_bib0038","series-title":"Proceedings of the 34th international conference on machine learning","first-page":"2111","article-title":"Convergence analysis of proximal gradient with momentum for nonconvex optimization","volume":"vol. 70","author":"Li","year":"2017"},{"key":"10.1016\/j.ejor.2025.11.010_bib0039","series-title":"International conference on artificial intelligence and statistics","first-page":"288","article-title":"Zeroth-order online alternating direction method of multipliers: Convergence analysis and applications","author":"Liu","year":"2018"},{"issue":"5","key":"10.1016\/j.ejor.2025.11.010_bib0040","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MSP.2020.3003837","article-title":"A primer on zeroth-order optimization in signal processing and machine learning: Principals, recent advances, and applications","volume":"37","author":"Liu","year":"2020","journal-title":"IEEE Signal Processing Magazine"},{"key":"10.1016\/j.ejor.2025.11.010_bib0041","series-title":"Thirty-seventh conference on neural information processing systems","article-title":"Fine-tuning language models with just forward passes","author":"Malladi","year":"2023"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.010_bib0042","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1137\/070704277","article-title":"Robust stochastic approximation approach to stochastic programming","volume":"19","author":"Nemirovski","year":"2009","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/j.ejor.2025.11.010_bib0043","series-title":"Problem complexity and method efficiency in optimization","author":"Nemirovsky","year":"1983"},{"key":"10.1016\/j.ejor.2025.11.010_bib0044","series-title":"Doklady akademii nauk","first-page":"543","article-title":"A method of solving a convex programming problem with convergence rate o(k\u22122)","volume":"vol. 269","author":"Nesterov","year":"1983"},{"key":"10.1016\/j.ejor.2025.11.010_bib0045","series-title":"Introductory lectures on convex optimization: A basic course","author":"Nesterov","year":"2003"},{"key":"10.1016\/j.ejor.2025.11.010_bib0046","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","article-title":"Smooth minimization of non-smooth functions","volume":"103","author":"Nesterov","year":"2005","journal-title":"Mathematical programming"},{"key":"10.1016\/j.ejor.2025.11.010_bib0047","series-title":"Technical Report","article-title":"Random gradient-free minimization of convex functions","author":"Nesterov","year":"2011"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.010_bib0048","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","article-title":"Gradient methods for minimizing composite functions","volume":"140","author":"Nesterov","year":"2013","journal-title":"Mathematical Programming"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.010_bib0049","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s10208-015-9296-2","article-title":"Random gradient-free minimization of convex functions","volume":"17","author":"Nesterov","year":"2017","journal-title":"Foundations of Computational Mathematics"},{"key":"10.1016\/j.ejor.2025.11.010_bib0050","series-title":"Lectures on convex optimization","author":"Nesterov","year":"2018"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.010_bib0051","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s10208-015-9296-2","article-title":"Random gradient-free minimization of convex functions","volume":"17","author":"Nesterov","year":"2017","journal-title":"Foundations of Computational Mathematics"},{"key":"10.1016\/j.ejor.2025.11.010_bib0052","series-title":"Introduction to signal processing","author":"Orfanidis","year":"1995"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.010_bib0053","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1561\/2400000003","article-title":"Proximal algorithms","volume":"1","author":"Parikh","year":"2014","journal-title":"Foundations and trends\u00ae in Optimization"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.010_bib0054","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s10107-012-0573-4","article-title":"Introduction to convex optimization in financial markets","volume":"134","author":"Pennanen","year":"2012","journal-title":"Mathematical Programming"},{"issue":"5","key":"10.1016\/j.ejor.2025.11.010_bib0055","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","article-title":"Some methods of speeding up the convergence of iteration methods","volume":"4","author":"Polyak","year":"1964","journal-title":"Ussr Computational Mathematics & Mathematical Physics"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.010_bib0056","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1016\/j.ejor.2005.06.076","article-title":"Newton\u2019s method and its use in optimization","volume":"181","author":"Polyak","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.11.010_bib0057","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1214\/aoms\/1177729586","article-title":"A stochastic approximation method","volume":"22","author":"Robbins","year":"1951","journal-title":"The Annals of Mathematical Statistics"},{"key":"10.1016\/j.ejor.2025.11.010_bib0058","series-title":"Variational analysis","author":"Rockafellar","year":"1998"},{"issue":"3-4","key":"10.1016\/j.ejor.2025.11.010_bib0059","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1080\/01630560008816971","article-title":"A dynamical systems approach to constrained minimization","volume":"21","author":"Schropp","year":"2000","journal-title":"Numerical Functional Analysis and Optimization"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.010_bib0060","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1109\/JPROC.2015.2494218","article-title":"Taking the human out of the loop: A review of bayesian optimization","volume":"104","author":"Shahriari","year":"2015","journal-title":"Proceedings of the IEEE"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.010_bib0061","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10107-021-01681-8","article-title":"Understanding the acceleration phenomenon via high-resolution differential equations","volume":"195","author":"Shi","year":"2022","journal-title":"Mathematical Programming"},{"issue":"6","key":"10.1016\/j.ejor.2025.11.010_bib0062","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/2.294849","article-title":"Genetic algorithms: A survey","volume":"27","author":"Srinivas","year":"1994","journal-title":"Computer"},{"issue":"153","key":"10.1016\/j.ejor.2025.11.010_bib0063","first-page":"1","article-title":"A differential equation for modeling Nesterov\u2019s accelerated gradient method: Theory and insights","volume":"17","author":"Su","year":"2016","journal-title":"Journal of Machine Learning Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.010_bib0064","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1093\/imaiai\/iaac027","article-title":"On sharp stochastic zeroth-order Hessian estimators over Riemannian manifolds","volume":"12","author":"Wang","year":"2022","journal-title":"Information and Inference: A Journal of the IMA"},{"key":"10.1016\/j.ejor.2025.11.010_bib0065","series-title":"International conference on artificial intelligence and statistics","first-page":"1356","article-title":"Stochastic zeroth-order optimization in high dimensions","author":"Wang","year":"2018"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.010_bib0066","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1007\/s10898-022-01160-0","article-title":"Zeroth-order algorithms for nonconvex\u2013strongly-concave minimax problems with improved complexities","volume":"87","author":"Wang","year":"2023","journal-title":"Journal of Global Optimization"},{"issue":"47","key":"10.1016\/j.ejor.2025.11.010_bib0067","doi-asserted-by":"crossref","first-page":"E7351","DOI":"10.1073\/pnas.1614734113","article-title":"A variational perspective on accelerated methods in optimization","volume":"113","author":"Wibisono","year":"2016","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"113","key":"10.1016\/j.ejor.2025.11.010_bib0068","first-page":"1","article-title":"A lyapunov analysis of accelerated methods in optimization","volume":"22","author":"Wilson","year":"2021","journal-title":"Journal of Machine Learning Research"},{"key":"10.1016\/j.ejor.2025.11.010_bib0069","series-title":"The thirty sixth annual conference on learning theory","first-page":"4429","article-title":"Zeroth-order optimization with weak dimension dependency","author":"Yue","year":"2023"},{"key":"10.1016\/j.ejor.2025.11.010_bib0070","series-title":"Advances in neural information processing systems","article-title":"Direct Runge-Kutta discretization achieves acceleration","volume":"vol. 31","author":"Zhang","year":"2018"},{"key":"10.1016\/j.ejor.2025.11.010_bib0071","series-title":"Proceedings of the 41st international conference on machine learning","article-title":"Revisiting zeroth-order optimization for memory-efficient LLM fine-tuning: A benchmark","author":"Zhang","year":"2025"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725009038?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725009038?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T23:26:47Z","timestamp":1781825207000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221725009038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":71,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,11]]}},"alternative-id":["S0377221725009038"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2025.11.010","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The Nesterov\u2013Spokoiny acceleration achieves strict o(1\/k2) convergence","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2025.11.010","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}