Improved Algorithms and Novel Applications of the FrankWolfe.jl Library
Authors:
- Mathieu BesançonMBMathieu Besançon
- Sébastien DesignolleSDSébastien Designolle
- Jannis HalbeyJHJannis Halbey
- Deborah HendrychDHDeborah Hendrych
- Dominik KuzinowiczDKDominik Kuzinowicz
- Sebastian PokuttaSPSebastian Pokutta
- Hannah TroppensHTHannah Troppens
- Daniel Viladrich HerrmannsdoerferDHDaniel Viladrich Herrmannsdoerfer
- Elias WirthEWElias Wirth
Open Access
- 12 December 2025
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 51 (4) , 1-33
Abstract
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.Keywords
All Related Versions
Funding Information
- German Federal Ministry of Education and Research (05M14ZAM,05M20ZBM)
- Deutsche Forschungsgemeinschaft (ANR-19-P3IA-0003)
This publication has 26 references indexed in Scilit:
- Symmetric multipartite Bell inequalities via Frank-Wolfe algorithmsPhysical Review A, 2024
- Avoiding bad steps in Frank-Wolfe variantsComputational Optimization and Applications, 2022
- Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithmMathematical Programming, 2021
- Qutrit witness from the Grothendieck constant of order fourPhysical Review A, 2017
- Linearly convergent away-step conditional gradient for non-strongly convex functionsMathematical Programming, 2016
- Approximate computation of zero-dimensional polynomial idealsJournal of Symbolic Computation, 2009
- Blossom V: a new implementation of a minimum cost perfect matching algorithmMathematical Programming Computation, 2009
- On the relationship between convex bodies related to correlation experiments with dichotomic observablesJournal of Physics A: General Physics, 2006
- Finding the nearest point in A polytopeMathematical Programming, 1976
- Über den Variabilitätsbereich der Koeffizienten von Potenzreihen, die gegebene Werte nicht annehmenMathematische Annalen, 1907