{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:05:49Z","timestamp":1765544749595,"version":"3.48.0"},"reference-count":69,"publisher":"Association for Computing Machinery (ACM)","issue":"4","funder":[{"name":"German Federal Ministry of Education and Research","award":["05M14ZAM,05M20ZBM"],"award-info":[{"award-number":["05M14ZAM,05M20ZBM"]}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["ANR-19-P3IA-0003"],"award-info":[{"award-number":["ANR-19-P3IA-0003"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2025,12,31]]},"abstract":"<jats:p>Frank-Wolfe (FW) algorithms have emerged as an essential class of methods for constrained optimization, especially on large-scale problems. In this article, we summarize the algorithmic design choices and progress made in the last years of the development of FrankWolfe.jl, a Julia package gathering high-performance implementations of state-of-the-art FW variants. We review key use cases of the library in the recent literature, which match its original dual purpose: first, becoming the de-facto toolbox for practitioners applying FW methods to their problem, and second, offering a modular ecosystem to algorithm designers who experiment with their own variants and implementations of algorithmic blocks. Finally, we demonstrate the performance of several FW variants on important problem classes in several experiments, which we curated in a separate repository for continuous benchmarking.<\/jats:p>","DOI":"10.1145\/3765626","type":"journal-article","created":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T13:29:54Z","timestamp":1756906194000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Algorithms and Novel Applications of the FrankWolfe.jl Library"],"prefix":"10.1145","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6284-3033","authenticated-orcid":false,"given":"Mathieu","family":"Besan\u00e7on","sequence":"first","affiliation":[{"name":"Universit\u00e9 Grenoble Alpes, Inria, CNRS, LIG, Grenoble, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0303-3556","authenticated-orcid":false,"given":"S\u00e9bastien","family":"Designolle","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Berlin, Germany, and ENS de Lyon, Inria, LIP, UCBL, Lyon, France"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-1785-8130","authenticated-orcid":false,"given":"Jannis","family":"Halbey","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Berlin, Germany\u00a0and Technische Universit\u00e4t Berlin, Berlin, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0705-1356","authenticated-orcid":false,"given":"Deborah","family":"Hendrych","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Berlin, Germany\u00a0and Technische Universit\u00e4t Berlin, Berlin, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-1156-106X","authenticated-orcid":false,"given":"Dominik","family":"Kuzinowicz","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Berlin, Germany\u00a0and Technische Universit\u00e4t Berlin, Berlin, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7365-3000","authenticated-orcid":false,"given":"Sebastian","family":"Pokutta","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Berlin, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8079-9603","authenticated-orcid":false,"given":"Hannah","family":"Troppens","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Berlin, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6861-6495","authenticated-orcid":false,"given":"Daniel","family":"Viladrich Herrmannsdoerfer","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Berlin, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-8957-8736","authenticated-orcid":false,"given":"Elias","family":"Wirth","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Berlin, Germany\u00a0and Technische Universit\u00e4t Berlin, Berlin, Germany"}]}],"member":"320","published-online":{"date-parts":[[2025,12,12]]},"reference":[{"key":"e_1_3_3_2_2","article-title":"Differentiable convex optimization layers","volume":"32","author":"Agrawal Akshay","year":"2019","unstructured":"Akshay Agrawal, Brandon Amos, Shane Barratt, Stephen Boyd, Steven Diamond, and J. Zico Kolter. 2019. Differentiable convex optimization layers. In Advances in Neural Information Processing Systems, Vol. 32.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_3_2","first-page":"107","article-title":"Differentiating through a cone program","author":"Agrawal Akshay","year":"2019","unstructured":"Akshay Agrawal, Shane Barratt, Stephen Boyd, Enzo Busseti, and Walaa M. Moursi. 2019. Differentiating through a cone program. Journal of Applied and Numerical Optimization 2 (2019), 107\u2013115.","journal-title":"Journal of Applied and Numerical Optimization"},{"key":"e_1_3_3_4_2","first-page":"136","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Amos Brandon","year":"2017","unstructured":"Brandon Amos and J. Zico Kolter. 2017. OptNet: Differentiable optimization as a layer in neural networks. In Proceedings of the International Conference on Machine Learning. PMLR, 136\u2013145."},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/39\/36\/010"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1137\/21M1397349"},{"key":"e_1_3_3_7_2","first-page":"1355","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Bach Francis","year":"2012","unstructured":"Francis Bach, Simon Lacoste-Julien, and Guillaume Obozinski. 2012. On the equivalence between herding and conditional gradient algorithms. In Proceedings of the International Conference on Machine Learning. PMLR, 1355\u20131362."},{"key":"e_1_3_3_8_2","article-title":"Decomposition-invariant conditional gradient for general polytopes with line search","volume":"30","author":"Bashiri Mohammad Ali","year":"2017","unstructured":"Mohammad Ali Bashiri and Xinhua Zhang. 2017. Decomposition-invariant conditional gradient for general polytopes with line search. In Advances in Neural Information Processing Systems, Vol. 30.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1137\/15M1008397"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1069-4"},{"key":"e_1_3_3_11_2","first-page":"9508","article-title":"Learning with differentiable perturbed optimizers","volume":"33","author":"Berthet Quentin","year":"2020","unstructured":"Quentin Berthet, Mathieu Blondel, Olivier Teboul, Marco Cuturi, Jean-Philippe Vert, and Francis Bach. 2020. Learning with differentiable perturbed optimizers. In Advances in Neural Information Processing Systems, Vol. 33, 9508\u20139519.","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"5","key":"e_1_3_3_12_2","article-title":"FrankWolfe.jl: A high-performance and flexible toolbox for Frank-Wolfe algorithms and conditional gradients","volume":"34","author":"Besan\u00e7on Mathieu","year":"2022","unstructured":"Mathieu Besan\u00e7on, Alejandro Carderera, and Sebastian Pokutta. 2022. FrankWolfe.jl: A high-performance and flexible toolbox for Frank-Wolfe algorithms and conditional gradients. INFORMS Journal on Computing 34, 5 (2022), 2611--2620.","journal-title":"INFORMS Journal on Computing"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2022.0283"},{"key":"e_1_3_3_14_2","first-page":"5230","article-title":"Efficient and modular implicit differentiation","volume":"35","author":"Blondel Mathieu","year":"2022","unstructured":"Mathieu Blondel, Quentin Berthet, Marco Cuturi, Roy Frostig, Stephan Hoyer, Felipe Llinares-L\u00f3pez, Fabian Pedregosa, and Jean-Philippe Vert. 2022. Efficient and modular implicit differentiation. In Advances in Neural Information Processing Systems, Vol. 35, 5230\u20135242.","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"35","key":"e_1_3_3_15_2","first-page":"1","article-title":"Learning with Fenchel-Young losses","volume":"21","author":"Blondel Mathieu","year":"2020","unstructured":"Mathieu Blondel, Andr\u00e9 F. T. Martins, and Vlad Niculae. 2020. Learning with Fenchel-Young losses. Journal of Machine Learning Research 21, 35 (2020), 1\u201369.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1137\/19M1309419"},{"key":"e_1_3_3_17_2","unstructured":"G\u00e1bor Braun Alejandro Carderera Cyrille W. Combettes Hamed Hassani Amin Karbasi Aryan Mokhtari and Sebastian Pokutta. 2022. Conditional gradient methods. arXiv:2211.14103. Retrieved from https:\/\/arxiv.org\/abs\/2211.14103"},{"key":"e_1_3_3_18_2","first-page":"735","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Braun G\u00e1bor","year":"2019","unstructured":"G\u00e1bor Braun, Sebastian Pokutta, Dan Tu, and Stephen Wright. 2019. Blended conditional gradients. In Proceedings of the International Conference on Machine Learning. PMLR, 735\u2013743."},{"key":"e_1_3_3_19_2","unstructured":"G\u00e1bor Braun Sebastian Pokutta and Robert Weismantel. 2023. Alternating Linear Minimization: Revisiting von Neumann\u2019s alternating projections. arXiv:221202933. Retrieved from https:\/\/arxiv.org\/abs\/2212.02933"},{"key":"e_1_3_3_20_2","unstructured":"G\u00e1bor Braun Sebastian Pokutta and Zev Woodstock. 2024. Flexible block-iterative analysis for the Frank-Wolfe algorithm. arXiv:2409.06931. Retrieved from https:\/\/arxiv.org\/abs\/2409.06931"},{"issue":"71","key":"e_1_3_3_21_2","first-page":"1","article-title":"Lazifying conditional gradient algorithms","volume":"20","author":"Braun G\u00e1bor","year":"2019","unstructured":"G\u00e1bor Braun, Sebastian Pokutta, and Daniel Zink. 2019. Lazifying conditional gradient algorithms. Journal of Machine Learning Research 20, 71 (2019), 1\u201342.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_3_22_2","unstructured":"Stephen Brierley Miguel Navascu\u00e9s and Tam\u00e1s V\u00e9rtesi. 2016. Convex separation from convex optimization for large-scale problems. arXiv:1609.05011. Retrieved from https:\/\/arxiv.org\/abs\/1609.05011"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","unstructured":"Nicolas Brunner Daniel Cavalcanti Stefano Pironio Valerio Scarani and Stephanie Wehner. 2014. Bell nonlocality. Reviews of Modern Physics 86 2 (Apr. 2014) 419\u2013478. DOI: 10.1103\/RevModPhys.86.419","DOI":"10.1103\/RevModPhys.86.419"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1137\/0306032"},{"key":"e_1_3_3_25_2","doi-asserted-by":"crossref","unstructured":"Constantin Carath\u00e9odory. 1907. \u00dcber den variabilit\u00e4tsbereich der koeffizienten von potenzreihen die gegebene werte nicht annehmen. Mathematische Annalen 64 1 (1907) 95\u2013115.","DOI":"10.1007\/BF01449883"},{"key":"e_1_3_3_26_2","first-page":"5390","article-title":"Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions","volume":"34","author":"Carderera Alejandro","year":"2021","unstructured":"Alejandro Carderera, Mathieu Besan\u00e7on, and Sebastian Pokutta. 2021. Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions. In Advances in Neural Information Processing Systems, Vol. 34, 5390\u20135401.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1137\/23M1616789"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","unstructured":"Cyrille W. Combettes and Sebastian Pokutta. 2023. Revisiting the approximate Carath\u00e9odory problem via the Frank-Wolfe algorithm. Mathematical Programming 197 1 (01 Jan. 2023) 191\u2013214. DOI: 10.1007\/s10107-021-01735-x","DOI":"10.1007\/s10107-021-01735-x"},{"key":"e_1_3_3_29_2","unstructured":"Guillaume Dalle L\u00e9o Baty Louis Bouvier and Axel Parmentier. 2022. Learning with combinatorial optimization layers: A probabilistic approach. arXiv:2207.13513. Retrieved from https:\/\/arxiv.org\/abs\/2207.13513"},{"issue":"4","key":"e_1_3_3_30_2","doi-asserted-by":"crossref","first-page":"043059","DOI":"10.1103\/PhysRevResearch.5.043059","article-title":"Improved local models and new Bell inequalities via Frank-Wolfe algorithms","volume":"5","author":"Designolle S\u00e9bastien","year":"2023","unstructured":"S\u00e9bastien Designolle, Gabriele Iommazzo, Mathieu Besan\u00e7on, Sebastian Knebel, Patrick Gel\u00df, and Sebastian Pokutta. 2023. Improved local models and new Bell inequalities via Frank-Wolfe algorithms. Physical Review Research 5, 4 (2023), 043059.","journal-title":"Physical Review Research"},{"key":"e_1_3_3_31_2","unstructured":"S\u00e9bastien Designolle Tam\u00e1s V\u00e9rtesi and Sebastian Pokutta. 2024. Better bounds on Grothendieck constants of finite orders. arXiv:2409.03739. Retrieved from https:\/\/arxiv.org\/abs\/2409.03739"},{"issue":"2","key":"e_1_3_3_32_2","doi-asserted-by":"crossref","first-page":"022205","DOI":"10.1103\/PhysRevA.109.022205","article-title":"Symmetric multipartite Bell inequalities via Frank-Wolfe algorithms","volume":"109","author":"Designolle S\u00e9bastien","year":"2024","unstructured":"S\u00e9bastien Designolle, Tam\u00e1s V\u00e9rtesi, and Sebastian Pokutta. 2024. Symmetric multipartite Bell inequalities via Frank-Wolfe algorithms. Physical Review A 109, 2 (2024), 022205.","journal-title":"Physical Review A"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.96.012113"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1137\/15M104726X"},{"key":"e_1_3_3_35_2","article-title":"Linear-memory and decomposition-invariant linearly convergent conditional gradient algorithm for structured polytopes","volume":"29","author":"Garber Dan","year":"2016","unstructured":"Dan Garber and Ofer Meshi. 2016. Linear-memory and decomposition-invariant linearly convergent conditional gradient algorithm for structured polytopes. In Advances in Neural Information Processing Systems, Vol. 29.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","unstructured":"Elmer G. Gilbert. 1966. An iterative procedure for computing the minimum of a quadratic form on a convex set. SIAM Journal on Control 4 1 (1966) 61\u201380. DOI: 10.1137\/0304007","DOI":"10.1137\/0304007"},{"key":"e_1_3_3_37_2","unstructured":"Jannis Halbey Seta Rakotomandimby Mathieu Besan\u00e7on S\u00e9bastien Designolle and Sebastian Pokutta. 2025. Efficient quadratic corrections for Frank-Wolfe algorithms. arXiv:2506.02635. Retrieved from https:\/\/arxiv.org\/abs\/2506.02635"},{"key":"e_1_3_3_38_2","first-page":"1263","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Hazan Elad","year":"2016","unstructured":"Elad Hazan and Haipeng Luo. 2016. Variance-reduced and projection-free stochastic optimization. In Proceedings of the International Conference on Machine Learning. PMLR, 1263\u20131271."},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.11.010"},{"key":"e_1_3_3_40_2","volume-title":"Proceedings of the 42nd International Conference on Machine Learning","author":"Hendrych Deborah","year":"2025","unstructured":"Deborah Hendrych, Mathieu Besan\u00e7on, David Mart\u00ednez-Rubio, and Sebastian Pokutta. 2025. Secant line search for Frank-Wolfe algorithms. In Proceedings of the 42nd International Conference on Machine Learning."},{"key":"e_1_3_3_41_2","unstructured":"Deborah Hendrych Mathieu Besan\u00e7on and Sebastian Pokutta. 2024. Solving the optimal experiment design problem with mixed-integer convex methods. arXiv:2312.11200. Retrieved from https:\/\/arxiv.org\/abs2312.11200"},{"key":"e_1_3_3_42_2","doi-asserted-by":"crossref","unstructured":"Deborah Hendrych Hannah Troppens Mathieu Besan\u00e7on and Sebastian Pokutta. 2025. Convex mixed-integer optimization with Frank-Wolfe methods. Mathematical Programming Computation (2025) 1\u201327.","DOI":"10.1007\/s12532-025-00288-w"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2017-04-25-3"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-009-0002-8"},{"key":"e_1_3_3_45_2","unstructured":"Dominik Kuzinowicz and Elias Wirth. 2023. ApproximateVanishingIdeals.jl. Retrieved from https:\/\/github.com\/ZIB-IOL\/ApproximateVanishingIdeals.jl"},{"key":"e_1_3_3_46_2","first-page":"496","volume-title":"Advances in Neural Information Processing Systems (NIPS)","author":"Lacoste-Julien Simon","year":"2015","unstructured":"Simon Lacoste-Julien and Martin Jaggi. 2015. On the global linear convergence of Frank-Wolfe optimization variants. In Advances in Neural Information Processing Systems (NIPS). C. Cortes, N. D. Lawrence, D. D. Lee, M. Sugiyama, and R. Garnett (Eds.), Vol. 28. Curran Associates, 496\u2013504."},{"key":"e_1_3_3_47_2","first-page":"53","volume-title":"Proceedings of the 30th International Conference on Machine LearningProceedings of Machine Learning Research","volume":"28","author":"Lacoste-Julien Simon","year":"2013","unstructured":"Simon Lacoste-Julien, Martin Jaggi, Mark Schmidt, and Patrick Pletscher. 2013. Block-coordinate Frank-Wolfe optimization for structural SVMs. In Proceedings of the 30th International Conference on Machine Learning. Sanjoy Dasgupta and David McAllester (Eds.), Proceedings of Machine Learning Research, Vol. 28, PMLR, 53\u201361. Retrieved from https:\/\/proceedings.mlr.press\/v28\/lacoste-julien13.html"},{"key":"e_1_3_3_48_2","volume-title":"Computation of Approximate Border Bases and Applications","author":"Limbeck Jan","year":"2013","unstructured":"Jan Limbeck. 2013. Computation of Approximate Border Bases and Applications. Ph.D. Dissertation. Universit\u00e4t Passau."},{"key":"e_1_3_3_49_2","first-page":"597","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Livni Roi","year":"2013","unstructured":"Roi Livni, David Lehavi, Sagi Schein, Hila Nachliely, Shai Shalev-Shwartz, and Amir Globerson. 2013. Vanishing component analysis. In Proceedings of the International Conference on Machine Learning. PMLR, 597\u2013605."},{"key":"e_1_3_3_50_2","first-page":"14699","volume-title":"Proceedings of the 39th International Conference on Machine Learning","volume":"162","author":"Macdonald Jan","year":"2022","unstructured":"Jan Macdonald, Mathieu E. Besan\u00e7on, and Sebastian Pokutta. 2022. Interpretable neural networks with Frank-Wolfe: Sparse relevance maps and relevance orderings. In Proceedings of the 39th International Conference on Machine Learning. Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvari, Gang Niu, and Sivan Sabato (Eds.), Proceedings of Machine Learning Research, Vol. 162, PMLR, 14699\u201314716. Retrieved from https:\/\/proceedings.mlr.press\/v162\/macdonald22a.html"},{"issue":"105","key":"e_1_3_3_51_2","first-page":"1","article-title":"Stochastic conditional gradient methods: From convex minimization to submodular maximization","volume":"21","author":"Mokhtari Aryan","year":"2020","unstructured":"Aryan Mokhtari, Hamed Hassani, and Amin Karbasi. 2020. Stochastic conditional gradient methods: From convex minimization to submodular maximization. Journal of Machine Learning Research 21, 105 (2020), 1\u201349.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_3_52_2","first-page":"1","volume-title":"Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics (AISTATS)","volume":"108","author":"Pedregosa Fabian","year":"2020","unstructured":"Fabian Pedregosa, Geoffrey Negiar, Armin Askari, and Martin Jaggi. 2020. Linearly convergent Frank-Wolfe with backtracking line-search. In Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics (AISTATS). Silvia Chiappa and Roberto Calandra (Eds.), Proceedings of Machine Learning Research, Vol. 108, PMLR, 1\u201310. Retrieved from http:\/\/proceedings.mlr.press\/v108\/pedregosa20a\/pedregosa20a.pdf"},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","DOI":"10.1365\/s13291-023-00275-x"},{"key":"e_1_3_3_54_2","unstructured":"Francesco Rinaldi and Damiano Zeffiro. 2020. A unifying framework for the analysis of projection-free first-order methods under a sufficient slope condition. arXiv:2008.09781. Retrieved from https:\/\/arxiv.org\/abs\/2008.09781"},{"key":"e_1_3_3_55_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-022-00434-3"},{"key":"e_1_3_3_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/3127497"},{"key":"e_1_3_3_57_2","volume-title":"Weighted Matchings in General Graphs","author":"Sch\u00e4fer Guido","year":"2000","unstructured":"Guido Sch\u00e4fer. 2000. Weighted Matchings in General Graphs. Master\u2019s thesis. Universit\u00e4t des Saarlandes, Saarbr\u00fccken. Fachbereich Informatik."},{"key":"e_1_3_3_58_2","volume-title":"Proceedings of the INFORMS Optimization Society Annual Conference","author":"Sharma Kartikey","year":"2024","unstructured":"Kartikey Sharma, Deborah Hendrych, Mathieu Besan\u00e7on, and Sebastian Pokutta. 2024. Network design for the traffic assignment problem with mixed-integer Frank-Wolfe. In Proceedings of the INFORMS Optimization Society Annual Conference. INFORMS."},{"key":"e_1_3_3_59_2","first-page":"21864","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Tsuji Kazuma K.","year":"2022","unstructured":"Kazuma K. Tsuji, Ken\u2019ichiro Tanaka, and Sebastian Pokutta. 2022. Pairwise conditional gradients without swap steps and sparser kernel herding. In Proceedings of the International Conference on Machine Learning. PMLR, 21864\u201321883."},{"key":"e_1_3_3_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553517"},{"key":"e_1_3_3_61_2","unstructured":"Elias Wirth and Mathieu Besan\u00e7on. 2022. KernelHerding.jl. Retrieved from https:\/\/github.com\/ZIB-IOL\/KernelHerding.jl"},{"key":"e_1_3_3_62_2","volume-title":"Proceedings of the 28th International Conference on Artificial Intelligence and Statistics","author":"Wirth Elias","year":"2025","unstructured":"Elias Wirth, Mathieu Besan\u00e7on, and Sebastian Pokutta. 2025. The pivoting framework: Frank-Wolfe algorithms with active set size control. In Proceedings of the 28th International Conference on Artificial Intelligence and Statistics. arXiv:2407.11760. Retrieved from https:\/\/arxiv.org\/abs\/2407.11760"},{"key":"e_1_3_3_63_2","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Wirth Elias","year":"2023","unstructured":"Elias Wirth, Hiroshi Kera, and Sebastian Pokutta. 2023. Approximate vanishing ideal computations at scale. In Proceedings of the International Conference on Learning Representations."},{"key":"e_1_3_3_64_2","first-page":"77","volume-title":"Proceedings of the International Conference on Artificial Intelligence and Statistics","author":"Wirth Elias","year":"2023","unstructured":"Elias Wirth, Thomas Kerdreux, and Sebastian Pokutta. 2023. Acceleration of Frank-Wolfe algorithms with open-loop step-sizes. In Proceedings of the International Conference on Artificial Intelligence and Statistics. PMLR, 77\u2013100."},{"key":"e_1_3_3_65_2","unstructured":"Elias Wirth Javier Pena and Sebastian Pokutta. 2023. Accelerated affine-invariant convergence rates of the Frank-Wolfe algorithm with open-loop step-sizes. arXiv231004096. Retrieved from https:\/\/arxiv.org\/abs\/2310.04096"},{"key":"e_1_3_3_66_2","doi-asserted-by":"crossref","unstructured":"Elias Wirth Javier Pena and Sebastian Pokutta. 2024. Fast convergence of Frank-Wolfe algorithms on polytopes. arXiv:2406.18789. Retrieved from https:\/\/arxiv.org\/abs\/2406.18789","DOI":"10.1287\/moor.2024.0580"},{"key":"e_1_3_3_67_2","first-page":"2191","volume-title":"Proceedings of the International Conference on Artificial Intelligence and Statistics","author":"Wirth Elias","year":"2022","unstructured":"Elias Wirth and Sebastian Pokutta. 2022. Conditional gradients for the approximately vanishing ideal. In Proceedings of the International Conference on Artificial Intelligence and Statistics. PMLR, 2191\u20132209."},{"key":"e_1_3_3_68_2","article-title":"Convergence theory in nonlinear programming","author":"Wolfe Philip","year":"1970","unstructured":"Philip Wolfe. 1970. Convergence theory in nonlinear programming. Integer and Nonlinear Programming 3 (1970), 155--187.","journal-title":"Integer and Nonlinear Programming"},{"key":"e_1_3_3_69_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580381"},{"key":"e_1_3_3_70_2","unstructured":"Zev Woodstock and Sebastian Pokutta. 2024. Splitting the conditional gradient algorithm. arXiv:2311.05381. Retrieved from https:\/\/arxiv.org\/abs\/2311.05381"}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3765626","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T12:57:09Z","timestamp":1765544229000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3765626"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,12]]},"references-count":69,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12,31]]}},"alternative-id":["10.1145\/3765626"],"URL":"https:\/\/doi.org\/10.1145\/3765626","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"type":"print","value":"0098-3500"},{"type":"electronic","value":"1557-7295"}],"subject":[],"published":{"date-parts":[[2025,12,12]]},"assertion":[{"value":"2025-02-03","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-05","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}