{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T09:21:22Z","timestamp":1777368082372,"version":"3.51.4"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,1,30]],"date-time":"2022-01-30T00:00:00Z","timestamp":1643500800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,30]],"date-time":"2022-01-30T00:00:00Z","timestamp":1643500800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10957-021-01989-7","type":"journal-article","created":{"date-parts":[[2022,1,30]],"date-time":"2022-01-30T21:03:11Z","timestamp":1643576591000},"page":"799-829","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Restarting Frank\u2013Wolfe: Faster Rates under H\u00f6lderian Error Bounds"],"prefix":"10.1007","volume":"192","author":[{"given":"Thomas","family":"Kerdreux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"d\u2019Aspremont","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Pokutta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,30]]},"reference":[{"issue":"2","key":"1989_CR1","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the Kurdyka\u2013\u0141ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"1989_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973488","volume-title":"Variational Analysis in Sobolev and BV Spaces: Applications to PDEs and oPtimization","author":"H Attouch","year":"2014","unstructured":"Attouch, H., Buttazzo, G., Michaille, G.: Variational Analysis in Sobolev and BV Spaces: Applications to PDEs and oPtimization, vol. 17. SIAM, Philadelphia (2014)"},{"key":"1989_CR3","unstructured":"Bashiri, M.A., Zhang, X.: Decomposition-invariant conditional gradient for general polytopes with line search. In: Guyon, I., et al. (eds.) Advances in Neural Information Processing Systems, pp. 2687\u20132697 (2017)"},{"issue":"2","key":"1989_CR4","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/moor.2016.0817","volume":"42","author":"HH Bauschke","year":"2016","unstructured":"Bauschke, H.H., Bolte, J., Teboulle, M.: A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications. Math. Oper. Res. 42(2), 330\u2013348 (2016)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"1989_CR5","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17(4), 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1989_CR6","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10107-016-1091-6","volume":"165","author":"J Bolte","year":"2017","unstructured":"Bolte, J., Nguyen, T.P., Peypouquet, J., Suter, B.W.: From error bounds to the complexity of first-order descent methods for convex functions. Math. Program. 165(2), 471\u2013507 (2017)","journal-title":"Math. Program."},{"key":"1989_CR7","unstructured":"Braun, G., Pokutta, S., Zink, D.: Lazifying conditional gradient algorithms. In: Precup, D., Teh, Y.W. (eds.) International Conference on Machine Learning, pp. 566\u2013575 (2017)"},{"key":"1989_CR8","unstructured":"Braun, G., Pokutta, S., Tu, D., Wright, S.: Blended conditonal gradients. In: Chaudhuri, K., Salakhutdinov, R. (eds.) International Conference on Machine Learning, pp. 735\u2013743 (2019)"},{"issue":"4","key":"1989_CR9","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1137\/0306032","volume":"6","author":"MD Canon","year":"1968","unstructured":"Canon, M.D., Cullum, C.D.: A tight upper bound on the rate of convergence of Frank\u2013Wolfe algorithm. SIAM J. Control 6(4), 509\u2013516 (1968)","journal-title":"SIAM J. Control"},{"key":"1989_CR10","unstructured":"Chen, Z., Xu, Y., Chen, E., Yang, T.: Sadagrad: strongly adaptive stochastic gradient methods. In: Dy, J., Krause, A. (eds.) International Conference on Machine Learning, pp. 912\u2013920 (2018)"},{"key":"1989_CR11","unstructured":"Combettes, C., Pokutta, S.: Boosting Frank\u2013Wolfe by chasing gradients. In: Daum\u00e9, H. III, Singh, A. (eds.) International Conference on Machine Learning, pp. 2111\u20132121 (2020)"},{"key":"1989_CR12","unstructured":"Diakonikolas, J., Carderera, A., Pokutta, S.: Locally accelerated conditional gradients. In: Chiappa, S., Calandra, R. (eds.) International Conference on Artificial Intelligence and Statistics, pp. 1737\u20131747 (2020)"},{"key":"1989_CR13","unstructured":"Fercoq, O., Qu, Z.: Restarting accelerated gradient methods with a rough strong convexity estimate. arXiv preprint arXiv:1609.07358 (2016)"},{"issue":"1\u20132","key":"1989_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Res. Logist. Q. 3(1\u20132), 95\u2013110 (1956)","journal-title":"Naval Res. Logist. Q."},{"issue":"3","key":"1989_CR15","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1007\/s10957-014-0642-3","volume":"165","author":"P Frankel","year":"2015","unstructured":"Frankel, P., Garrigos, G., Peypouquet, J.: Splitting methods with variable metric for Kurdyka\u2013\u0141ojasiewicz functions and general convergence rates. J. Optim. Theory Appl. 165(3), 874\u2013900 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1989_CR16","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10107-014-0841-6","volume":"155","author":"RM Freund","year":"2016","unstructured":"Freund, R.M., Grigas, P.: New analysis and results for the Frank\u2013Wolfe method. Math. Program. 155(1), 199\u2013230 (2016)","journal-title":"Math. Program."},{"key":"1989_CR17","doi-asserted-by":"crossref","unstructured":"Freund, R.M., Grigas, P., Mazumder, R.: An extended Frank\u2013Wolfe method with \u201cin-face\u201d directions, and its application to low-rank matrix completion. SIAM J. Optim. 27(1), 319\u2013346 (2017)","DOI":"10.1137\/15M104726X"},{"key":"1989_CR18","unstructured":"Garber, D., Hazan, E.: Faster rates for the Frank\u2013Wolfe method over strongly-convex sets. In: Bach, F., Blei, D. (eds.) Proceedings of the 32th International Conference on Machine Learning (2015)"},{"issue":"3","key":"1989_CR19","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1137\/140985366","volume":"26","author":"D Garber","year":"2016","unstructured":"Garber, D., Hazan, E.: A linearly convergent variant of the conditional gradient algorithm under strong convexity, with applications to online and stochastic optimization. SIAM J. Optim. 26(3), 1493\u20131528 (2016)","journal-title":"SIAM J. Optim."},{"key":"1989_CR20","unstructured":"Garber, D., Meshi, O.: Linear-memory and decomposition-invariant linearly convergent conditional gradient algorithm for structured polytopes. In: Lee, D., Sugiyama, M., Luxburg, U., Guyon, I., Garnett, R. (eds.) Advances in Neural Information Processing Systems (2016)"},{"key":"1989_CR21","doi-asserted-by":"crossref","unstructured":"Giselsson, P., Boyd, S.: Monotonicity and restart in fast gradient methods. In: 53rd IEEE Conference on Decision and Control, pp. 5058\u20135063. IEEE (2014)","DOI":"10.1109\/CDC.2014.7040179"},{"key":"1989_CR22","doi-asserted-by":"crossref","unstructured":"Gu\u00e9lat, J., Marcotte, P.: Some comments on Wolfe\u2019s \u2018away step\u2019. Math. Program. 35(1), 110\u2013119 (1986)","DOI":"10.1007\/BF01589445"},{"key":"1989_CR23","doi-asserted-by":"crossref","unstructured":"Hoffman, A.J.: On approximate solutions of systems of linear inequalities. J. Res. Natl. Bur. Stand. 49(4) (1952)","DOI":"10.6028\/jres.049.027"},{"key":"1989_CR24","unstructured":"Jaggi, M.: Revisiting Frank\u2013Wolfe: projection-free sparse convex optimization. In: Dasgupta, S., McAllester, D. (eds.) Proceedings of the 30th international conference on machine learning, pp. 427\u2013435 (2013)"},{"key":"1989_CR25","doi-asserted-by":"crossref","unstructured":"Joulin, A., Tang, K., Fei-Fei, L.: Efficient image and video co-localization with Frank\u2013Wolfe algorithm. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) European Conference on Computer Vision, pp. 253\u2013268. Springer (2014)","DOI":"10.1007\/978-3-319-10599-4_17"},{"key":"1989_CR26","doi-asserted-by":"crossref","unstructured":"Karimi, H., Nutini, J., Schmidt, M.: Linear convergence of gradient and proximal-gradient methods under the Polyak\u2013\u0141ojasiewicz condition. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 795\u2013811. Springer (2016)","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"1989_CR27","unstructured":"Kerdreux, T., Pedregosa, F., d\u2019Aspremont, A.: Frank\u2013Wolfe with subsampling oracle. In: Dy, J., Krause, A. (eds.) International Conference on Machine Learning, pp. 2591\u20132600 (2018)"},{"key":"1989_CR28","unstructured":"Kerdreux, T., d\u2019Aspremont, A., Pokutta, S.: Restarting Frank\u2013Wolfe. In: Chaudhuri, K., Sugiyama, M. (eds.) The 22nd International Conference on Artificial Intelligence and Statistics, pp. 1275\u20131283 (2019)"},{"key":"1989_CR29","unstructured":"Kerdreux, T., d\u2019Aspremont, A., Pokutta, S.: Projection-free optimization on uniformly convex sets. In: International Conference on Artificial Intelligence and Statistics, pp. 19\u201327 (2021)"},{"key":"1989_CR30","unstructured":"Lacoste-Julien, S., Jaggi, M.: On the global linear convergence of Frank\u2013Wolfe optimization variants. In: Cortes, C., Lawrence, N., Lee, D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 28, pp. 496\u2013504 (2015)"},{"key":"1989_CR31","unstructured":"Lacoste-Julien, S., Jaggi, M., Schmidt, M., Pletscher, P.: Block-coordinate Frank\u2013Wolfe optimization for structural SVMs. In: Dasgupta, S., McAllester, D. (eds.) International Conference on Machine Learning, pp. 53\u201361 (2013)"},{"issue":"2","key":"1989_CR32","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1137\/140992382","volume":"26","author":"G Lan","year":"2016","unstructured":"Lan, G., Zhou, Y.: Conditional gradient sliding for convex optimization. SIAM J. Optim. 26(2), 1379\u20131409 (2016)","journal-title":"SIAM J. Optim."},{"key":"1989_CR33","unstructured":"Lan, G., Pokutta, S., Zhou, Y., Zink, D.: Conditional accelerated lazy stochastic gradient descent. In: Precup, D., Teh, Y.W. (eds.) International Conference on Machine Learning, pp. 1965\u20131974 (2017)"},{"issue":"5","key":"1989_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"ES Levitin","year":"1966","unstructured":"Levitin, E.S., Polyak, B.T.: Constrained minimization methods. USSR Comput. Math. Math. Phys. 6(5), 1\u201350 (1966)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"5","key":"1989_CR35","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1007\/s10208-017-9366-8","volume":"18","author":"G Li","year":"2018","unstructured":"Li, G., Pong, T.K.: Calculus of the exponent of Kurdyka\u2013\u0141ojasiewicz inequality and its applications to linear convergence of first-order methods. Found. Comput. Math. 18(5), 1199\u20131232 (2018)","journal-title":"Found. Comput. Math."},{"key":"1989_CR36","unstructured":"Locatello, F., Khanna, R., Tschannen, M., Jaggi, M.: A unified optimization view on generalized matching pursuit and Frank\u2013Wolfe. In: Singh, A., Zhu, J. (eds.) Artificial Intelligence and Statistics, pp. 860\u2013868 (2017)"},{"key":"1989_CR37","unstructured":"Locatello, F., Tschannen, M., R\u00e4tsch, G., Jaggi, M.: Greedy algorithms for cone constrained optimization with convergence guarantees. In: Guyon, I., et al. (eds.) Advances in Neural Information Processing Systems, pp. 773\u2013784 (2017)"},{"key":"1989_CR38","unstructured":"Lojasiewicz, S.: Ensembles semi-analytiques. Institut des Hautes \u00c9tudes Scientifiques (1965)"},{"issue":"5","key":"1989_CR39","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.5802\/aif.1384","volume":"43","author":"S Lojasiewicz","year":"1993","unstructured":"Lojasiewicz, S.: Sur la g\u00e9om\u00e9trie semi-et sous-analytique. Ann. Inst. Fourier 43(5), 1575\u20131595 (1993)","journal-title":"Ann. Inst. Fourier"},{"key":"1989_CR40","doi-asserted-by":"crossref","unstructured":"Miech, A., Alayrac, J.-B., Bojanowski, P., Laptev, I., Sivic, J.: Learning from video and text via large-scale discriminative clustering. In: 2017 IEEE International Conference on Computer Vision (ICCV), pp. 5267\u20135276. IEEE (2017)","DOI":"10.1109\/ICCV.2017.562"},{"issue":"2","key":"1989_CR41","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0041-5553(85)90100-4","volume":"25","author":"A Nemirovskii","year":"1985","unstructured":"Nemirovskii, A., Nesterov, Y.E.: Optimal methods of smooth convex minimization. USSR Comput. Math. Math. Phys. 25(2), 21\u201330 (1985)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"3","key":"1989_CR42","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","volume":"15","author":"B O\u2019Donoghue","year":"2015","unstructured":"O\u2019Donoghue, B., Candes, E.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. 15(3), 715\u2013732 (2015)","journal-title":"Found. Comput. Math."},{"key":"1989_CR43","unstructured":"Osokin, A., Alayrac, J.-B., Lukasewitz, I., Dokania, P.K., Lacoste-Julien, S.: Minding the gaps for block Frank\u2013Wolfe optimization of structured SVMs. In: Balcan, M.F., Weinberger, K.Q. (eds.) International Conference on Machine Learning (2016)"},{"key":"1989_CR44","first-page":"1","volume":"44","author":"J Pena","year":"2018","unstructured":"Pena, J., Rodriguez, D.: Polytope conditioning and linear convergence of the Frank\u2013Wolfe algorithm. Math. Oper. Res. 44, 1\u201318 (2018)","journal-title":"Math. Oper. Res."},{"key":"1989_CR45","doi-asserted-by":"crossref","unstructured":"Roulet, V., d\u2019Aspremont, A.: Sharpness, restart, and acceleration. SIAM J. Optim. 30(1), 262\u2013289 (2020)","DOI":"10.1137\/18M1224568"},{"key":"1989_CR46","doi-asserted-by":"crossref","unstructured":"Shah, N., Kolmogorov, V., Lampert, C.H.: A multi-plane block-coordinate Frank\u2013Wolfe algorithm for training structural SVMs with a costly max-oracle. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2737\u20132745 (2015)","DOI":"10.1109\/CVPR.2015.7298890"},{"key":"1989_CR47","unstructured":"Xu, Y., Yang, T.: Frank\u2013Wolfe method is automatically adaptive to error bound condition. arXiv:1810.04765 (2018)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01989-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-021-01989-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01989-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,11]],"date-time":"2022-03-11T17:09:26Z","timestamp":1647018566000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-021-01989-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,30]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1989"],"URL":"https:\/\/doi.org\/10.1007\/s10957-021-01989-7","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,30]]},"assertion":[{"value":"10 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}