
Deborah Hendrych
I am interested in Mixed-Integer Non-Linear Optimization and first-order methods for solving non-linear, convex optimization problems. Currently, I am working on a Branch-and-Bound framework using Frank-Wolfe to solve the node problems.
📬 Contact
- office
- Room 3106 at ZIB
- hendrych (at) zib.de
- languages
- German and English
🎓 Curriculum vitae
- since 2023
- Member of BMS
- since 2023
- Researcher at ZIB
- May 2023
- M.Sc. in Mathematics at FUB
- 2021 to spring 2023
- Research Assistant at ZIB
- autumn 2020 to spring 2021
- Tutor at BHT
- Apr 2019
- B.Sc. in Mathematics at BHT
- autumn 2016 to spring 2018
- Tutor at BHT
📝 Publications and preprints
Preprints
- Besançon, M., Designolle, S., Halbey, J., Hendrych, D., Kuzinowicz, D., Pokutta, S., Troppens, H., Viladrich, D., and Wirth, E. (2025). Improved Algorithms and Novel Applications of the FrankWolfe.jl Library.
[arXiv]
[BibTeX]
@misc{2025_BesanconEtAl_Frankwolfelibrary, archiveprefix = {arXiv}, eprint = {2501.14613}, primaryclass = {math.OC}, year = {2025}, author = {Besançon, Mathieu and Designolle, Sébastien and Halbey, Jannis and Hendrych, Deborah and Kuzinowicz, Dominik and Pokutta, Sebastian and Troppens, Hannah and Viladrich, Daniel and Wirth, Elias}, title = {Improved Algorithms and Novel Applications of the FrankWolfe.jl Library}, date = {2025-01-24} }
- Hendrych, D., Besançon, M., Martínez-Rubio, D., and Pokutta, S. (2025). Secant Line Search for Frank-Wolfe Algorithms.
[arXiv]
[BibTeX]
@misc{2025_HendrychBesanconMartinezrubioPokutta_Secantfrankwolfe, archiveprefix = {arXiv}, eprint = {2501.18775}, primaryclass = {math.OC}, year = {2025}, author = {Hendrych, Deborah and Besançon, Mathieu and Martínez-Rubio, David and Pokutta, Sebastian}, title = {Secant Line Search for Frank-Wolfe Algorithms}, date = {2025-01-30} }
- Hendrych, D., Troppens, H., Besançon, M., and Pokutta, S. (2022). Convex Integer Optimization with Frank-Wolfe Methods.
[arXiv]
[slides]
[code]
[BibTeX]
@misc{2022_HendrychTroppensBesanconPokutta_Convexintegerfrankwolfe, archiveprefix = {arXiv}, eprint = {2208.11010}, primaryclass = {math.OC}, year = {2022}, author = {Hendrych, Deborah and Troppens, Hannah and Besançon, Mathieu and Pokutta, Sebastian}, title = {Convex Integer Optimization with Frank-Wolfe Methods}, code = {https://github.com/ZIB-IOL/Boscia.jl}, slides = {https://pokutta.com/slides/20220915_boscia.pdf}, date = {2022-08-23} }
Conference proceedings
- Hendrych, D., Besançon, M., and Pokutta, S. (2023, December 18). Solving the Optimal Experiment Design Problem with Mixed-integer Convex Methods. Proceedings of the Symposium on Experimental Algorithms.
DOI: 10.4230/LIPIcs.SEA.2024.16
[arXiv]
[code]
[BibTeX]
@inproceedings{2023_HendrychBesanconPokutta_Optimalexperimentdesign, year = {2024}, booktitle = {Proceedings of the Symposium on Experimental Algorithms}, doi = {10.4230/LIPIcs.SEA.2024.16}, archiveprefix = {arXiv}, eprint = {2312.11200}, primaryclass = {math.OC}, author = {Hendrych, Deborah and Besançon, Mathieu and Pokutta, Sebastian}, title = {Solving the Optimal Experiment Design Problem with Mixed-integer Convex Methods}, code = {https://github.com/ZIB-IOL/OptimalDesignWithBoscia}, date = {2023-12-18} }
- Sharma, K., Hendrych, D., Besançon, M., and Pokutta, S. (2024, January 31). Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe. Proceedings of the INFORMS Optimization Society Conference.
[arXiv]
[BibTeX]
@inproceedings{2024_SharmaHendrychBesanconPokutta_NetworkdesignMicoFrankwolfe, year = {2024}, booktitle = {Proceedings of the INFORMS Optimization Society Conference}, archiveprefix = {arXiv}, eprint = {2402.00166}, primaryclass = {math.OC}, author = {Sharma, Kartikey and Hendrych, Deborah and Besançon, Mathieu and Pokutta, Sebastian}, title = {Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe}, date = {2024-01-31} }
🔬 Projects
Convex Solver Adaptivity for Mixed-integer Optimization
We will investigate mixed-integer optimization with convex objectives using error-adaptive convex solvers in branch-and-bound. Focusing on improving lower bounds and balancing computational costs, we aim to develop a faster branch-and-bound methodology by leveraging modern MILP techniques and error-adaptive methods. Key aspects include warm-starting and controlled inexactness in early termination.
MATH+ AA3-15
Apr 2023 to Mar 2026
4
3
💬 Talks and posters
Conference and workshop talks
- Jul 2024
- Solving the Optimal Design Problem with Mixed-Integer Convex Methods
22nd Symposium on Experimental Algorithms (SEA), Vienna
Research seminar talks
- Nov 2024
- Solving the Optimal Design Problem with Mixed-Integer Convex Methods
GHOST Research Seminar (GHOST), Grenoble - Jul 2024
- Solving the Optimal Design Problem with Mixed-Integer Convex Methods
NASPDE Seminar, Berlin - May 2024
- Solving the Optimal Design Problem with Mixed-Integer Convex Methods
MATH+ Spotlight talks, Berlin - Dec 2023
- Solving the Optimal Experiment Design Problems with Mixed-Integer Frank-Wolfe-based Methods
IOL Research Seminar (IOL), Berlin
Poster presentations
- Apr 2024
- Convex Solver Adaptivity for Mixed-Integer Optimization
5th Women in Optimization 2024 (WiO), Erlangen
🌍 Research Stays and Visits
- Oct 2024
- Universitè Grenoble Alpes hosted by Mathieu Besançon
📅 Event Attendance
- Jul 2025
- 22nd Mixed Integer Programming European Workshop (MIP), Clermont-Ferrand
- May 2025
- 7th DOxML Conference, Kyoto
- Jul 2024
- 22nd Symposium on Experimental Algorithms (SEA), Vienna
- Apr 2024
- 5th Women in Optimization 2024 (WiO), Erlangen
- Sep 2023
- 5th Computational Optimization at Work (CO@Work), Berlin