{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T21:02:00Z","timestamp":1782248520356,"version":"3.54.5"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T00:00:00Z","timestamp":1638230400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T00:00:00Z","timestamp":1638230400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1452463"],"award-info":[{"award-number":["CMMI-1452463"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["DFG Cluster of Excellence MATH+"],"award-info":[{"award-number":["DFG Cluster of Excellence MATH+"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10107-021-01735-x","type":"journal-article","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T19:23:45Z","timestamp":1638300225000},"page":"191-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Revisiting the approximate Carath\u00e9odory problem via the Frank-Wolfe algorithm"],"prefix":"10.1007","volume":"197","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4113-8869","authenticated-orcid":false,"given":"Cyrille W.","family":"Combettes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastian","family":"Pokutta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,11,30]]},"reference":[{"key":"1735_CR1","unstructured":"Argyriou, A., Signoretto, M., Suykens, J.A.K.: Hybrid conditional gradient-smoothing algorithms with applications to sparse and low rank regularization. In: Regularization, Optimization, Kernels, and Support Vector Machines, pp. 53\u201382. Chapman & Hall\/CRC, Florida (2014)"},{"issue":"2","key":"1735_CR2","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-\u0141ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1735_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137(1), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"1735_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1137\/130941961","volume":"25","author":"F Bach","year":"2015","unstructured":"Bach, F.: Duality between subgradient and conditional gradient methods. SIAM J. Optim. 25(1), 115\u2013129 (2015)","journal-title":"SIAM J. Optim."},{"key":"1735_CR5","doi-asserted-by":"crossref","unstructured":"Barman, S.: Approximating Nash equilibria and dense bipartite subgraphs via an approximate version of Carath\u00e9odory\u2019s theorem. In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing, pp. 361\u2013369 (2015)","DOI":"10.1145\/2746539.2746566"},{"key":"1735_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, New York (2017)","edition":"2"},{"issue":"2","key":"1735_CR7","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1137\/060670080","volume":"18","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A., Shiota, M.: Clarke subgradients of stratifiable functions. SIAM J. Optim. 18(2), 556\u2013572 (2007)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1735_CR8","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."},{"issue":"1\u20132","key":"1735_CR9","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1\u20132), 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"1735_CR10","doi-asserted-by":"crossref","unstructured":"Bourgain, J., Pajor, A., Szarek, S.J., Tomczak-Jaegermann, N.: On the duality problem for entropy numbers of operators. In: Geometric Aspects of Functional Analysis, pp. 50\u201363 . Springer, New York (1989)","DOI":"10.1007\/BFb0090048"},{"issue":"4","key":"1735_CR11","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-Wolfe algorithm. SIAM J. Control 6(4), 509\u2013516 (1968)","journal-title":"SIAM J. Control"},{"issue":"1","key":"1735_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01449883","volume":"64","author":"C Carath\u00e9odory","year":"1907","unstructured":"Carath\u00e9odory, C.: \u00dcber den variabilit\u00e4tsbereich der koeffizienten von potenzreihen, die gegebene werte nicht annehmen. Math. Ann. 64(1), 95\u2013115 (1907)","journal-title":"Math. Ann."},{"key":"1735_CR13","volume-title":"Approximate Methods in Optimization Problems","author":"VF Demyanov","year":"1970","unstructured":"Demyanov, V.F., Rubinov, A.M.: Approximate Methods in Optimization Problems. Elsevier, Amsterdam (1970)"},{"issue":"2","key":"1735_CR14","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/0022-247X(78)90137-3","volume":"62","author":"JC Dunn","year":"1978","unstructured":"Dunn, J.C., Harshbarger, S.: Conditional gradient algorithms with open loop step size rules. J. Math. Anal. Appl. 62(2), 432\u2013444 (1978)","journal-title":"J. Math. Anal. Appl."},{"key":"1735_CR15","doi-asserted-by":"crossref","unstructured":"Ekeland, I., T\u00e9mam, R.: Convex Analysis and Variational Problems. Society for Industrial and Applied Mathematics (1999) (Originally published in 1976)","DOI":"10.1137\/1.9781611971088"},{"issue":"1\u20132","key":"1735_CR16","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."},{"key":"1735_CR17","unstructured":"Garber, D., Hazan, E.: Faster rates for the Frank-Wolfe method over strongly-convex sets. In: Proceedings of the 32nd International Conference on Machine Learning, pp. 541\u2013549 (2015)"},{"key":"1735_CR18","unstructured":"Garber, D., Wolf, N.: Frank-Wolfe with a nearest extreme point oracle. In: Proceedings of the 34th Conference on Learning Theory, pp. 2103\u20132132 (2021)"},{"key":"1735_CR19","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"},{"issue":"1","key":"1735_CR20","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01580219","volume":"6","author":"CA Holloway","year":"1974","unstructured":"Holloway, C.A.: An extension of the Frank and Wolfe method of feasible directions. Math. Program. 6(1), 14\u201327 (1974)","journal-title":"Math. Program."},{"issue":"1","key":"1735_CR21","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s00454-019-00130-w","volume":"66","author":"G Ivanov","year":"2021","unstructured":"Ivanov, G.: Approximate Carath\u00e9odorys theorem in uniformly smooth banach spaces. Discret. Comput. Geom. 66(1), 273\u2013280 (2021)","journal-title":"Discret. Comput. Geom."},{"key":"1735_CR22","unstructured":"Jaggi, M.: Revisiting Frank-Wolfe: projection-free sparse convex optimization. In: Proceedings of the 30th International Conference on Machine Learning, pp. 427\u2013435 (2013)"},{"key":"1735_CR23","unstructured":"Kerdreux, T., d\u2019Aspremont, A., Pokutta, S.: Projection-free optimization on uniformly convex sets. In: Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, pp. 19\u201327 (2021)"},{"issue":"3","key":"1735_CR24","doi-asserted-by":"publisher","first-page":"769","DOI":"10.5802\/aif.1638","volume":"48","author":"K Kurdyka","year":"1998","unstructured":"Kurdyka, K.: On gradients of functions definable in o-minimal structures. Ann. Inst. Fourier 48(3), 769\u2013783 (1998)","journal-title":"Ann. Inst. Fourier"},{"key":"1735_CR25","first-page":"496","volume":"28","author":"S Lacoste-Julien","year":"2015","unstructured":"Lacoste-Julien, S., Jaggi, M.: On the global linear convergence of Frank-Wolfe optimization variants. Adv. Neural Inf. Process. Syst. 28, 496\u2013504 (2015)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"1735_CR26","unstructured":"Lan, G.: The complexity of large-scale convex programming under a linear optimization oracle. Technical report, Department of Industrial and Systems Engineering, University of Florida (2013)"},{"issue":"5","key":"1735_CR27","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."},{"key":"1735_CR28","unstructured":"\u0141ojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els. In: Les \u00c9quations aux D\u00e9riv\u00e9es Partielles, Vol. 117, pp. 87\u201389. Colloques Internationaux du CNRS (1963)"},{"key":"1735_CR29","first-page":"8307","volume":"32","author":"A Maalouf","year":"2019","unstructured":"Maalouf, A., Jubran, I., Feldman, D.: Fast and accurate least-mean-squares solvers. Adv. Neural Inf. Process. Syst. 32, 8307\u20138318 (2019)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"1735_CR30","unstructured":"Mirrokni, V., Leme, R Paes, Vladu, A., Wong, S.C.-W.: Tight bounds for approximate Carath\u00e9odory and beyond. In: Proceedings of the 34th International Conference on Machine Learning, pp. 2440\u20132448. (2017)"},{"key":"1735_CR31","first-page":"2897","volume":"255","author":"JJ Moreau","year":"1962","unstructured":"Moreau, J.J.: Fonctions convexes duales et points proximaux dans un espace hilbertien. Comptes Rendus Hebd. S\u00e9ances Acad. Sci. 255, 2897\u20132899 (1962)","journal-title":"Comptes Rendus Hebd. S\u00e9ances Acad. Sci."},{"key":"1735_CR32","doi-asserted-by":"publisher","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"JJ Moreau","year":"1965","unstructured":"Moreau, J.J.: Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bull. Soc. Math. France 93, 273\u2013279 (1965)","journal-title":"Bull. Soc. Math. France"},{"key":"1735_CR33","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"AS Nemirovsky","year":"1983","unstructured":"Nemirovsky, A.S., Yudin, D.B.: Problem Complexity and Method Efficiency in Optimization. Wiley, New Jersey (1983)"},{"key":"1735_CR34","unstructured":"Pisier, G.: Remarques sur un r\u00e9sultat non publi\u00e9 de B.\u00a0Maurey. In: S\u00e9minaire d\u2019Analyse Fonctionnelle, Vol. 5, pp. 1\u201312. \u00c9cole Polytechnique (1981)"},{"issue":"4","key":"1735_CR35","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1016\/0041-5553(63)90382-3","volume":"3","author":"BT Polyak","year":"1963","unstructured":"Polyak, B.T.: Gradient methods for the minimisation of functionals. USSR Comput. Math. Math. Phys. 3(4), 864\u2013878 (1963)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"1735_CR36","unstructured":"Shalev-Shwartz, S.: Online Learning: Theory, Algorithms, and Applications. Ph.D. thesis, Hebrew University (2007)"},{"key":"1735_CR37","unstructured":"Wolfe, P.: Convergence theory in nonlinear programming. In: Integer and Nonlinear Programming, pp. 1\u201336. North-Holland (1970)"},{"key":"1735_CR38","unstructured":"Xu, Y., Yang, T.: Frank-Wolfe method is automatically adaptive to error bound condition. arXiv preprint arXiv:1810.04765 (2018)"},{"key":"1735_CR39","doi-asserted-by":"publisher","DOI":"10.1142\/5021","volume-title":"Convex Analysis in General Vector Spaces","author":"C Z\u0103linescu","year":"2002","unstructured":"Z\u0103linescu, C.: Convex Analysis in General Vector Spaces. World Scientific, Singapore (2002)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01735-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01735-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01735-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T01:05:31Z","timestamp":1674349531000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01735-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,30]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1735"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01735-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,30]]},"assertion":[{"value":"17 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}