Hannah Troppens
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hannah Troppens has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Deborah Hendrych
Zuse Institute Berlin, Berlin, Germany
3 shared publications - Mathieu Besançon
Université Grenoble Alpes, Inria, LIG, Saint-Martin-d’Hères, France
3 shared publications - Sebastian Pokutta
Zuse Institute Berlin
3 shared publications - Daniel Viladrich Herrmannsdoerfer
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
- 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.
- Top Cited Papers
- 28 June 2025
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 17 (4) , 731-757
Convex mixed-integer optimization with Frank–Wolfe methods
- 28 June 2025
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 17 (4) , 731-757
Top Cited PapersConvex mixed-integer optimization with Frank–Wolfe methods
- Open Access
Convex mixed-integer optimization with Frank-Wolfe methods
Mixed-integer nonlinear optimization encompasses a broad class of problems that present both theoretical and computational challenges. We propose a new type of method to solve these problems based on a branch-and-bound algorithm with convex node relaxations. These relaxations are solved with a Frank-Wolfe algorithm over the convex hull of mixed-integer feasible points instead of the continuous relaxation via calls to a mixed-integer linear solver as the linear oracle. The proposed method computes feasible solutions while working on a single representation of the polyhedral constraints, leveraging the full extent of mixed-integer linear solvers without an outer approximation scheme and can exploit inexact solutions of node subproblems.
Open AccessConvex mixed-integer optimization with Frank-Wolfe methods
Mixed-integer nonlinear optimization encompasses a broad class of problems that present both theoretical and computational challenges. We propose a new type of method to solve these problems based on a branch-and-bound algorithm with convex node relaxations. These relaxations are solved with a Frank-Wolfe algorithm over the convex hull of mixed-integer feasible points instead of the continuous relaxation via calls to a mixed-integer linear solver as the linear oracle. The proposed method computes feasible solutions while working on a single representation of the polyhedral constraints, leveraging the full extent of mixed-integer linear solvers without an outer approximation scheme and can exploit inexact solutions of node subproblems.