{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T02:38:00Z","timestamp":1773801480285,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T00:00:00Z","timestamp":1690416000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T00:00:00Z","timestamp":1690416000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100020409","name":"Analytical Center for the Government of the Russian Federation","doi-asserted-by":"publisher","award":["000000D730321P5Q0002"],"award-info":[{"award-number":["000000D730321P5Q0002"]}],"id":[{"id":"10.13039\/100020409","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100020409","name":"Analytical Center for the Government of the Russian Federation","doi-asserted-by":"publisher","award":["000000D730321P5Q0002"],"award-info":[{"award-number":["000000D730321P5Q0002"]}],"id":[{"id":"10.13039\/100020409","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100020409","name":"Analytical Center for the Government of the Russian Federation","doi-asserted-by":"publisher","award":["000000D730321P5Q0002"],"award-info":[{"award-number":["000000D730321P5Q0002"]}],"id":[{"id":"10.13039\/100020409","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10287-023-00468-w","type":"journal-article","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T07:02:31Z","timestamp":1690441351000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Accelerated methods for weakly-quasi-convex optimization problems"],"prefix":"10.1007","volume":"20","author":[{"given":"Sergey","family":"Guminov","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[]},{"given":"Ilya","family":"Kuruzov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,27]]},"reference":[{"key":"468_CR1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2450.001.0001","volume-title":"Discrete choice theory of product differentiation","author":"SP Anderson","year":"1992","unstructured":"Anderson SP, De Palma A, Thisse J-F (1992) Discrete choice theory of product differentiation. MIT press"},{"issue":"4","key":"468_CR2","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1137\/S1052623499359178","volume":"10","author":"M Anitescu","year":"2000","unstructured":"Anitescu M (2000) Degenerate nonlinear programming with a quadratic growth condition. SIAM J Optim 10(4):1116\u20131135","journal-title":"SIAM J Optim"},{"key":"468_CR3","unstructured":"Barr\u00e9 M, Taylor A, d\u2019Aspremont A (2020) Complexity guarantees for polyak steps with momentum. In: Conference on learning theory, pp. 452\u2013478. PMLR"},{"issue":"2","key":"468_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.20537\/2076-7633-2022-14-2-239-255","volume":"14","author":"AI Bazarova","year":"2022","unstructured":"Bazarova AI, Beznosikov AN, Gasnikov AV (2022) Linearly convergent gradient-free methods for minimization of parabolic approximation. Comput Res Model 14(2):239\u2013255. https:\/\/doi.org\/10.20537\/2076-7633-2022-14-2-239-255","journal-title":"Comput Res Model"},{"issue":"4","key":"468_CR5","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1287\/moor.20.4.801","volume":"20","author":"JF Bonnans","year":"1995","unstructured":"Bonnans JF, Ioffe A (1995) Second-order sufficiency and quadratic growth for nonisolated minima. Math Oper Res 20(4):801\u2013817","journal-title":"Math Oper Res"},{"issue":"3\u20134","key":"468_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1561\/2200000050","volume":"8","author":"S Bubeck","year":"2015","unstructured":"Bubeck S et al (2015) Convex optimization: algorithms and complexity. Found Trends Mach Learn 8(3\u20134):231\u2013357","journal-title":"Found Trends Mach Learn"},{"key":"468_CR7","unstructured":"Bu J, Mesbahi M (2020) A note on nesterov\u2019s accelerated method in nonconvex optimization: a weak estimate sequence approach. arXiv preprint arXiv:2006.08548"},{"key":"468_CR8","unstructured":"Csiba D, Richt\u00e1rik P (2017) Global convergence of arbitrary-block gradient methods for generalized polyak-\u0141ojasiewicz functions. arXiv preprint arXiv:1709.03014"},{"key":"468_CR9","unstructured":"Danilova M, Dvurechensky P, Gasnikov A, Gorbunov E, Guminov S, Kamzolov D, Shibaev I. Recent theoretical advances in non-convex optimization. arXiv preprint  arXiv:2012.06188"},{"key":"468_CR10","doi-asserted-by":"crossref","unstructured":"d\u2019Aspremont A, Scieur D, Taylor A (2021) Acceleration methods. arXiv preprint arXiv:2101.09545","DOI":"10.1561\/9781680839296"},{"issue":"1","key":"468_CR11","first-page":"2909","volume":"17","author":"S Diamond","year":"2016","unstructured":"Diamond S, Boyd S (2016) Cvxpy: a python-embedded modeling language for convex optimization. J Mach Learn Res 17(1):2909\u20132913","journal-title":"J Mach Learn Res"},{"key":"468_CR12","doi-asserted-by":"crossref","unstructured":"Fatkhullin I, Polyak B. Optimizing static linear feedback: gradient method. SIAM J Controlled Optim 59(5):3887\u20133991","DOI":"10.1137\/20M1329858"},{"key":"468_CR13","unstructured":"Gasnikov A (2017) Universal gradient descent. arXiv preprint arXiv:1711.00394"},{"key":"468_CR14","unstructured":"Ge R, Lee JD, Ma T (2016) Matrix completion has no spurious local minimum. arXiv preprint arXiv:1605.07272"},{"key":"468_CR15","unstructured":"Gower R, Sebbouh O, Loizou N (2020) Sgd for structured nonconvex functions: Learning rates, minibatching and interpolation. arXiv preprint arXiv:2006.10311"},{"key":"468_CR16","unstructured":"Hardt M, Ma T, Recht B (2016) Gradient descent learns linear dynamical systems. arXiv preprint arXiv:1609.05191"},{"key":"468_CR17","unstructured":"Hinder O, Sidford A, Sohoni N (2020) Near-optimal methods for minimizing star-convex functions and beyond. In: Conference on learning theory. PMLR. pp. 1894\u20131938"},{"key":"468_CR18","doi-asserted-by":"publisher","unstructured":"Karimi H, Nutini J, Schmidt M (2016) Linear convergence of gradient and proximal-gradient methods under the polyak-\u0141ojasiewicz condition. In: European conference on machine learning and knowledge discovery in databases. Volume 9851. ECML PKDD 2016, pp. 795\u2013811. Springer, New York, NY, USA. https:\/\/doi.org\/10.1007\/978-3-319-46128-1_50","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"468_CR19","unstructured":"Kleinberg R, Li Y, Yuan Y (2018) An alternative view: when does sgd escape local minima? International conference on machine learning (ICML), 2698\u20132707"},{"key":"468_CR20","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-030-92711-0_2","volume-title":"Advances in optimization and applications","author":"I Kuruzov","year":"2021","unstructured":"Kuruzov I, Stonyakin F (2021) Sequential subspace optimization for quasar-convex optimization problems with inexact gradient. Advances in optimization and applications. Springer, Cham, pp 19\u201333"},{"key":"468_CR21","unstructured":"Narkiss G, Zibulevsky M (2005) Sequential subspace optimization method for large-scale unconstrained problems. Technical report. Technion-The Israel Institute of Technology, Department of Electrical Engineering"},{"key":"468_CR22","volume-title":"Problem complexity and optimization method efficiency","author":"AS Nemirovsky","year":"1979","unstructured":"Nemirovsky AS, Yudin DB (1979) Problem complexity and optimization method efficiency. Nauka, Moscow ([in Russian])"},{"issue":"1","key":"468_CR23","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Y Nesterov","year":"2006","unstructured":"Nesterov Y, Polyak BT (2006) Cubic regularization of newton method and its global performance. Math Program. 108(1):177\u2013205","journal-title":"Math Program."},{"key":"468_CR24","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2020.1731747","author":"Y Nesterov","year":"2020","unstructured":"Nesterov Y, Gasnikov A, Guminov S, Dvurechensky P (2020) Primal-dual accelerated gradient methods with small-dimensional relaxation oracle. Optim Methods Softw  https:\/\/doi.org\/10.1080\/10556788.2020.1731747","journal-title":"Optim Methods Softw"},{"issue":"5\u20136","key":"468_CR25","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1561\/2200000073","volume":"11","author":"G Peyr\u00e9","year":"2019","unstructured":"Peyr\u00e9 G, Cuturi M et al (2019) Computational optimal transport: with applications to data science. Found Trends Mach Learn 11(5\u20136):355\u2013607","journal-title":"Found Trends Mach Learn"},{"key":"468_CR26","doi-asserted-by":"publisher","unstructured":"Wang J-K, Wibisono A (2023) Continuized acceleration for quasar convex functions in non-convex optimization, https:\/\/doi.org\/10.48550\/arXiv.2302.07851","DOI":"10.48550\/arXiv.2302.07851"},{"key":"468_CR27","unstructured":"Zhou Y, Yang J, Zhang H, Liang Y, Tarokh V (2019) SGD converges to global minimum in deep learning via star-convex path. In: International conference on learning representations. https:\/\/openreview.net\/forum?id=BylIciRcYQ"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00468-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10287-023-00468-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00468-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T16:12:27Z","timestamp":1699632747000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10287-023-00468-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,27]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["468"],"URL":"https:\/\/doi.org\/10.1007\/s10287-023-00468-w","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,27]]},"assertion":[{"value":"16 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"36"}}