Improved algorithms and novel applications of the FrankWolfe.jl library

Abstract

Frank-Wolfe (FW) algorithms have emerged as an essential class of methods for constrained optimization, especially on large-scale problems. In this paper, 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.

References in corpus (7)

• Bell nonlocality
• Better local hidden variable models for two-qubit Werner states and an upper bound on the Grothendieck constant $K_G(3)$
• On the Relationship between Convex Bodies Related to Correlation Experiments with Dichotomic Observables
• Qutrit witness from the Grothendieck constant of order four
• Improved local models and new Bell inequalities via Frank-Wolfe algorithms
• Symmetric multipartite Bell inequalities via Frank-Wolfe algorithms
• Scalable Frank-Wolfe on Generalized Self-concordant Functions via Simple Steps

Cited by in corpus (1)

• Better bounds on finite-order Grothendieck constants