Jannis Halbey
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jannis Halbey has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Sebastian Pokutta
Zuse Institute Berlin
2 shared publications - Sébastien Designolle
Zuse Institute Berlin
2 shared publications - Daniel Viladrich Herrmannsdoerfer
Zuse Institute Berlin, Berlin, Germany
1 shared publication - Deborah Hendrych
Zuse Institute Berlin, Berlin, Germany
1 shared publication - Dominik Kuzinowicz
Zuse Institute Berlin, Berlin, Germany and Technische Universität Berlin, Berlin, Germany
1 shared publication - Elias Wirth
Institute of Mathematics, Berlin Institute of Technology, Berlin, Germany
1 shared publication
Latest Publications
- 2 November 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (5)
Unified toolbox for multipartite entanglement certification
- 2 November 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (5)
Unified toolbox for multipartite entanglement certification
- Open Access
- 12 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 51 (4) , 1-33
Improved Algorithms and Novel Applications of the FrankWolfe.jl Library
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.
- 12 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 51 (4) , 1-33
Open AccessImproved Algorithms and Novel Applications of the FrankWolfe.jl Library
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.