{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:41:23Z","timestamp":1775018483696,"version":"3.50.1"},"reference-count":20,"publisher":"Pleiades Publishing Ltd","issue":"6","license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1134\/s0361768823060038","type":"journal-article","created":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T07:02:57Z","timestamp":1701414177000},"page":"493-504","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Adaptive Variant of the Frank\u2013Wolfe Algorithm for Convex Optimization Problems"],"prefix":"10.1134","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-2625-9332","authenticated-orcid":false,"given":"G. V.","family":"Aivazian","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9250-4438","authenticated-orcid":false,"given":"F. S.","family":"Stonyakin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1208-1659","authenticated-orcid":false,"given":"D. A.","family":"Pasechnyk","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5470-0182","authenticated-orcid":false,"given":"M. S.","family":"Alkousa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8614-9612","authenticated-orcid":false,"given":"A. M.","family":"Raigorodsky","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2904-1979","authenticated-orcid":false,"given":"I. V.","family":"Baran","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2023,12,1]]},"reference":[{"key":"3764_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1137\/0306032","volume":"6","author":"M.D. Canon","year":"1968","unstructured":"Canon, M.D. and Cullum, C.D., A tight upper bound on the rate of convergence of Frank\u2013Wolfe algorithm, SIAM J. Control, 1968, vol. 6, no. 4, pp. 509\u2013516.","journal-title":"SIAM J. Control"},{"key":"3764_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10288-021-00493-y","volume":"19","author":"I.M. Bomze","year":"2021","unstructured":"Bomze, I.M., Rinaldi, F., and Zeffiro, D., Frank\u2013Wolfe and friends: A journey into projection-free first-order optimization methods, 4OR-Q. J. \n               Oper. Res., 2021, vol. 19, pp. 313\u2013345.","journal-title":"Oper. Res."},{"key":"3764_CR3","unstructured":"Braun, G., Carderera, A., Combettes, C.W., Hassani, H., Karbasi, A., Mokhtari, A., and Pokutta, S., Conditional gradient methods. \nhttps:\/\/arxiv.org\/pdf\/2211.14103.pdf."},{"key":"3764_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10107-017-1188-6","volume":"171","author":"Y. Nesterov","year":"2018","unstructured":"Nesterov, Y., Complexity bounds for primal-dual methods minimizing the model of objective function, Math. Program., 2018, vol. 171, nos. 1\u20132, pp. 311\u2013330.","journal-title":"Math. Program."},{"key":"3764_CR5","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Y. Nesterov","year":"2015","unstructured":"Nesterov, Y., Universal gradient methods for convex optimization problems, Math. Program., 2015, vol. 152, pp. 381\u2013404.","journal-title":"Math. Program."},{"key":"3764_CR6","unstructured":"Pedregosa, F., Negiar, G., Askari, A., and Jaggi, M., Linearly convergent Frank\u2013Wolfe with backtracking line-search, Proc. Int. Conf. Artificial Intelligence and Statistics, 2020, pp. 1\u201310."},{"key":"3764_CR7","unstructured":"Polyak, B.T., Gradient methods for minimizing functionals, Zh. Vychisl. Mat. Mat. Fiz., 1963, pp. 643\u2013653."},{"key":"3764_CR8","volume-title":"A topological property of real analytic subsets","author":"S. \u0141ojasiewicz","year":"1963","unstructured":"\u0141ojasiewicz, S., A topological property of real analytic subsets, Coll. du CNRS, 1963, pp. 87\u201389."},{"key":"3764_CR9","doi-asserted-by":"crossref","unstructured":"Karimi, H., Nutini, J., and Schmidt, M., Linear convergence of gradient and proximal-gradient methods under the Polyak\u2013\u0141ojasiewicz condition, Proc Eur. Conf. Machine Learning and Knowledge Discovery in Databases (ECML PKDD), Riva del Garda, Italy, 2016, pp.\u00a0795\u2013811.","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"3764_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/15M104726X","volume":"27","author":"R.M. Freund","year":"2017","unstructured":"Freund, R.M., Grigas, P., and Mazumder, R., An extended Frank\u2013Wolfe method within face directions, and its application to low-rank matrix completion, SIAM J. Optim., 2017, vol. 27, no. 1, pp. 319\u2013346.","journal-title":"SIAM J. Optim."},{"key":"3764_CR11","unstructured":"100\u2009000 ratings and 3600 tag applications applied to 9000 movies by 600 users, Last updated September, 2018. https:\/\/grouplens.org\/datasets\/movielens."},{"key":"3764_CR12","volume-title":"The Nature of Statistical Learning Theory","author":"V. Vapnik","year":"2013","unstructured":"Vapnik, V., The Nature of Statistical Learning Theory, Springer, 2013."},{"key":"3764_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1824777.1824783","volume":"6","author":"K.L. Clarkson","year":"2010","unstructured":"Clarkson, K.L., Coresets, sparse greedy approximation, and the Frank\u2013Wolfe algorithm, ACM Trans. Algorithms, 2010, vol. 6, no. 4, pp. 1\u201330.","journal-title":"ACM Trans. Algorithms"},{"key":"3764_CR14","unstructured":"Pima Indians Diabetes database. https:\/\/www.kaggle.com\/datasets\/uciml\/pima-indians-diabetes-database."},{"key":"3764_CR15","volume-title":"Theory of Linear Ill-Posed Problems and Its Applications","author":"V.K. Ivanov","year":"2013","unstructured":"Ivanov, V.K., Vasin, V.V., and Tanana, V.P., Theory of Linear Ill-Posed Problems and Its Applications, Walter de Gruyter, 2013."},{"key":"3764_CR16","unstructured":"LIBSVM data: Classification (binary class). https:\/\/www.csie.ntu.edu.tw\/cjlin\/libsvmtools\/datasets\/binary.html."},{"key":"3764_CR17","first-page":"787","volume":"6","author":"E.S. Levitin","year":"1966","unstructured":"Levitin, E.S. and Polyak, B.T., Constrained minimization methods, Zh. Vychisl. Mat. Mat. Fiz., 1966, vol. 6, no. 5, pp. 787\u2013823.","journal-title":"Zh. Vychisl. Mat. Mat. Fiz."},{"key":"3764_CR18","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"E.J. Candes","year":"2009","unstructured":"Candes, E.J. and Recht, B., Exact matrix completion via convex optimization, Found. Comput. Math., 2009, vol. 9, no. 6, pp. 717\u2013772.","journal-title":"Found. Comput. Math."},{"key":"3764_CR19","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/j.orl.2021.06.005","volume":"49","author":"C.W. Combettes","year":"2021","unstructured":"Combettes, C.W. and Pokutta, S., Complexity of linear minimization and projection on some sets, Oper. Res. Lett., 2021, vol. 49, no. 4, pp. 565\u2013571.","journal-title":"Oper. Res. Lett."},{"key":"3764_CR20","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M. Frank","year":"1956","unstructured":"Frank, M. and Wolfe, P., An algorithm for quadratic programming, Nav. Res. Logist. Q., 1956, vol. 3, nos. 1\u20132, pp.\u00a095\u2013110.","journal-title":"Nav. Res. Logist. Q."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768823060038.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768823060038","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768823060038.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:52:48Z","timestamp":1775011968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768823060038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["3764"],"URL":"https:\/\/doi.org\/10.1134\/s0361768823060038","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12]]},"assertion":[{"value":"13 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}