Continuous Optimization

📝 Publications and preprints

Preprints

1. Xiao, W., Hendrych, D., Besançon, M., and Pokutta, S. (2025). Boscia.jl: A Review and Tutorial. DOI: 10.48550/arXiv.2511.01479 [arXiv]
   [BibTeX]

   @misc{2025_XiaoHendrychBesanconPokutta_Bosciaminlp_2511-01479,
     month = nov,
     doi = {10.48550/arXiv.2511.01479},
     archiveprefix = {arXiv},
     eprint = {2511.01479},
     arxiv = {arXiv:2511.01479},
     primaryclass = {math.OC},
     year = {2025},
     author = {Xiao, Wenjie and Hendrych, Deborah and Besançon, Mathieu and Pokutta, Sebastian},
     title = {Boscia.jl: A Review and Tutorial},
     date = {2025-11-04}
   }

2. Mexi, G., Hendrych, D., Designolle, S., Besançon, M., and Pokutta, S. (2025). A Frank-Wolfe-based Primal Heuristic for Quadratic Mixed-integer Optimization. DOI: 10.48550/arXiv.2508.01299 [arXiv]
   [BibTeX]

   @misc{2025_MexiEtAl_Frankwolfeheuristic_2508-01299,
     month = aug,
     doi = {10.48550/arXiv.2508.01299},
     archiveprefix = {arXiv},
     eprint = {2508.01299},
     arxiv = {arXiv:2508.01299},
     primaryclass = {math.OC},
     year = {2025},
     author = {Mexi, Gioni and Hendrych, Deborah and Designolle, Sébastien and Besançon, Mathieu and Pokutta, Sebastian},
     title = {A Frank-Wolfe-based Primal Heuristic for Quadratic Mixed-integer Optimization},
     date = {2025-08-02}
   }

3. Liu, Y.-C., Halbey, J., Pokutta, S., and Designolle, S. (2025). A Unified Toolbox for Multipartite Entanglement Certification. DOI: 10.48550/arXiv.2507.17435 [arXiv]
   [BibTeX]

   @misc{2025_LiuHalbeyPokuttaDesignolle_Unifiedtoolboxmultipartite_2507-17435,
     month = jul,
     doi = {10.48550/arXiv.2507.17435},
     archiveprefix = {arXiv},
     eprint = {2507.17435},
     arxiv = {arXiv:2507.17435},
     primaryclass = {quant-ph},
     year = {2025},
     author = {Liu, Ye-Chao and Halbey, Jannis and Pokutta, Sebastian and Designolle, Sébastien},
     title = {A Unified Toolbox for Multipartite Entanglement Certification},
     date = {2025-07-23}
   }

4. Pokutta, S. (2025). Scalable DC Optimization Via Adaptive Frank-Wolfe Algorithms. DOI: 10.48550/arXiv.2507.17545 [arXiv]
   [BibTeX]

   @misc{2025_Pokutta_DcoptimizationFrankwolfe_2507-17545,
     month = jul,
     doi = {10.48550/arXiv.2507.17545},
     archiveprefix = {arXiv},
     eprint = {2507.17545},
     arxiv = {arXiv:2507.17545},
     primaryclass = {math.OC},
     year = {2025},
     author = {Pokutta, Sebastian},
     title = {Scalable DC Optimization Via Adaptive Frank-Wolfe Algorithms},
     date = {2025-07-23}
   }

5. Porto, L. E. A., Designolle, S., Pokutta, S., and Quintino, M. T. (2025). Measurement Incompatibility and Quantum Steering Via Linear Programming. DOI: 10.48550/arXiv.2506.03045 [arXiv]
   [BibTeX]

   @misc{2025_PortoDesignollePokuttaTulio_LPforJM_2506-03045,
     month = jun,
     doi = {10.48550/arXiv.2506.03045},
     archiveprefix = {arXiv},
     eprint = {2506.03045},
     arxiv = {arXiv:2506.03045},
     primaryclass = {quant-ph},
     year = {2025},
     author = {Porto, Lucas E. A. and Designolle, Sébastien and Pokutta, Sebastian and Quintino, Marco Túlio},
     title = {Measurement Incompatibility and Quantum Steering Via Linear Programming},
     date = {2025-06-05}
   }

6. Iommazzo, G., Martínez-Rubio, D., Criado, F., Wirth, E., and Pokutta, S. (2025). Linear Convergence of the Frank-Wolfe Algorithm Over Product Polytopes. DOI: 10.48550/arXiv.2505.11259 [arXiv]
   [BibTeX]

   @misc{2025_IommazzoEtAl_Frankwolfeconvergence,
     month = may,
     doi = {10.48550/arXiv.2505.11259},
     archiveprefix = {arXiv},
     eprint = {2505.11259},
     arxiv = {arXiv:2505.11259},
     primaryclass = {math.OC},
     year = {2025},
     author = {Iommazzo, Gabriele and Martínez-Rubio, David and Criado, Francisco and Wirth, Elias and Pokutta, Sebastian},
     title = {Linear Convergence of the Frank-Wolfe Algorithm Over Product Polytopes},
     date = {2025-05-16}
   }

7. Sadiku, S., Chitranshi, K., Kera, H., and Pokutta, S. (2025). Training on Plausible Counterfactuals Removes Spurious Correlations. DOI: 10.48550/arXiv.2505.16583 [arXiv]
   [BibTeX]

   @misc{2025_SadikuChitranshiKeraPokutta_Plausiblecounterfactuals,
     month = may,
     doi = {10.48550/arXiv.2505.16583},
     archiveprefix = {arXiv},
     eprint = {2505.16583},
     arxiv = {arXiv:2505.16583},
     primaryclass = {cs.LG},
     year = {2025},
     author = {Sadiku, Shpresim and Chitranshi, Kartikeya and Kera, Hiroshi and Pokutta, Sebastian},
     title = {Training on Plausible Counterfactuals Removes Spurious Correlations},
     date = {2025-05-22}
   }

8. Wirth, E., Peña, J., and Pokutta, S. (2025). Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm. DOI: 10.48550/arXiv.2505.09886 [arXiv]
   [BibTeX]

   @misc{2025_WirthJavierPokutta_Adaptivestepsizes,
     month = may,
     doi = {10.48550/arXiv.2505.09886},
     archiveprefix = {arXiv},
     eprint = {2505.09886},
     arxiv = {arXiv:2505.09886},
     primaryclass = {math.OC},
     year = {2025},
     author = {Wirth, Elias and Peña, Javier and Pokutta, Sebastian},
     title = {Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm},
     date = {2025-05-16}
   }

9. Takahashi, S., Pokutta, S., and Takeda, A. (2025). Fast Frank–Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions. DOI: 10.48550/arXiv.2504.04330 [arXiv]
   [BibTeX]

   @misc{2025_ShotaPokuttaAkiko_Frankwolfebregman,
     month = apr,
     doi = {10.48550/arXiv.2504.04330},
     archiveprefix = {arXiv},
     eprint = {2504.04330},
     arxiv = {arXiv:2504.04330},
     primaryclass = {math.OC},
     year = {2025},
     author = {Takahashi, Shota and Pokutta, Sebastian and Takeda, Akiko},
     title = {Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions},
     date = {2025-04-06}
   }

10. Aigner, K.-M., Denzler, S., Liers, F., Pokutta, S., and Sharma, K. (2025). Scenario Reduction for Distributionally Robust Optimization. DOI: 10.48550/arXiv.2503.11484 [arXiv]
    [BibTeX]

    @misc{2025_Kevin-martinEtAl_ScenarioreductionDro,
      month = mar,
      doi = {10.48550/arXiv.2503.11484},
      archiveprefix = {arXiv},
      eprint = {2503.11484},
      arxiv = {arXiv:2503.11484},
      primaryclass = {math.OC},
      year = {2025},
      author = {Aigner, Kevin-Martin and Denzler, Sebastian and Liers, Frauke and Pokutta, Sebastian and Sharma, Kartikey},
      title = {Scenario Reduction for Distributionally Robust Optimization},
      date = {2025-03-14}
    }

11. Designolle, S. (2025). Most Incompatible Measurements and Sum-of-squares Optimisation. [arXiv]
    [BibTeX]

    @misc{2025_Designolle_IncompatiblemeasurementsSumofsquares_2509-10381,
      archiveprefix = {arXiv},
      eprint = {2509.10381},
      arxiv = {arXiv:2509.10381},
      primaryclass = {quant-ph},
      year = {2025},
      author = {Designolle, Sébastien},
      title = {Most Incompatible Measurements and Sum-of-squares Optimisation},
      date = {2025-09-15}
    }

12. Designolle, S., Vértesi, T., and Pokutta, S. (2024). Better Bounds on Grothendieck Constants of Finite Orders. [arXiv]
    [BibTeX]

    @misc{2023_DesignolleVertesiPokutta_Grothendieckconstants,
      month = sep,
      archiveprefix = {arXiv},
      eprint = {2409.03739},
      arxiv = {arXiv:2409.03739},
      primaryclass = {math.OC},
      year = {2024},
      author = {Designolle, Sébastien and Vértesi, Tamás and Pokutta, Sebastian},
      title = {Better Bounds on Grothendieck Constants of Finite Orders},
      date = {2024-09-05}
    }

13. Braun, G., Pokutta, S., and Woodstock, Z. (2024). Flexible Block-iterative Analysis for the Frank-Wolfe Algorithm. [arXiv]
    [BibTeX]

    @misc{2024_BraunPokuttaWoodstock_Blockiterativeanalysis,
      month = sep,
      archiveprefix = {arXiv},
      eprint = {2409.06931},
      arxiv = {arXiv:2409.06931},
      primaryclass = {math.OC},
      year = {2024},
      author = {Braun, Gábor and Pokutta, Sebastian and Woodstock, Zev},
      title = {Flexible Block-iterative Analysis for the Frank-Wolfe Algorithm},
      date = {2024-09-11}
    }

14. Bolusani, S., Besançon, M., Bestuzheva, K., Chmiela, A., Dionísio, J., Donkiewicz, T., van Doornmalen, J., Eifler, L., Ghannam, M., Gleixner, A., Graczyk, C., Halbig, K., Hedtke, I., Hoen, A., Hojny, C., van der Hulst, R., Kamp, D., Koch, T., Kofler, K., … Xu, L. (2024). The SCIP Optimization Suite 9.0 (ZIB Report No. 24-02-29). Zuse Institute Berlin. [URL] [arXiv] [code]
    [BibTeX]

    @techreport{2024_BolusaniEtAl_Scip9,
      year = {2024},
      institution = {Zuse Institute Berlin},
      type = {ZIB Report},
      month = feb,
      number = {24-02-29},
      url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-95528},
      archiveprefix = {arXiv},
      eprint = {2402.17702},
      arxiv = {arXiv:2402.17702},
      primaryclass = {math.OC},
      author = {Bolusani, Suresh and Besançon, Mathieu and Bestuzheva, Ksenia and Chmiela, Antonia and Dionísio, João and Donkiewicz, Tim and van Doornmalen, Jasper and Eifler, Leon and Ghannam, Mohammed and Gleixner, Ambros and Graczyk, Christoph and Halbig, Katrin and Hedtke, Ivo and Hoen, Alexander and Hojny, Christopher and van der Hulst, Rolf and Kamp, Dominik and Koch, Thorsten and Kofler, Kevin and Lentz, Jurgen and Manns, Julian and Mexi, Gioni and Mühmer, Erik and Pfetsch, Marc and Schlösser, Franziska and Serrano, Felipe and Shinano, Yuji and Turner, Mark and Vigerske, Stefan and Weninger, Dieter and Xu, Liding},
      title = {The SCIP Optimization Suite 9.0},
      code = {https://scipopt.org},
      date = {2024-02-27}
    }

15. Bolusani, S., Mexi, G., Besançon, M., and Turner, M. (2024). A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP. [arXiv]
    [BibTeX]

    @misc{2024_BolusaniMexiBesanconTurner_Multireferenceneighborhoodsearch,
      archiveprefix = {arXiv},
      eprint = {2408.00718},
      arxiv = {arXiv:2408.00718},
      primaryclass = {math.OC},
      year = {2024},
      author = {Bolusani, Suresh and Mexi, Gioni and Besançon, Mathieu and Turner, Mark},
      title = {A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP},
      date = {2024-08-02}
    }

16. Borst, S., Eifler, L., and Gleixner, A. (2024). Certified Constraint Propagation and Dual Proof Analysis in a Numerically Exact MIP Solver. [arXiv]
    [BibTeX]

    @misc{2024_BorstEiflerGleixner_ConstraintpropagationDualproofMip,
      archiveprefix = {arXiv},
      eprint = {2403.13567},
      arxiv = {arXiv:2403.13567},
      primaryclass = {math.OC},
      year = {2024},
      author = {Borst, Sander and Eifler, Leon and Gleixner, Ambros},
      title = {Certified Constraint Propagation and Dual Proof Analysis in a Numerically Exact MIP Solver},
      date = {2024-03-21}
    }

17. Hoen, A., and Gleixner, A. (2024). Analyzing the Numerical Correctness of Branch-and-bound Decisions for Mixed-integer Programming. [arXiv]
    [BibTeX]

    @misc{2024_HoenGleixner_NumericalCorrectnessBnB,
      archiveprefix = {arXiv},
      eprint = {2412.14710},
      arxiv = {arXiv:2412.14710},
      primaryclass = {math.OC},
      year = {2024},
      author = {Hoen, Alexander and Gleixner, Ambros},
      title = {Analyzing the Numerical Correctness of Branch-and-bound Decisions for Mixed-integer Programming},
      date = {2024-12-19}
    }

18. Scieur, D., Martínez-Rubio, D., Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2023). Strong Convexity of Sets in Riemannian Manifolds. [arXiv]
    [BibTeX]

    @misc{2022_KerdreuxScieurDaspremontPokutta_StrongconvexityRiemannianmanifolds,
      month = feb,
      archiveprefix = {arXiv},
      eprint = {2312.03583},
      arxiv = {arXiv:2312.03583},
      primaryclass = {math.OC},
      year = {2023},
      author = {Scieur, Damien and Martínez-Rubio, David and Kerdreux, Thomas and d'Aspremont, Alexandre and Pokutta, Sebastian},
      title = {Strong Convexity of Sets in Riemannian Manifolds},
      date = {2023-12-06}
    }

19. van Doornmalen, J., Eifler, L., Gleixner, A., and Hojny, C. (2023). A Proof System for Certifying Symmetry and Optimality Reasoning in Integer Programming. [arXiv]
    [BibTeX]

    @misc{2023_DoornmalenEiflerGleixnerHojny_Proofsystemsymmetry,
      archiveprefix = {arXiv},
      eprint = {2311.03877},
      arxiv = {arXiv:2311.03877},
      primaryclass = {math.OC},
      year = {2023},
      author = {van Doornmalen, Jasper and Eifler, Leon and Gleixner, Ambros and Hojny, Christopher},
      title = {A Proof System for Certifying Symmetry and Optimality Reasoning in Integer Programming},
      date = {2023-11-07}
    }

20. Turner, M., Berthold, T., Besançon, M., and Koch, T. (2023). Branching Via Cutting Plane Selection: Improving Hybrid Branching. [arXiv]
    [BibTeX]

    @misc{2023_TurnerBertholdBesanconKoch_Branchingcuttingplane,
      archiveprefix = {arXiv},
      eprint = {2306.06050},
      arxiv = {arXiv:2306.06050},
      primaryclass = {math.OC},
      year = {2023},
      author = {Turner, Mark and Berthold, Timo and Besançon, Mathieu and Koch, Thorsten},
      title = {Branching Via Cutting Plane Selection: Improving Hybrid Branching},
      date = {2023-06-09}
    }

21. Braun, G., Pokutta, S., and Weismantel, R. (2022). Alternating Linear Minimization: Revisiting von Neumann’s Alternating Projections. [arXiv] [slides] [video]
    [BibTeX]

    @misc{2022_BraunPokuttaWeismantel_Alternatingminimization,
      month = dec,
      archiveprefix = {arXiv},
      eprint = {2212.02933},
      arxiv = {arXiv:2212.02933},
      primaryclass = {math.OC},
      year = {2022},
      author = {Braun, Gábor and Pokutta, Sebastian and Weismantel, Robert},
      title = {Alternating Linear Minimization: Revisiting von Neumann's Alternating Projections},
      slides = {https://pokutta.com/slides/20230327-icerm.pdf},
      video = {https://icerm.brown.edu/programs/sp-s23/w2/#schedule-item-4945},
      date = {2022-12-06}
    }

22. Braun, G., Carderera, A., Combettes, C., Hassani, H., Karbasi, A., Mokhtari, A., and Pokutta, S. (2022). Conditional Gradient Methods. [arXiv]
    [BibTeX]

    @misc{2022_BraunEtAl_Conditionalgradient,
      month = jan,
      archiveprefix = {arXiv},
      eprint = {2211.14103},
      arxiv = {arXiv:2211.14103},
      primaryclass = {math.OC},
      year = {2022},
      author = {Braun, Gábor and Carderera, Alejandro and Combettes, Cyrille and Hassani, Hamed and Karbasi, Amin and Mokhtari, Aryan and Pokutta, Sebastian},
      title = {Conditional Gradient Methods},
      date = {2022-11-25}
    }

23. Bestuzheva, K., Besançon, M., Chen, W.-K., Chmiela, A., Donkiewicz, T., van Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., Gottwald, L., Graczyk, C., Halbig, K., Hoen, A., Hojny, C., van der Hulst, R., Koch, T., Lübbecke, M., Maher, S. J., … Witzig, J. (2021). The SCIP Optimization Suite 8.0 (ZIB Report No. 21-41). Zuse Institute Berlin. [URL] [arXiv] [code]
    [BibTeX]

    @techreport{2021_BestuzhevaEtAl_Scip8,
      year = {2021},
      institution = {Zuse Institute Berlin},
      type = {ZIB Report},
      month = dec,
      number = {21-41},
      url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-85309},
      archiveprefix = {arXiv},
      eprint = {2112.08872},
      arxiv = {arXiv:2112.08872},
      primaryclass = {math.OC},
      author = {Bestuzheva, Ksenia and Besançon, Mathieu and Chen, Wei-Kun and Chmiela, Antonia and Donkiewicz, Tim and van Doornmalen, Jasper and Eifler, Leon and Gaul, Oliver and Gamrath, Gerald and Gleixner, Ambros and Gottwald, Leona and Graczyk, Christoph and Halbig, Katrin and Hoen, Alexander and Hojny, Christopher and van der Hulst, Rolf and Koch, Thorsten and Lübbecke, Marco and Maher, Stephen J. and Matter, Frederic and Mühmer, Erik and Müller, Benjamin and Pfetsch, Marc and Rehfeld, Daniel and Schlein, Steffan and Schlösser, Franziska and Serrano, Felipe and Shinano, Yuji and Sofranac, Boro and Turner, Mark and Vigerske, Stefan and Wegscheider, Fabian and Wellner, Philipp and Weninger, Dieter and Witzig, Jakob},
      title = {The SCIP Optimization Suite 8.0},
      code = {https://scipopt.org},
      date = {2021-12-17}
    }

24. Roux, C., Wirth, E., Pokutta, S., and Kerdreux, T. (2021). Efficient Online-Bandit Strategies for Minimax Learning Problems. [arXiv]
    [BibTeX]

    @misc{2021_RouxWirthPokuttaKerdreux_Onlinebanditminimax,
      month = may,
      archiveprefix = {arXiv},
      eprint = {2105.13939},
      arxiv = {arXiv:2105.13939},
      primaryclass = {cs.LG},
      year = {2021},
      author = {Roux, Christophe and Wirth, Elias and Pokutta, Sebastian and Kerdreux, Thomas},
      title = {Efficient Online-Bandit Strategies for Minimax Learning Problems},
      date = {2021-05-28}
    }

25. Braun, G., and Pokutta, S. (2021). Dual Prices for Frank–Wolfe Algorithms. [arXiv]
    [BibTeX]

    @misc{2021_BraunPokutta_DualpricesFrankwolfe,
      month = jan,
      archiveprefix = {arXiv},
      eprint = {2101.02087},
      arxiv = {arXiv:2101.02087},
      primaryclass = {math.OC},
      year = {2021},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {Dual Prices for Frank--Wolfe Algorithms},
      date = {2021-01-06}
    }

26. Combettes, C., Spiegel, C., and Pokutta, S. (2020). Projection-Free Adaptive Gradients for Large-Scale Optimization. [arXiv] [summary] [code]
    [BibTeX]

    @misc{2020_CombettesSpiegelPokutta_Projectionfreeadaptivegradients,
      month = oct,
      archiveprefix = {arXiv},
      eprint = {2009.14114},
      arxiv = {arXiv:2009.14114},
      primaryclass = {math.OC},
      year = {2020},
      author = {Combettes, Cyrille and Spiegel, Christoph and Pokutta, Sebastian},
      title = {Projection-Free Adaptive Gradients for Large-Scale Optimization},
      code = {https://github.com/ZIB-IOL/StochasticFrankWolfe},
      summary = {https://pokutta.com/blog/research/2020/10/21/adasfw.html},
      date = {2020-09-29}
    }

27. Braun, G., and Pokutta, S. (2016). An Efficient High-probability Algorithm for Linear Bandits. [arXiv]
    [BibTeX]

    @misc{2016_BraunPokutta_Highprobabilitylinearbandits,
      archiveprefix = {arXiv},
      eprint = {1610.02072},
      arxiv = {arXiv:1610.02072},
      primaryclass = {cs.DS},
      year = {2016},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {An Efficient High-probability Algorithm for Linear Bandits},
      date = {2016-10-06}
    }

28. Braun, G., and Pokutta, S. (2009). A Polyhedral Approach to Computing Border Bases. [arXiv]
    [BibTeX]

    @misc{2010_BraunPokutta_PolyhedralApproach,
      archiveprefix = {arXiv},
      eprint = {0911.0859},
      arxiv = {arXiv:0911.0859},
      primaryclass = {math.AC},
      year = {2009},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {A Polyhedral Approach to Computing Border Bases},
      date = {2009-11-04}
    }

29. Sharma, U., Goel, K., Dua, A., Pokutta, S., and Woodstock, Z. A Note on Asynchronous Projective Splitting in Julia. [URL]
    [BibTeX]

    @misc{2025_SharmaGoelDuaPokuttaWoodstock_AsyncProx,
      month = apr,
      url = {https://zevwoodstock.github.io/media/publications/asyncprox.pdf},
      author = {Sharma, Utkarsh and Goel, Kashish and Dua, Aryan and Pokutta, Sebastian and Woodstock, Zev},
      title = {A Note on Asynchronous Projective Splitting in Julia}
    }

30. Pokutta, S., and Schulz, A. S. On the Connection of the Sherali-adams Closure and Border Bases. [URL]
    [BibTeX]

    @misc{2009_PokuttaSchulz_SheraliAdamsBorderBases,
      url = {https://optimization-online.org/?p=2009/08/2378},
      author = {Pokutta, Sebastian and Schulz, A.S.},
      title = {On the Connection of the Sherali-adams Closure and Border Bases}
    }

31. Pokutta, S., Schmaltz, C., and Stiller, S. Measuring Systemic Risk and Contagion in Financial Networks. [URL]
    [BibTeX]

    @misc{2011_PokuttaSchmaltzStiller_MeasuringSystemicRisk,
      url = {https://papers.ssrn.com/sol3/papers.cfm?abstract_id=1773089},
      author = {Pokutta, Sebastian and Schmaltz, C. and Stiller, S.},
      title = {Measuring Systemic Risk and Contagion in Financial Networks}
    }

32. Pokutta, S. Lower Bounds for Chvátal-gomory Style Operators. [URL]
    [BibTeX]

    @misc{2011_Pokutta_LowerBoundsChvatalGomory,
      url = {https://optimization-online.org/?p=2011/09/3151},
      author = {Pokutta, Sebastian},
      title = {Lower Bounds for Chvátal-gomory Style Operators}
    }

Conference proceedings

1. Halbey, J., Rakotomandimby, S., Besançon, M., Designolle, S., and Pokutta, S. (2025, June 3). Efficient Quadratic Corrections for Frank-Wolfe Algorithms. Proceedings of the Conference on Neural Information Processing Systems. DOI: 10.48550/arXiv.2506.02635 [arXiv]
   [BibTeX]

   @inproceedings{2025_HalbeyRakotomandimbyBesanconDesignollePokutta_Quadraticcorrections_2506-02635,
     year = {2025},
     booktitle = {Proceedings of the Conference on Neural Information Processing Systems},
     month = sep,
     doi = {10.48550/arXiv.2506.02635},
     archiveprefix = {arXiv},
     eprint = {2506.02635},
     arxiv = {arXiv:2506.02635},
     primaryclass = {math.OC},
     author = {Halbey, Jannis and Rakotomandimby, Seta and Besançon, Mathieu and Designolle, Sébastien and Pokutta, Sebastian},
     title = {Efficient Quadratic Corrections for Frank-Wolfe Algorithms},
     date = {2025-06-03}
   }

2. Hendrych, D., Besançon, M., Martínez-Rubio, D., and Pokutta, S. (2025, January 30). Secant Line Search for Frank-Wolfe Algorithms. Proceedings of the International Conference on Machine Learning. DOI: 10.48550/arXiv.2501.18775 [arXiv]
   [BibTeX]

   @inproceedings{2025_HendrychBesanconMartinezrubioPokutta_Secantfrankwolfe,
     year = {2025},
     booktitle = {Proceedings of the International Conference on Machine Learning},
     month = may,
     doi = {10.48550/arXiv.2501.18775},
     archiveprefix = {arXiv},
     eprint = {2501.18775},
     arxiv = {arXiv:2501.18775},
     primaryclass = {math.OC},
     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}
   }

3. Pelleriti, N., Zimmer, M., Wirth, E., and Pokutta, S. (2025, February 20). Approximating Latent Manifolds in Neural Networks Via Vanishing Ideals. Proceedings of the International Conference on Machine Learning. DOI: 10.48550/arXiv.2502.15051 [arXiv]
   [BibTeX]

   @inproceedings{2025_PelleritiZimmerWirthPokutta_Latentmanifolds,
     year = {2025},
     booktitle = {Proceedings of the International Conference on Machine Learning},
     month = may,
     doi = {10.48550/arXiv.2502.15051},
     archiveprefix = {arXiv},
     eprint = {2502.15051},
     arxiv = {arXiv:2502.15051},
     primaryclass = {cs.LG},
     author = {Pelleriti, Nico and Zimmer, Max and Wirth, Elias and Pokutta, Sebastian},
     title = {Approximating Latent Manifolds in Neural Networks Via Vanishing Ideals},
     date = {2025-02-20}
   }

4. Roux, C., Martínez-Rubio, D., and Pokutta, S. (2025, January 31). Implicit Riemannian Optimism with Applications to Min-max Problems. Proceedings of the International Conference on Machine Learning. DOI: 10.48550/arXiv.2501.18381 [arXiv]
   [BibTeX]

   @inproceedings{2025_RouxMartinezrubioPokutta_ImplicitRiemannian,
     year = {2025},
     booktitle = {Proceedings of the International Conference on Machine Learning},
     month = may,
     doi = {10.48550/arXiv.2501.18381},
     archiveprefix = {arXiv},
     eprint = {2501.18381},
     arxiv = {arXiv:2501.18381},
     primaryclass = {math.OC},
     author = {Roux, Christophe and Martínez-Rubio, David and Pokutta, Sebastian},
     title = {Implicit Riemannian Optimism with Applications to Min-max Problems},
     date = {2025-01-31}
   }

5. Troppens, H., Besançon, M., Wilken, S. E., and Pokutta, S. (2025, February 2). Mixed-Integer Optimization for Loopless Flux Distributions in Metabolic Networks. Proceedings of the Symposium on Experimental Algorithms. DOI: 10.4230/LIPIcs.SEA.2025.26 [arXiv]
   [BibTeX]

   @inproceedings{2025_TroppensBesanconWilkenPokutta_Mixedintegerloopless,
     year = {2025},
     booktitle = {Proceedings of the Symposium on Experimental Algorithms},
     month = apr,
     doi = {10.4230/LIPIcs.SEA.2025.26},
     archiveprefix = {arXiv},
     eprint = {2502.00807},
     arxiv = {arXiv:2502.00807},
     primaryclass = {math.OC},
     author = {Troppens, Hannah and Besançon, Mathieu and Wilken, St. Elmo and Pokutta, Sebastian},
     title = {Mixed-Integer Optimization for Loopless Flux Distributions in Metabolic Networks},
     date = {2025-02-02}
   }

6. Martínez-Rubio, D., Roux, C., Criscitiello, C., and Pokutta, S. (2025, January). Accelerated Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties. Proceedings of the International Conference on Artificial Intelligence and Statistics. [arXiv]
   [BibTeX]

   @inproceedings{2023_MartinezrubioRouxCriscitielloPokutta_Riemannianminmax,
     year = {2025},
     booktitle = {Proceedings of the International Conference on Artificial Intelligence and Statistics},
     month = jan,
     archiveprefix = {arXiv},
     eprint = {2305.16186},
     arxiv = {arXiv:2305.16186},
     primaryclass = {math.OC},
     author = {Martínez-Rubio, David and Roux, Christophe and Criscitiello, Christopher and Pokutta, Sebastian},
     title = {Accelerated Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties}
   }

7. Sadiku, S., Wagner, M., Nagarajan, S. G., and Pokutta, S. (2025, January). S-CFE: Simple Counterfactual Explanations. Proceedings of the International Conference on Artificial Intelligence and Statistics. [arXiv]
   [BibTeX]

   @inproceedings{2024_SadikuEtAl_Counterfactualexplanations,
     year = {2025},
     booktitle = {Proceedings of the International Conference on Artificial Intelligence and Statistics},
     month = jan,
     archiveprefix = {arXiv},
     eprint = {2410.15723},
     arxiv = {arXiv:2410.15723},
     primaryclass = {cs.LG},
     author = {Sadiku, Shpresim and Wagner, Moritz and Nagarajan, Sai Ganesh and Pokutta, Sebastian},
     title = {S-CFE: Simple Counterfactual Explanations}
   }

8. Wirth, E., Besançon, M., and Pokutta, S. (2025). The Pivoting Framework: Frank-Wolfe Algorithms with Active Set Size Control. Proceedings of the International Conference on Artificial Intelligence and Statistics, 271–279. [URL] [arXiv]
   [BibTeX]

   @inproceedings{2024_WirthBesanconPokutta_Pivotingframework,
     year = {2025},
     booktitle = {Proceedings of the International Conference on Artificial Intelligence and Statistics},
     month = jan,
     pages = {271--279},
     url = {https://proceedings.mlr.press/v258/besancon25a.html},
     archiveprefix = {arXiv},
     eprint = {2407.11760},
     arxiv = {arXiv:2407.11760},
     primaryclass = {math.OC},
     author = {Wirth, Elias and Besançon, Mathieu and Pokutta, Sebastian},
     title = {The Pivoting Framework: Frank-Wolfe Algorithms with Active Set Size Control}
   }

9. Turner, M., Chmiela, A., Koch, T., and Winkler, M. (2025). PySCIPOpt-ML: Embedding Trained Machine Learning Models Into Mixed-integer Programs. Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 218–234. DOI: 10.1007/978-3-031-95976-9_14 [arXiv]
   [BibTeX]

   @inproceedings{2023_TurnerChmielaKochMichael_Pyscipoptml,
     year = {2025},
     date = {2025-06-29},
     booktitle = {Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
     pages = {218-234},
     doi = {10.1007/978-3-031-95976-9_14},
     archiveprefix = {arXiv},
     eprint = {2312.08074},
     arxiv = {arXiv:2312.08074},
     primaryclass = {math.OC},
     author = {Turner, Mark and Chmiela, Antonia and Koch, Thorsten and Winkler, Michael},
     title = {PySCIPOpt-ML: Embedding Trained Machine Learning Models Into Mixed-integer Programs}
   }

10. Xu, L., Mexi, G., and Bestuzheva, K. (2025, July 15). Sparsity-driven Aggregation of Mixed Integer Programs. Proceedings of the Symposium on Experimental Algorithms. [arXiv]
    [BibTeX]

    @inproceedings{2025_XuMexiBestuzheva_Sparsityaggregationmip,
      year = {2025},
      date = {2025-07-15},
      booktitle = {Proceedings of the Symposium on Experimental Algorithms},
      archiveprefix = {arXiv},
      eprint = {2502.01192},
      arxiv = {arXiv:2502.01192},
      primaryclass = {math.OC},
      author = {Xu, Liding and Mexi, Gioni and Bestuzheva, Ksenia},
      title = {Sparsity-driven Aggregation of Mixed Integer Programs}
    }

11. Hendrych, D., Besançon, M., and Pokutta, S. (2024, April). 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},
      month = apr,
      doi = {10.4230/LIPIcs.SEA.2024.16},
      archiveprefix = {arXiv},
      eprint = {2312.11200},
      arxiv = {arXiv: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}
    }

12. Mexi, G., Shamsi, S., Besançon, M., and le Bodic, P. (2024). Probabilistic Lookahead Strong Branching Via a Stochastic Abstract Branching Model. Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research. [arXiv]
    [BibTeX]

    @inproceedings{2023_MexiSomayehBesanconPierre_Probabilisticstrongbranching,
      year = {2024},
      booktitle = {Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
      archiveprefix = {arXiv},
      eprint = {2312.07041},
      arxiv = {arXiv:2312.07041},
      primaryclass = {math.OC},
      author = {Mexi, Gioni and Shamsi, Somayeh and Besançon, Mathieu and le Bodic, Pierre},
      title = {Probabilistic Lookahead Strong Branching Via a Stochastic Abstract Branching Model}
    }

13. Eifler, L., Witzig, J., and Gleixner, A. (2024, May 22). Branch and Cut for Partitioning a Graph Into a Cycle of Clusters. Proceedings of the International Symposium on Combinatorial Optimization. DOI: 10.1007/978-3-031-60924-4_8 [arXiv]
    [BibTeX]

    @inproceedings{2024_EiflerWitzigGleixner_Branchcutcycleclustering,
      year = {2024},
      date = {2024-05-22},
      booktitle = {Proceedings of the International Symposium on Combinatorial Optimization},
      doi = {10.1007/978-3-031-60924-4_8},
      archiveprefix = {arXiv},
      eprint = {2401.08412},
      arxiv = {arXiv:2401.08412},
      primaryclass = {math.OC},
      author = {Eifler, Leon and Witzig, Jakob and Gleixner, Ambros},
      title = {Branch and Cut for Partitioning a Graph Into a Cycle of Clusters}
    }

14. Ghannam, M., Mexi, G., Lam, E., and Gleixner, A. (2024, March 10). Branch and Price for the Length-constrained Cycle Partition Problem. Proceedings of the INFORMS Optimization Society Conference. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2024_GhannamMexiLamGleixner_Branchpricelccp,
      year = {2024},
      date = {2024-03-10},
      booktitle = {Proceedings of the INFORMS Optimization Society Conference},
      url = {https://sites.google.com/view/ios2024refereed},
      archiveprefix = {arXiv},
      eprint = {2401.17937},
      arxiv = {arXiv:2401.17937},
      primaryclass = {math.OC},
      author = {Ghannam, Mohammed and Mexi, Gioni and Lam, Edward and Gleixner, Ambros},
      title = {Branch and Price for the Length-constrained Cycle Partition Problem}
    }

15. Hoen, A., Oertel, A., Gleixner, A., and Nordström, J. (2024). Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs. Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 310–328. DOI: 10.1007/978-3-031-60597-0_20 [arXiv]
    [BibTeX]

    @inproceedings{2024_HoenOertelGleixnerNordstrm_Mippresolvecertification,
      year = {2024},
      date = {2024-05-25},
      booktitle = {Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
      pages = {310-328},
      doi = {10.1007/978-3-031-60597-0_20},
      archiveprefix = {arXiv},
      eprint = {2401.09277},
      arxiv = {arXiv:2401.09277},
      primaryclass = {math.OC},
      author = {Hoen, Alexander and Oertel, Andy and Gleixner, Ambros and Nordström, Jakob},
      title = {Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs}
    }

16. Martínez-Rubio, D., Roux, C., and Pokutta, S. (2024, March 18). Convergence and Trade-offs in Riemannian Gradient Descent and Riemannian Proximal Point. Proceedings of the International Conference on Machine Learning. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2024_MartinezrubioRouxPokutta_Riemanniangradientdescent,
      year = {2024},
      booktitle = {Proceedings of the International Conference on Machine Learning},
      url = {https://proceedings.mlr.press/v235/marti-nez-rubio24a.html},
      archiveprefix = {arXiv},
      eprint = {2403.10429},
      arxiv = {arXiv:2403.10429},
      primaryclass = {math.OC},
      author = {Martínez-Rubio, David and Roux, Christophe and Pokutta, Sebastian},
      title = {Convergence and Trade-offs in Riemannian Gradient Descent and Riemannian Proximal Point},
      date = {2024-03-18}
    }

17. 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},
      arxiv = {arXiv: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}
    }

18. Martínez-Rubio, D., and Pokutta, S. (2023, May). Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties. Proceedings of the Conference on Learning Theory. [URL] [arXiv] [poster]
    [BibTeX]

    @inproceedings{2022_MartinezrubioPokutta_Acceleratedriemannian,
      year = {2023},
      booktitle = {Proceedings of the Conference on Learning Theory},
      month = may,
      url = {https://proceedings.mlr.press/v195/martinez-rubio23a/martinez-rubio23a.pdf},
      archiveprefix = {arXiv},
      eprint = {2211.14645},
      arxiv = {arXiv:2211.14645},
      primaryclass = {math.OC},
      author = {Martínez-Rubio, David and Pokutta, Sebastian},
      title = {Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties},
      poster = {https://pokutta.com/slides/20221203_poster_neurips_riemannian.pdf}
    }

19. Martínez-Rubio, D., Roux, C., Criscitiello, C., and Pokutta, S. (2023, May 25). Accelerated Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties. Proceedings of the Conference on Neural Information Processing Systems. [arXiv]
    [BibTeX]

    @inproceedings{2023_MartinezrubioRouxCriscitielloPokutta_Riemannianminmax:1,
      year = {2023},
      booktitle = {Proceedings of the Conference on Neural Information Processing Systems},
      month = may,
      archiveprefix = {arXiv},
      eprint = {2305.16186},
      arxiv = {arXiv:2305.16186},
      primaryclass = {math.OC},
      author = {Martínez-Rubio, David and Roux, Christophe and Criscitiello, Christopher and Pokutta, Sebastian},
      title = {Accelerated Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties},
      date = {2023-05-25}
    }

20. Martínez-Rubio, D., Wirth, E., and Pokutta, S. (2023, March 24). Accelerated and Sparse Algorithms for Approximate Personalized PageRank and Beyond. Proceedings of the Conference on Learning Theory. [arXiv]
    [BibTeX]

    @inproceedings{2023_MartinezrubioWirthPokutta_Sparseapproximatepagerank,
      year = {2023},
      booktitle = {Proceedings of the Conference on Learning Theory},
      month = may,
      archiveprefix = {arXiv},
      eprint = {2303.12875},
      arxiv = {arXiv:2303.12875},
      primaryclass = {math.OC},
      author = {Martínez-Rubio, David and Wirth, Elias and Pokutta, Sebastian},
      title = {Accelerated and Sparse Algorithms for Approximate Personalized PageRank and Beyond},
      date = {2023-03-24}
    }

21. Wirth, E., Kera, H., and Pokutta, S. (2023, January). Approximate Vanishing Ideal Computations at Scale. Proceedings of the International Conference on Learning Representations. [arXiv] [slides]
    [BibTeX]

    @inproceedings{2022_WirthKeraPokutta_Approximatevanishingideal,
      year = {2023},
      booktitle = {Proceedings of the International Conference on Learning Representations},
      month = jan,
      archiveprefix = {arXiv},
      eprint = {2207.01236},
      arxiv = {arXiv:2207.01236},
      primaryclass = {cs.LG},
      author = {Wirth, Elias and Kera, Hiroshi and Pokutta, Sebastian},
      title = {Approximate Vanishing Ideal Computations at Scale},
      slides = {https://pokutta.com/slides/20220915_avi_at_scale.pdf}
    }

22. Wirth, E., Kerdreux, T., and Pokutta, S. (2023). Acceleration of Frank-Wolfe Algorithms with Open Loop Step-sizes. Proceedings of the International Conference on Artificial Intelligence and Statistics, 206, 77–100. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2022_WirthKerdreuxPokutta_Frankwolfeacceleration,
      year = {2023},
      booktitle = {Proceedings of the International Conference on Artificial Intelligence and Statistics},
      month = jan,
      volume = {206},
      pages = {77–100},
      url = {https://proceedings.mlr.press/v206/wirth23a.html},
      archiveprefix = {arXiv},
      eprint = {2205.12838},
      arxiv = {arXiv:2205.12838},
      primaryclass = {math.OC},
      author = {Wirth, Elias and Kerdreux, Thomas and Pokutta, Sebastian},
      title = {Acceleration of Frank-Wolfe Algorithms with Open Loop Step-sizes}
    }

23. Chmiela, A., Gleixner, A., Lichocki, P., and Pokutta, S. (2023). Online Learning for Scheduling MIP Heuristics. Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 114–123. DOI: 10.1007/978-3-031-33271-5_8 [arXiv]
    [BibTeX]

    @inproceedings{2023_ChmielaGleixnerLichockiPokutta_Onlinelearningscheduling,
      year = {2023},
      date = {2023-05-23},
      booktitle = {Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
      month = jan,
      pages = {114-123},
      doi = {10.1007/978-3-031-33271-5_8},
      archiveprefix = {arXiv},
      eprint = {2304.03755},
      arxiv = {arXiv:2304.03755},
      primaryclass = {math.OC},
      author = {Chmiela, Antonia and Gleixner, Ambros and Lichocki, Pawel and Pokutta, Sebastian},
      title = {Online Learning for Scheduling MIP Heuristics}
    }

24. Bestuzheva, K., Gleixner, A., and Achterberg, T. (2023). Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms. Proceedings of the Conference on Integer Programming and Combinatorial Optimization, 14–28. DOI: 10.1007/978-3-031-32726-1_2 [arXiv]
    [BibTeX]

    @inproceedings{2022_BestuzhevaGleixnerAchterberg_Rltcutsbilinear:1,
      year = {2023},
      date = {2023-05-22},
      booktitle = {Proceedings of the Conference on Integer Programming and Combinatorial Optimization},
      pages = {14-28},
      doi = {10.1007/978-3-031-32726-1_2},
      archiveprefix = {arXiv},
      eprint = {2211.13545},
      arxiv = {arXiv:2211.13545},
      primaryclass = {math.OC},
      author = {Bestuzheva, Ksenia and Gleixner, Ambros and Achterberg, Tobias},
      title = {Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms}
    }

25. Turner, M., Berthold, T., Besançon, M., and Koch, T. (2023). Cutting Plane Selection with Analytic Centers and Multiregression. Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research. [arXiv]
    [BibTeX]

    @inproceedings{2022_TurnerBertholdBesanconKoch_Cuttingplanemultiregression,
      year = {2023},
      booktitle = {Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
      archiveprefix = {arXiv},
      eprint = {2212.07231},
      arxiv = {arXiv:2212.07231},
      primaryclass = {math.OC},
      author = {Turner, Mark and Berthold, Timo and Besançon, Mathieu and Koch, Thorsten},
      title = {Cutting Plane Selection with Analytic Centers and Multiregression}
    }

26. Chmiela, A., Muñoz, G., and Serrano, F. (2023, January 1). Monoidal Strengthening and Unique Lifting in MIQCPs. Proceedings of the Conference on Integer Programming and Combinatorial Optimization. [URL]
    [BibTeX]

    @inproceedings{2023_ChmielaMuozSerrano_Monoidalstrengthening:1,
      year = {2023},
      date = {2023-01-01},
      booktitle = {Proceedings of the Conference on Integer Programming and Combinatorial Optimization},
      url = {https://gonzalomunoz.org/monoidalforMIQCP.pdf},
      author = {Chmiela, Antonia and Muñoz, Gonzalo and Serrano, Felipe},
      title = {Monoidal Strengthening and Unique Lifting in MIQCPs}
    }

27. Criscitiello, C., Martínez-Rubio, D., and Boumal, N. (2023, July 25). Open Problem: Polynomial Linearly-convergent Method for G-convex Optimization? Proceedings of the Conference on Learning Theory. [arXiv]
    [BibTeX]

    @inproceedings{2023_CriscitielloMartinezrubioBoumal_Polynomialconvergence,
      year = {2023},
      booktitle = {Proceedings of the Conference on Learning Theory},
      archiveprefix = {arXiv},
      eprint = {2307.12743},
      arxiv = {arXiv:2307.12743},
      primaryclass = {math.OC},
      author = {Criscitiello, Christopher and Martínez-Rubio, David and Boumal, Nicolas},
      title = {Open Problem: Polynomial Linearly-convergent Method for G-convex Optimization?},
      date = {2023-07-25}
    }

28. Ghannam, M., and Gleixner, A. (2023, July 21). Hybrid Genetic Search for Dynamic Vehicle Routing with Time Windows. Proceedings of the Conference of the Society for Operations Research in Germany. [arXiv]
    [BibTeX]

    @inproceedings{2023_GhannamGleixner_Hybridgeneticsearch,
      year = {2023},
      booktitle = {Proceedings of the Conference of the Society for Operations Research in Germany},
      archiveprefix = {arXiv},
      eprint = {2307.11800},
      arxiv = {arXiv:2307.11800},
      primaryclass = {cs.NE},
      author = {Ghannam, Mohammed and Gleixner, Ambros},
      title = {Hybrid Genetic Search for Dynamic Vehicle Routing with Time Windows},
      date = {2023-07-21}
    }

29. Mexi, G., Berthold, T., Gleixner, A., and Nordström, J. (2023). Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning. Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming (CP 2023), 280, 27:1–27:19, DOI: 10.4230/LIPIcs.CP.2023.27 [arXiv]
    [BibTeX]

    @inproceedings{2023_MexiBertholdGleixnerNordstrm_ConflictanalysisPseudoboolean,
      year = {2023},
      booktitle = {Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming (CP 2023)},
      volume = {280},
      pages = {27:1-27:19,},
      doi = {10.4230/LIPIcs.CP.2023.27},
      archiveprefix = {arXiv},
      eprint = {2307.14166},
      arxiv = {arXiv:2307.14166},
      primaryclass = {math.OC},
      author = {Mexi, Gioni and Berthold, Timo and Gleixner, Ambros and Nordström, Jakob},
      title = {Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning},
      date = {2023-07-27}
    }

30. Mexi, G., Besançon, M., Bolusani, S., Chmiela, A., Hoen, A., and Gleixner, A. (2025, September 27). Scylla: a Matrix-free Fix-propagate-and-project Heuristic for Mixed-integer Optimization. Proceedings of the Conference of the Society for Operations Research in Germany. DOI: 10.1007/978-3-031-58405-3_9 [arXiv]
    [BibTeX]

    @inproceedings{2023_MexiEtAl_Scyllaheuristic,
      year = {2023},
      date = {2025-09-27},
      booktitle = {Proceedings of the Conference of the Society for Operations Research in Germany},
      doi = {10.1007/978-3-031-58405-3_9},
      archiveprefix = {arXiv},
      eprint = {2307.03466},
      arxiv = {arXiv:2307.03466},
      primaryclass = {math.OC},
      author = {Mexi, Gioni and Besançon, Mathieu and Bolusani, Suresh and Chmiela, Antonia and Hoen, Alexander and Gleixner, Ambros},
      title = {Scylla: a Matrix-free Fix-propagate-and-project Heuristic for Mixed-integer Optimization}
    }

31. Turner, M., Berthold, T., and Besançon, M. (2023, July 14). A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming. Proceedings of the Conference of the Society for Operations Research in Germany. [arXiv]
    [BibTeX]

    @inproceedings{2023_TurnerBertholdBesancon_Contextawarecuttingplane,
      year = {2023},
      booktitle = {Proceedings of the Conference of the Society for Operations Research in Germany},
      archiveprefix = {arXiv},
      eprint = {2307.07322},
      arxiv = {arXiv:2307.07322},
      primaryclass = {math.OC},
      author = {Turner, Mark and Berthold, Timo and Besançon, Mathieu},
      title = {A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming},
      date = {2023-07-14}
    }

32. Gasse, M., Bowly, S., Cappart, Q., Charfreitag, J., Charlin, L., Chételat, D., Chmiela, A., Dumouchelle, J., Gleixner, A., Kazachkov, A. M., Khalil, E., Lichocki, P., Lodi, A., Lubin, M., Maddison, C. J., Christopher, M., Papageorgiou, D. J., Parjadis, A., Pokutta, S., … Kun, M. (2022). The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights. Proceedings of the Conference on Neural Information Processing Systems, 176, 220–231. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2022_GasseEtAl_Ml4coinsights,
      year = {2022},
      booktitle = {Proceedings of the Conference on Neural Information Processing Systems},
      month = jun,
      volume = {176},
      pages = {220–231},
      url = {https://proceedings.mlr.press/v176/gasse22a.html},
      archiveprefix = {arXiv},
      eprint = {2203.02433},
      arxiv = {arXiv:2203.02433},
      primaryclass = {cs.LG},
      author = {Gasse, Maxime and Bowly, Simon and Cappart, Quentin and Charfreitag, Jonas and Charlin, Laurent and Chételat, Didier and Chmiela, Antonia and Dumouchelle, Justin and Gleixner, Ambros and Kazachkov, Aleksandr M. and Khalil, Elias and Lichocki, Pawel and Lodi, Andrea and Lubin, Miles and Maddison, Chris J. and Christopher, Morris and Papageorgiou, Dimitri J. and Parjadis, Augustin and Pokutta, Sebastian and Prouvost, Antoine and Scavuzzo, Lara and Zarpellon, Giulia and Yang, Linxin and Lai, Sha and Wang, Akang and Luo, Xiaodong and Zhou, Xiang and Huang, Haohan and Shao, Shengcheng and Zhu, Yuanming and Zhang, Dong and Quan, Tao and Cao, Zixuan and Xu, Yang and Huang, Zhewei and Zhou, Shuchang and Binbin, Chen and Minggui, He and Hao, Hao and Zhiyu, Zhang and Zhiwu, An and Kun, Mao},
      title = {The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights},
      date = {2022-03-04}
    }

33. Macdonald, J., Besançon, M., and Pokutta, S. (2022, May). Interpretable Neural Networks with Frank-Wolfe: Sparse Relevance Maps and Relevance Orderings. Proceedings of the International Conference on Machine Learning. [arXiv] [poster] [video]
    [BibTeX]

    @inproceedings{2021_MacdonaldBesanconPokutta_Interpretableneuralnetworks,
      year = {2022},
      booktitle = {Proceedings of the International Conference on Machine Learning},
      month = may,
      archiveprefix = {arXiv},
      eprint = {2110.08105},
      arxiv = {arXiv:2110.08105},
      primaryclass = {cs.LG},
      author = {Macdonald, Jan and Besançon, Mathieu and Pokutta, Sebastian},
      title = {Interpretable Neural Networks with Frank-Wolfe: Sparse Relevance Maps and Relevance Orderings},
      poster = {https://pokutta.com/slides/20220712_icml_poster_interpretable_rde.pdf},
      video = {https://slideslive.com/38983588}
    }

34. Búi, M. N., Combettes, P. L., and Woodstock, Z. (2022). Block-activated Algorithms for Multicomponent Fully Nonsmooth Minimization. Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, 5428–5432. DOI: 10.1109/ICASSP43922.2022.9747479 [URL] [arXiv]
    [BibTeX]

    @inproceedings{2022_BiCombettesWoodstock_Blockactivatedminimization,
      year = {2022},
      booktitle = {Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing},
      month = may,
      pages = {5428-5432},
      doi = {10.1109/ICASSP43922.2022.9747479},
      url = {https://zevwoodstock.github.io/media/publications/icassp2022-2.pdf},
      archiveprefix = {arXiv},
      eprint = {2103.00520},
      arxiv = {arXiv:2103.00520},
      primaryclass = {math.OC},
      author = {Búi, M. N. and Combettes, Patrick L. and Woodstock, Zev},
      title = {Block-activated Algorithms for Multicomponent Fully Nonsmooth Minimization}
    }

35. Wirth, E., and Pokutta, S. (2022, February 7). Conditional Gradients for the Approximately Vanishing Ideal. Proceedings of the International Conference on Artificial Intelligence and Statistics. [arXiv] [summary] [poster] [code]
    [BibTeX]

    @inproceedings{2022_WirthPokutta_Conditionalgradients,
      year = {2022},
      booktitle = {Proceedings of the International Conference on Artificial Intelligence and Statistics},
      month = jan,
      archiveprefix = {arXiv},
      eprint = {2202.03349},
      arxiv = {arXiv:2202.03349},
      primaryclass = {cs.LG},
      author = {Wirth, Elias and Pokutta, Sebastian},
      title = {Conditional Gradients for the Approximately Vanishing Ideal},
      code = {https://github.com/ZIB-IOL/cgavi/},
      poster = {https://pokutta.com/slides/20220223_CGAVI_poster.pdf},
      summary = {https://pokutta.com/blog/research/2022/02/20/CGAVI.html},
      date = {2022-02-07}
    }

36. Criado, F., Martínez-Rubio, D., and Pokutta, S. (2022). Fast Algorithms for Packing Proportional Fairness and Its Dual. Proceedings of the Conference on Neural Information Processing Systems. [arXiv] [poster]
    [BibTeX]

    @inproceedings{2021_CriadoMartinezrubioPokutta_Packingproportionalfairness,
      year = {2022},
      booktitle = {Proceedings of the Conference on Neural Information Processing Systems},
      archiveprefix = {arXiv},
      eprint = {2109.03678},
      arxiv = {arXiv:2109.03678},
      primaryclass = {math.OC},
      author = {Criado, Francisco and Martínez-Rubio, David and Pokutta, Sebastian},
      title = {Fast Algorithms for Packing Proportional Fairness and Its Dual},
      poster = {https://pokutta.com/slides/20211105_fairpacking-poster.pdf}
    }

37. Bestuzheva, K., Gleixner, A., and Völker, H. (2022). Strengthening SONC Relaxations with Constraints Derived From Variable Bounds. Proceedings of the Hungarian Global Optimization Workshop HUGO, 41–44. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2023_BestuzhevaGleixnerVlker_Soncconstraints,
      year = {2022},
      booktitle = {Proceedings of the Hungarian Global Optimization Workshop HUGO},
      pages = {41-44},
      url = {https://inf.u-szeged.hu/hugo/},
      archiveprefix = {arXiv},
      eprint = {2304.12145},
      arxiv = {arXiv:2304.12145},
      primaryclass = {math.OC},
      author = {Bestuzheva, Ksenia and Gleixner, Ambros and Völker, Helena},
      title = {Strengthening SONC Relaxations with Constraints Derived From Variable Bounds}
    }

38. Sofranac, B., Gleixner, A., and Pokutta, S. (2021). An Algorithm-independent Measure of Progress for Linear Constraint Propagation. Proceedings of the International Conference on Principles and Practice of Constraint Programming, 52:1–17. DOI: 10.4230/LIPIcs.CP.2021.52 [URL] [arXiv] [video]
    [BibTeX]

    @inproceedings{2021_SofranacGleixnerPokutta_Progressmeasure:1,
      year = {2021},
      booktitle = {Proceedings of the International Conference on Principles and Practice of Constraint Programming},
      month = jun,
      pages = {52:1–17},
      doi = {10.4230/LIPIcs.CP.2021.52},
      url = {https://drops.dagstuhl.de/opus/volltexte/2021/15343/},
      archiveprefix = {arXiv},
      eprint = {2106.07573},
      arxiv = {arXiv:2106.07573},
      primaryclass = {math.OC},
      author = {Sofranac, Boro and Gleixner, Ambros and Pokutta, Sebastian},
      title = {An Algorithm-independent Measure of Progress for Linear Constraint Propagation},
      video = {https://youtu.be/paZtGYlkBfE},
      date = {2021-06-14}
    }

39. Carderera, A., Besançon, M., and Pokutta, S. (2021). Simple Steps Are All You Need: Frank-Wolfe and Generalized Self-concordant Functions. Proceedings of the Conference on Neural Information Processing Systems, 34, 5390–5401. [URL] [arXiv] [summary] [slides] [poster] [code]
    [BibTeX]

    @inproceedings{2024_CardereraBesanconPokutta_Scalablefrankwolfe:1,
      year = {2021},
      booktitle = {Proceedings of the Conference on Neural Information Processing Systems},
      month = may,
      volume = {34},
      pages = {5390–5401},
      url = {https://proceedings.neurips.cc/paper_files/paper/2021/file/2b323d6eb28422cef49b266557dd31ad-Paper.pdf},
      archiveprefix = {arXiv},
      eprint = {2105.13913},
      arxiv = {arXiv:2105.13913},
      primaryclass = {math.OC},
      author = {Carderera, Alejandro and Besançon, Mathieu and Pokutta, Sebastian},
      title = {Simple Steps Are All You Need: Frank-Wolfe and Generalized Self-concordant Functions},
      code = {https://doi.org/10.5281/zenodo.4836009},
      poster = {https://pokutta.com/slides/20211120_poster_NeurIPS21_lSimple_steps_are_all_you_need.pdf},
      slides = {https://pokutta.com/slides/20210710_FW-simpleSteps-SelfConcordance.pdf},
      summary = {https://pokutta.com/blog/research/2021/10/09/self-concordant-abstract.html},
      date = {2021-05-28}
    }

40. Chmiela, A., Khalil, E. B., Gleixner, A., Lodi, A., and Pokutta, S. (2021). Learning to Schedule Heuristics in Branch-and-bound. Proceedings of the Conference on Neural Information Processing Systems, 34, 24235–24246. [URL] [arXiv] [poster]
    [BibTeX]

    @inproceedings{2021_ChmielaEtAl_Heuristicscheduling,
      year = {2021},
      booktitle = {Proceedings of the Conference on Neural Information Processing Systems},
      month = mar,
      volume = {34},
      pages = {24235–24246},
      url = {https://proceedings.neurips.cc/paper_files/paper/2021/file/cb7c403aa312160380010ee3dd4bfc53-Paper.pdf},
      archiveprefix = {arXiv},
      eprint = {2103.10294},
      arxiv = {arXiv:2103.10294},
      primaryclass = {cs.LG},
      author = {Chmiela, Antonia and Khalil, Elias B. and Gleixner, Ambros and Lodi, Andrea and Pokutta, Sebastian},
      title = {Learning to Schedule Heuristics in Branch-and-bound},
      poster = {https://pokutta.com/slides/20211120_poster_NeurIPS21_learningheuristics.pdf},
      date = {2021-03-19}
    }

41. Carderera, A., Diakonikolas, J., Lin, C. Y., and Pokutta, S. (2021, February 12). Parameter-free Locally Accelerated Conditional Gradients. Proceedings of the International Conference on Machine Learning. [arXiv] [slides]
    [BibTeX]

    @inproceedings{2021_CardereraDiakonikolasLinPokutta_ParameterfreeLocallyAccelerated,
      year = {2021},
      booktitle = {Proceedings of the International Conference on Machine Learning},
      month = feb,
      archiveprefix = {arXiv},
      eprint = {2102.06806},
      arxiv = {arXiv:2102.06806},
      primaryclass = {math.OC},
      author = {Carderera, Alejandro and Diakonikolas, Jelena and Lin, Cheuk Yin and Pokutta, Sebastian},
      title = {Parameter-free Locally Accelerated Conditional Gradients},
      slides = {https://pokutta.com/slides/20210716_PF_LaCG_Poster.pdf},
      date = {2021-02-12}
    }

42. Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2021, January). Projection-Free Optimization on Uniformly Convex Sets. Proceedings of the International Conference on Artificial Intelligence and Statistics. [arXiv] [slides]
    [BibTeX]

    @inproceedings{2021_KerdrexDaspremontPokutta_ProjectionFreeOptimization,
      year = {2021},
      booktitle = {Proceedings of the International Conference on Artificial Intelligence and Statistics},
      month = jan,
      archiveprefix = {arXiv},
      eprint = {2004.11053},
      arxiv = {arXiv:2004.11053},
      primaryclass = {math.OC},
      author = {Kerdreux, Thomas and d'Aspremont, Alexandre and Pokutta, Sebastian},
      title = {Projection-Free Optimization on Uniformly Convex Sets},
      slides = {https://app.box.com/s/36wj0o8le96rrfdxec774wk7rrdp2vlm}
    }

43. Chmiela, A., Muñoz, G., and Serrano, F. (2021). On the Implementation and Strengthening of Intersection Cuts for QCQPs. Proceedings of the Conference on Integer Programming and Combinatorial Optimization, 134–147. DOI: 10.1007/978-3-030-73879-2_10
    [BibTeX]

    @inproceedings{2022_ChmielaMuozSerrano_Intersectioncutsqcqps:1,
      year = {2021},
      booktitle = {Proceedings of the Conference on Integer Programming and Combinatorial Optimization},
      pages = {134-147},
      doi = {10.1007/978-3-030-73879-2_10},
      author = {Chmiela, Antonia and Muñoz, Gonzalo and Serrano, Felipe},
      title = {On the Implementation and Strengthening of Intersection Cuts for QCQPs}
    }

44. Sofranac, B., Gleixner, A., and Pokutta, S. (2020). Accelerating Domain Propagation: An Efficient GPU-parallel Algorithm Over Sparse Matrices. Proceedings of the 10th IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms, IA3 2020, 1–11. DOI: 10.1109/IA351965.2020.00007 [arXiv] [summary] [slides] [video]
    [BibTeX]

    @inproceedings{2020_SofranacGleixnerPokutta_Domainpropagation:1,
      year = {2020},
      booktitle = {Proceedings of the 10th IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms, IA3 2020},
      month = sep,
      pages = {1-11},
      doi = {10.1109/IA351965.2020.00007},
      archiveprefix = {arXiv},
      eprint = {2009.07785},
      arxiv = {arXiv:2009.07785},
      primaryclass = {cs.DC},
      author = {Sofranac, Boro and Gleixner, Ambros and Pokutta, Sebastian},
      title = {Accelerating Domain Propagation: An Efficient GPU-parallel Algorithm Over Sparse Matrices},
      slides = {https://app.box.com/s/qy0pjmhtbm7shk2ypxjxlh2sj4nudvyu},
      summary = {https://pokutta.com/blog/research/2020/09/20/gpu-prob.html},
      video = {https://youtu.be/7mERPal9pVs},
      date = {2020-09-16}
    }

45. Combettes, C., and Pokutta, S. (2020, March 13). Boosting Frank-Wolfe by Chasing Gradients. Proceedings of the International Conference on Machine Learning. [URL] [arXiv] [slides] [code] [video]
    [BibTeX]

    @inproceedings{2020_CombettesPokutta_BoostingFrankWolfe,
      year = {2020},
      booktitle = {Proceedings of the International Conference on Machine Learning},
      month = mar,
      url = {https://proceedings.mlr.press/v119/combettes20a.html},
      archiveprefix = {arXiv},
      eprint = {2003.06369},
      arxiv = {arXiv:2003.06369},
      primaryclass = {math.OC},
      author = {Combettes, Cyrille and Pokutta, Sebastian},
      title = {Boosting Frank-Wolfe by Chasing Gradients},
      code = {https://github.com/cyrillewcombettes/boostfw},
      slides = {https://app.box.com/s/wwj247r5d456q0778p9b9y1jm6txuifb},
      video = {https://youtube.com/watch?v=BfyV0C5FRbE},
      date = {2020-03-13}
    }

46. Diakonikolas, J., Carderera, A., and Pokutta, S. (2020). Locally Accelerated Conditional Gradients. Proceedings of the International Conference on Artificial Intelligence and Statistics. [URL] [arXiv] [slides] [code]
    [BibTeX]

    @inproceedings{2019_DiakonikolasCardereraPokutta_BreakingCurse:1,
      year = {2020},
      booktitle = {Proceedings of the International Conference on Artificial Intelligence and Statistics},
      url = {https://proceedings.mlr.press/v108/diakonikolas20a/diakonikolas20a.pdf},
      archiveprefix = {arXiv},
      eprint = {1906.07867},
      arxiv = {arXiv:1906.07867},
      primaryclass = {math.OC},
      author = {Diakonikolas, Jelena and Carderera, Alejandro and Pokutta, Sebastian},
      title = {Locally Accelerated Conditional Gradients},
      code = {https://colab.research.google.com/drive/1ejjfCan7xnEhWWJXCIzb03CwQRG9iW_O},
      slides = {https://app.box.com/s/gphkhapso7d1vrfnzqykkb3vx0agxh8w}
    }

47. Pokutta, S., Singh, M., and Torrico Palacios, A. (2020, February 12). On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness. Proceedings of the International Conference on Machine Learning. [arXiv] [slides] [video]
    [BibTeX]

    @inproceedings{2019_PokuttaSinghTorrico_UnreasonableEffectiveness:1,
      year = {2020},
      booktitle = {Proceedings of the International Conference on Machine Learning},
      archiveprefix = {arXiv},
      eprint = {2002.04063},
      arxiv = {arXiv:2002.04063},
      primaryclass = {cs.DS},
      author = {Pokutta, Sebastian and Singh, Mohit and Torrico Palacios, Alfredo},
      title = {On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness},
      slides = {https://app.box.com/s/fmjxhfdpiqubm28upf563ohy8t8fgl3a},
      video = {https://youtube.com/watch?v=VB1e0HrDmVo},
      date = {2020-02-12}
    }

48. Braun, G., Pokutta, S., Tu, D., and Wright, S. (2019). Blended Conditional Gradients: the Unconditioning of Conditional Gradients. Proceedings of the International Conference on Machine Learning, 97, 735–743. [URL] [arXiv] [summary] [slides] [poster] [code]
    [BibTeX]

    @inproceedings{2018_BraunPokuttaTuStephen_Blendedconditionalgradients,
      year = {2019},
      booktitle = {Proceedings of the International Conference on Machine Learning},
      volume = {97},
      pages = {735–743},
      url = {https://proceedings.mlr.press/v97/braun19a},
      archiveprefix = {arXiv},
      eprint = {1805.07311},
      arxiv = {arXiv:1805.07311},
      primaryclass = {math.OC},
      author = {Braun, Gábor and Pokutta, Sebastian and Tu, Dan and Wright, Stephen},
      title = {Blended Conditional Gradients: the Unconditioning of Conditional Gradients},
      code = {https://github.com/pokutta/bcg},
      poster = {https://app.box.com/s/nmmm671jd72i397nysa8emfnzh1hn6hf},
      slides = {https://app.box.com/s/xbx3z7ws6dxvl3rzgj4jp6forigycooe},
      summary = {https://pokutta.com/blog/research/2019/02/18/bcg-abstract.html}
    }

49. Anari, N., Haghtalab, N., Naor, S., Pokutta, S., Singh, M., and Torrico Palacios, A. (2019). Structured Robust Submodular Maximization: Offline and Online Algorithms. Proceedings of the International Conference on Artificial Intelligence and Statistics. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2019_AnariHaghtalabNaorPokuttaSinghTorrico_StructuredRobustSubmodular:1,
      year = {2019},
      booktitle = {Proceedings of the International Conference on Artificial Intelligence and Statistics},
      url = {https://proceedings.mlr.press/v89/anari19a/anari19a.pdf},
      archiveprefix = {arXiv},
      eprint = {1710.04740},
      arxiv = {arXiv:1710.04740},
      primaryclass = {cs.DS},
      author = {Anari, N. and Haghtalab, N. and Naor, S. and Pokutta, Sebastian and Singh, Mohit and Torrico Palacios, Alfredo},
      title = {Structured Robust Submodular Maximization: Offline and Online Algorithms}
    }

50. Combettes, C., and Pokutta, S. (2019, April 28). Blended Matching Pursuit. Proceedings of the Conference on Neural Information Processing Systems. [URL] [arXiv] [slides] [code]
    [BibTeX]

    @inproceedings{2019_CombettesPokutta_BlendedMatching,
      year = {2019},
      booktitle = {Proceedings of the Conference on Neural Information Processing Systems},
      url = {https://papers.nips.cc/paper/8478-blended-matching-pursuit},
      archiveprefix = {arXiv},
      eprint = {1904.12335},
      arxiv = {arXiv:1904.12335},
      primaryclass = {math.OC},
      author = {Combettes, Cyrille and Pokutta, Sebastian},
      title = {Blended Matching Pursuit},
      code = {https://colab.research.google.com/drive/17XYIxnCcJjKswba9mAaXFWnNGVZdsaXQ},
      slides = {https://app.box.com/s/8lfktq6h3dqp9t2gqydu2tp8h2uxgz7m},
      date = {2019-04-28}
    }

51. Diakonikolas, J., Carderera, A., and Pokutta, S. (2019, June 19). Breaking the Curse of Dimensionality (Locally) to Accelerate Conditional Gradients. Proceedings of the Optimization for Machine Learning. [URL] [arXiv] [slides] [code]
    [BibTeX]

    @inproceedings{2019_DiakonikolasCardereraPokutta_BreakingCurse,
      year = {2019},
      booktitle = {Proceedings of the Optimization for Machine Learning},
      url = {https://opt-ml.org/papers/2019/paper_26.pdf},
      archiveprefix = {arXiv},
      eprint = {1906.07867},
      arxiv = {arXiv:1906.07867},
      primaryclass = {math.OC},
      author = {Diakonikolas, Jelena and Carderera, Alejandro and Pokutta, Sebastian},
      title = {Breaking the Curse of Dimensionality (Locally) to Accelerate Conditional Gradients},
      code = {https://colab.research.google.com/drive/1ejjfCan7xnEhWWJXCIzb03CwQRG9iW_O},
      slides = {https://app.box.com/s/gphkhapso7d1vrfnzqykkb3vx0agxh8w},
      date = {2019-06-19}
    }

52. Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2019). Restarting Frank-Wolfe. Proceedings of the International Conference on Artificial Intelligence and Statistics. [URL] [arXiv] [slides]
    [BibTeX]

    @inproceedings{2019_KerdrexDaspremontPokutta_RestartingFrankWolfe:1,
      year = {2019},
      booktitle = {Proceedings of the International Conference on Artificial Intelligence and Statistics},
      url = {https://proceedings.mlr.press/v89/kerdreux19a/kerdreux19a.pdf},
      archiveprefix = {arXiv},
      eprint = {1810.02429},
      arxiv = {arXiv:1810.02429},
      primaryclass = {math.OC},
      author = {Kerdreux, Thomas and d'Aspremont, Alexandre and Pokutta, Sebastian},
      title = {Restarting Frank-Wolfe},
      slides = {https://app.box.com/s/prd32r6xmuef2k4gah23rd0egllz9rv5}
    }

53. Pokutta, S., Singh, M., and Torrico Palacios, A. (2019). On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness. Proceedings of the Optimization for Machine Learning. [URL] [arXiv] [slides] [video]
    [BibTeX]

    @inproceedings{2019_PokuttaSinghTorrico_UnreasonableEffectiveness,
      year = {2019},
      booktitle = {Proceedings of the Optimization for Machine Learning},
      url = {https://opt-ml.org/papers/2019/paper_16.pdf},
      archiveprefix = {arXiv},
      eprint = {2002.04063},
      arxiv = {arXiv:2002.04063},
      primaryclass = {cs.DS},
      author = {Pokutta, Sebastian and Singh, Mohit and Torrico Palacios, Alfredo},
      title = {On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness},
      slides = {https://app.box.com/s/fmjxhfdpiqubm28upf563ohy8t8fgl3a},
      video = {https://youtube.com/watch?v=VB1e0HrDmVo}
    }

54. Pokutta, S., Singh, M., and Torrico Palacios, A. (2018, July 26). Efficient Algorithms for Robust Submodular Maximization Under Matroid Constraints. Proceedings of the ICML Workshop Paper. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2018_PokuttaSinghTorrico_EfficientAlgorithms,
      year = {2018},
      booktitle = {Proceedings of the ICML Workshop Paper},
      url = {https://sites.google.com/view/icml2018nonconvex/papers},
      archiveprefix = {arXiv},
      eprint = {1807.09405},
      arxiv = {arXiv:1807.09405},
      primaryclass = {cs.DS},
      author = {Pokutta, Sebastian and Singh, Mohit and Torrico Palacios, Alfredo},
      title = {Efficient Algorithms for Robust Submodular Maximization Under Matroid Constraints},
      date = {2018-07-26}
    }

55. Braun, G., Pokutta, S., and Zink, D. (2017). Lazifying Conditional Gradient Algorithms. Proceedings of the International Conference on Machine Learning, 70, 566–575. [URL] [arXiv] [slides] [poster]
    [BibTeX]

    @inproceedings{2016_BraunPokuttaZink_Lazifyinggradientalgorithms:1,
      year = {2017},
      booktitle = {Proceedings of the International Conference on Machine Learning},
      volume = {70},
      pages = {566–575},
      url = {https://proceedings.mlr.press/v70/braun17a},
      archiveprefix = {arXiv},
      eprint = {1610.05120},
      arxiv = {arXiv:1610.05120},
      primaryclass = {cs.DS},
      author = {Braun, Gábor and Pokutta, Sebastian and Zink, Daniel},
      title = {Lazifying Conditional Gradient Algorithms},
      poster = {https://app.box.com/s/lysscdg17ytpz7mqr0tu2djffyqvkl6a},
      slides = {https://app.box.com/s/zsp0hixjz2ha23u1vuyosijjkjdh8k}
    }

56. Lan, G., Pokutta, S., Zhou, Y., and Zink, D. (2017, March 16). Conditional Accelerated Lazy Stochastic Gradient Descent. Proceedings of the International Conference on Machine Learning. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2017_LanPokuttaZhouZink_ConditionalAccelerated,
      year = {2017},
      booktitle = {Proceedings of the International Conference on Machine Learning},
      url = {https://proceedings.mlr.press/v70/lan17a.html},
      archiveprefix = {arXiv},
      eprint = {1703.05840},
      arxiv = {arXiv:1703.05840},
      primaryclass = {cs.LG},
      author = {Lan, G. and Pokutta, Sebastian and Zhou, Y and Zink, Daniel},
      title = {Conditional Accelerated Lazy Stochastic Gradient Descent},
      date = {2017-03-16}
    }

57. Braun, G., Pokutta, S., and Roy, A. (2016). Strong Reductions for Extended Formulations. Proceedings of the Conference on Integer Programming and Combinatorial Optimization, 9682, 350–361. DOI: 10.1007/978-3-319-33461-5_29 [arXiv]
    [BibTeX]

    @inproceedings{2015_BraunPokuttaRoy_Strongreductions:1,
      year = {2016},
      booktitle = {Proceedings of the Conference on Integer Programming and Combinatorial Optimization},
      month = jun,
      volume = {9682},
      pages = {350–361},
      doi = {10.1007/978-3-319-33461-5_29},
      archiveprefix = {arXiv},
      eprint = {1512.04932},
      arxiv = {arXiv:1512.04932},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian and Roy, Aurko},
      title = {Strong Reductions for Extended Formulations}
    }

58. Braun, G., Brown-Cohen, J., Huq, A., Pokutta, S., Raghavendra, P., Roy, A., Weitz, B., and Zink, D. (2016). The Matching Problem Has No Small Symmetric SDP. Proceedings of the Symposium on Discrete Algorithms, 1067–1078. DOI: 10.1137/1.9781611974331.ch75 [URL] [arXiv]
    [BibTeX]

    @inproceedings{2015_BraunEtAl_MatchingproblemSdp:1,
      year = {2016},
      booktitle = {Proceedings of the Symposium on Discrete Algorithms},
      pages = {1067–1078},
      doi = {10.1137/1.9781611974331.ch75},
      url = {http://ieeexplore.ieee.org/abstract/document/7447134/},
      archiveprefix = {arXiv},
      eprint = {1504.00703},
      arxiv = {arXiv:1504.00703},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Brown-Cohen, Jonah and Huq, Arefin and Pokutta, Sebastian and Raghavendra, Prasad and Roy, Aurko and Weitz, Benjamin and Zink, Daniel},
      title = {The Matching Problem Has No Small Symmetric SDP}
    }

59. Roy, A., and Pokutta, S. (2016, October 31). Hierarchical Clustering Via Spreading Metrics. Proceedings of the Conference on Neural Information Processing Systems. [URL] [arXiv]
    [BibTeX]

    @inproceedings{2017_RoyPokutta_HierarchicalClustering:1,
      year = {2016},
      booktitle = {Proceedings of the Conference on Neural Information Processing Systems},
      url = {https://papers.nips.cc/paper/by-source-2016-1199},
      archiveprefix = {arXiv},
      eprint = {1610.09269},
      arxiv = {arXiv:1610.09269},
      primaryclass = {cs.LG},
      author = {Roy, Aurko and Pokutta, Sebastian},
      title = {Hierarchical Clustering Via Spreading Metrics},
      date = {2016-10-31}
    }

60. Braun, G., Pokutta, S., and Zink, D. (2015). Inapproximability of Combinatorial Problems Via Small LPs and SDPs. Proceedings of the Annual Symposium on Theory of Computing, 107–116. DOI: 10.1145/2746539.2746550 [arXiv] [video]
    [BibTeX]

    @inproceedings{2014_BraunPokuttaZink_Affinereductions:1,
      year = {2015},
      booktitle = {Proceedings of the Annual Symposium on Theory of Computing},
      month = jun,
      pages = {107–116},
      doi = {10.1145/2746539.2746550},
      archiveprefix = {arXiv},
      eprint = {1410.8816},
      arxiv = {arXiv:1410.8816},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian and Zink, Daniel},
      title = {Inapproximability of Combinatorial Problems Via Small LPs and SDPs},
      video = {https://youtu.be/MxLEticZ8RY}
    }

61. Braun, G., and Pokutta, S. (2015). The Matching Polytope Does Not Admit Fully-polynomial Size Relaxation Schemes. Proceedings of the Symposium on Discrete Algorithms, 837–846. DOI: 10.1137/1.9781611973730.57 [URL] [arXiv]
    [BibTeX]

    @inproceedings{2014_BraunPokutta_Matchingpolytope:1,
      year = {2015},
      booktitle = {Proceedings of the Symposium on Discrete Algorithms},
      pages = {837-846},
      doi = {10.1137/1.9781611973730.57},
      url = {https://eccc.weizmann.ac.il/report/2013/056},
      archiveprefix = {arXiv},
      eprint = {1403.6710},
      arxiv = {arXiv:1403.6710},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {The Matching Polytope Does Not Admit Fully-polynomial Size Relaxation Schemes}
    }

62. Braun, G., Firorini, S., and Pokutta, S. (2014). Average Case Polyhedral Complexity of the Maximum Stable Set Problem. Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 28, 515–530. DOI: 10.4230/LIPIcs.APPROX-RANDOM.2014.515 [URL] [arXiv]
    [BibTeX]

    @inproceedings{2013_BraunSamuelPokutta_Averagepolyhedralcomplexity:1,
      year = {2014},
      booktitle = {Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques},
      month = sep,
      volume = {28},
      pages = {515–530},
      doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.515},
      url = {https://drops.dagstuhl.de/opus/volltexte/2014/4720},
      archiveprefix = {arXiv},
      eprint = {1311.4001},
      arxiv = {arXiv:1311.4001},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Firorini, Samuel and Pokutta, Sebastian},
      title = {Average Case Polyhedral Complexity of the Maximum Stable Set Problem}
    }

63. Braun, G., Pokutta, S., and Xie, Y. (2014). Info-greedy Sequential Adaptive Compressed Sensing. Proceedings of the Allerton Conference on Communication, Control, and Computing, 858–865. DOI: 10.1109/ALLERTON.2014.7028544 [arXiv]
    [BibTeX]

    @inproceedings{2014_BraunPokuttaYao_Infogreedycompressedsensing:1,
      year = {2014},
      booktitle = {Proceedings of the Allerton Conference on Communication, Control, and Computing},
      pages = {858–865},
      doi = {10.1109/ALLERTON.2014.7028544},
      archiveprefix = {arXiv},
      eprint = {1407.0731},
      arxiv = {arXiv:1407.0731},
      primaryclass = {cs.IT},
      author = {Braun, Gábor and Pokutta, Sebastian and Xie, Yao},
      title = {Info-greedy Sequential Adaptive Compressed Sensing},
      date = {2014-07-02}
    }

64. Braun, G., and Pokutta, S. (2013). Common Information and Unique Disjointness. Proceedings of the IEEE Symposium on Foundations of Computer Science, 688–697. [URL]
    [BibTeX]

    @inproceedings{2016_BraunPokutta_CommoninformationDisjointness:1,
      year = {2013},
      booktitle = {Proceedings of the IEEE Symposium on Foundations of Computer Science},
      pages = {688–697},
      url = {https://eccc.weizmann.ac.il/report/2013/056},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {Common Information and Unique Disjointness},
      date = {2013-04-05}
    }

65. Braun, G., and Pokutta, S. (2012). An Algebraic Approach to Symmetric Extended Formulations. Proceedings of the International Symposium on Combinatorial Optimization, 7422, 141–152. DOI: 10.1007/978-3-642-32147-4_14 [arXiv]
    [BibTeX]

    @inproceedings{2012_BraunPokutta_Algebraicsymmetricformulations,
      year = {2012},
      booktitle = {Proceedings of the International Symposium on Combinatorial Optimization},
      month = apr,
      volume = {7422},
      pages = {141–152},
      doi = {10.1007/978-3-642-32147-4_14},
      archiveprefix = {arXiv},
      eprint = {1206.6318},
      arxiv = {arXiv:1206.6318},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {An Algebraic Approach to Symmetric Extended Formulations},
      date = {2012-06-28}
    }

66. Braun, G., Firorini, S., Pokutta, S., and Steurer, D. (2012). Approximation Limits of Linear Programs (beyond Hierarchies). Proceedings of the IEEE Symposium on Foundations of Computer Science, 480–489. DOI: 10.1109/FOCS.2012.10 [arXiv]
    [BibTeX]

    @inproceedings{2012_BraunSamuelPokuttaSteurer_Approximationlimits:1,
      year = {2012},
      booktitle = {Proceedings of the IEEE Symposium on Foundations of Computer Science},
      pages = {480–489},
      doi = {10.1109/FOCS.2012.10},
      archiveprefix = {arXiv},
      eprint = {1204.0957},
      arxiv = {arXiv:1204.0957},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Firorini, Samuel and Pokutta, Sebastian and Steurer, David},
      title = {Approximation Limits of Linear Programs (beyond Hierarchies)},
      date = {2012-04-04}
    }

Full articles

1. Wirth, E., Pena, J., and Pokutta, S. (2025). Accelerated Affine-invariant Convergence Rates of the Frank-Wolfe Algorithm with Open-loop Step-sizes. Mathematical Programming. [arXiv]
   [BibTeX]

   @article{2023_WirthJavierPokutta_Affineinvariantconvergence,
     year = {2025},
     journal = {Mathematical Programming},
     month = dec,
     archiveprefix = {arXiv},
     eprint = {2310.04096},
     arxiv = {arXiv:2310.04096},
     primaryclass = {math.OC},
     author = {Wirth, Elias and Pena, Javier and Pokutta, Sebastian},
     title = {Accelerated Affine-invariant Convergence Rates of the Frank-Wolfe Algorithm with Open-loop Step-sizes}
   }

2. Woodstock, Z., and Pokutta, S. (2025). Splitting the Conditional Gradient Algorithm. SIAM Journal on Optimization, 35(1), 347–368. DOI: 10.1137/24M1638008 [arXiv]
   [BibTeX]

   @article{2023_WoodstockPokutta_Conditionalgradientnonconvex,
     year = {2025},
     journal = {SIAM Journal on Optimization},
     month = nov,
     volume = {35},
     number = {1},
     pages = {347-368},
     doi = {10.1137/24M1638008},
     archiveprefix = {arXiv},
     eprint = {2311.05381},
     arxiv = {arXiv:2311.05381},
     primaryclass = {math.OC},
     author = {Woodstock, Zev and Pokutta, Sebastian},
     title = {Splitting the Conditional Gradient Algorithm}
   }

3. 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. ACM Transactions on Mathematical Software. DOI: 10.48550/arXiv.2501.14613 [arXiv]
   [BibTeX]

   @article{2025_BesanconEtAl_Frankwolfelibrary,
     year = {2025},
     journal = {ACM Transactions on Mathematical Software},
     month = aug,
     doi = {10.48550/arXiv.2501.14613},
     archiveprefix = {arXiv},
     eprint = {2501.14613},
     arxiv = {arXiv:2501.14613},
     primaryclass = {math.OC},
     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}
   }

4. Wirth, E., Peña, J., and Pokutta, S. (2025). Fast Convergence of Frank-Wolfe Algorithms on Polytopes. INFORMS Journal on Mathematics of Operations Research. DOI: 10.1287/moor.2024.0580 [URL] [arXiv]
   [BibTeX]

   @article{2024_WirthJavierPokutta_Frankwolfeconvergence,
     year = {2025},
     journal = {INFORMS Journal on Mathematics of Operations Research},
     date = {2025-05-29},
     month = may,
     doi = {10.1287/moor.2024.0580},
     url = {https://pubsonline.informs.org/doi/abs/10.1287/moor.2024.0580},
     archiveprefix = {arXiv},
     eprint = {2406.18789},
     arxiv = {arXiv:2406.18789},
     primaryclass = {math.OC},
     author = {Wirth, Elias and Peña, Javier and Pokutta, Sebastian},
     title = {Fast Convergence of Frank-Wolfe Algorithms on Polytopes}
   }

5. Carderera, A., Pokutta, S., Schütte, C., and Weiser, M. (2025). An Efficient First-order Conditional Gradient Algorithm in Data-driven Sparse Identification of Nonlinear Dynamics to Solve Sparse Recovery Problems Under Noise. Journal of Computational and Applied Mathematics. DOI: 10.1016/j.cam.2025.116675 [URL] [arXiv]
   [BibTeX]

   @article{2021_CardereraPokuttaSchutteWeiser_CINDy,
     year = {2025},
     journal = {Journal of Computational and Applied Mathematics},
     date = {2025-04-01},
     month = apr,
     doi = {10.1016/j.cam.2025.116675},
     url = {https://www.sciencedirect.com/science/article/abs/pii/S037704272500189X},
     archiveprefix = {arXiv},
     eprint = {2101.02630},
     arxiv = {arXiv:2101.02630},
     primaryclass = {math.DS},
     author = {Carderera, Alejandro and Pokutta, Sebastian and Schütte, Christof and Weiser, Martin},
     title = {An Efficient First-order Conditional Gradient Algorithm in Data-driven Sparse Identification of Nonlinear Dynamics to Solve Sparse Recovery Problems Under Noise}
   }

6. Hendrych, D., Troppens, H., Besançon, M., and Pokutta, S. (2025). Convex Integer Optimization with Frank-Wolfe Methods. Mathematical Programming Computation. DOI: 10.1007/s12532-025-00288-w [URL] [arXiv] [slides] [code]
   [BibTeX]

   @article{2022_HendrychTroppensBesanconPokutta_Convexintegerfrankwolfe,
     year = {2025},
     journal = {Mathematical Programming Computation},
     date = {2025-06-28},
     month = apr,
     doi = {10.1007/s12532-025-00288-w},
     url = {https://link.springer.com/article/10.1007/s12532-025-00288-w},
     archiveprefix = {arXiv},
     eprint = {2208.11010},
     arxiv = {arXiv:2208.11010},
     primaryclass = {math.OC},
     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}
   }

7. Carderera, A., and Pokutta, S. (2025). Second-order Conditional Gradient Sliding. Fields Institute Communications. [arXiv] [code]
   [BibTeX]

   @article{2020_CarderaPokutta_SecondOrderConditional,
     year = {2025},
     journal = {Fields Institute Communications},
     month = jan,
     archiveprefix = {arXiv},
     eprint = {2002.08907},
     arxiv = {arXiv:2002.08907},
     primaryclass = {math.OC},
     author = {Carderera, Alejandro and Pokutta, Sebastian},
     title = {Second-order Conditional Gradient Sliding},
     code = {https://github.com/pokutta/Second-order-Conditional-Gradients}
   }

8. Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2025). Local and Global Uniform Convexity Conditions. Fields Institute Communications. [arXiv]
   [BibTeX]

   @article{2021_KerdrexDaspremontPokutta_LocalGlobalUniform,
     year = {2025},
     journal = {Fields Institute Communications},
     month = jan,
     archiveprefix = {arXiv},
     eprint = {2102.05134},
     arxiv = {arXiv:2102.05134},
     primaryclass = {math.OC},
     author = {Kerdreux, Thomas and d'Aspremont, Alexandre and Pokutta, Sebastian},
     title = {Local and Global Uniform Convexity Conditions}
   }

9. Halbig, K., Hoen, A., Gleixner, A., Witzig, J., and Weninger, D. (2025). A Diving Heuristic for Mixed-integer Problems with Unbounded Semi-continuous Variables. EURO Journal on Computational Optimization, 13. DOI: 10.1016/j.ejco.2025.100107 [arXiv]
   [BibTeX]

   @article{2024_HalbigEtAl_Divingheuristic,
     year = {2025},
     journal = {EURO Journal on Computational Optimization},
     volume = {13},
     doi = {10.1016/j.ejco.2025.100107},
     archiveprefix = {arXiv},
     eprint = {2403.19411},
     arxiv = {arXiv:2403.19411},
     primaryclass = {math.OC},
     author = {Halbig, Katrin and Hoen, Alexander and Gleixner, Ambros and Witzig, Jakob and Weninger, Dieter},
     title = {A Diving Heuristic for Mixed-integer Problems with Unbounded Semi-continuous Variables}
   }

10. Hoen, A., Kamp, D., and Gleixner, A. (2025). MIP-DD: A Delta Debugger for Mixed Integer Programming Solvers. INFORMS Journal on Computing. DOI: 10.1287/ijoc.2024.0844 [URL] [arXiv]
    [BibTeX]

    @article{2024_HoenKampGleixner_Mipdebugger,
      year = {2025},
      journal = {INFORMS Journal on Computing},
      date = {2025-04-10},
      doi = {10.1287/ijoc.2024.0844},
      url = {https://pubsonline.informs.org/doi/10.1287/ijoc.2024.0844},
      archiveprefix = {arXiv},
      eprint = {2405.19770},
      arxiv = {arXiv:2405.19770},
      primaryclass = {math.OC},
      author = {Hoen, Alexander and Kamp, Dominik and Gleixner, Ambros},
      title = {MIP-DD: A Delta Debugger for Mixed Integer Programming Solvers}
    }

11. Carderera, A., Besançon, M., and Pokutta, S. (2024). Scalable Frank-Wolfe on Generalized Self-concordant Functions Via Simple Steps. SIAM Journal on Optimization, 34(3), 2231–2258. DOI: 10.1137/23M1616789 [URL] [arXiv] [summary] [slides] [poster] [code]
    [BibTeX]

    @article{2024_CardereraBesanconPokutta_Scalablefrankwolfe,
      year = {2024},
      journal = {SIAM Journal on Optimization},
      date = {2024-07-02},
      month = sep,
      volume = {34},
      number = {3},
      pages = {2231-2258},
      doi = {10.1137/23M1616789},
      url = {https://epubs.siam.org/doi/full/10.1137/23M1616789?journalCode=sjope8},
      archiveprefix = {arXiv},
      eprint = {2105.13913},
      arxiv = {arXiv:2105.13913},
      primaryclass = {math.OC},
      author = {Carderera, Alejandro and Besançon, Mathieu and Pokutta, Sebastian},
      title = {Scalable Frank-Wolfe on Generalized Self-concordant Functions Via Simple Steps},
      code = {https://doi.org/10.5281/zenodo.4836009},
      poster = {https://pokutta.com/slides/20211120_poster_NeurIPS21_lSimple_steps_are_all_you_need.pdf},
      slides = {https://pokutta.com/slides/20210710_FW-simpleSteps-SelfConcordance.pdf},
      summary = {https://pokutta.com/blog/research/2021/10/09/self-concordant-abstract.html}
    }

12. Deza, A., Onn, S., Pokutta, S., and Pournin, L. (2024). Kissing Polytopes. SIAM Journal on Discrete Mathematics. [URL] [arXiv]
    [BibTeX]

    @article{2023_DezaShmuelPokuttaPournin_Kissingpolytopes,
      year = {2024},
      journal = {SIAM Journal on Discrete Mathematics},
      month = jul,
      url = {https://epubs.siam.org/eprint/GBWJEIV7BXDJDEFKATSF/full},
      archiveprefix = {arXiv},
      eprint = {2305.18597},
      arxiv = {arXiv:2305.18597},
      primaryclass = {math.MG},
      author = {Deza, Antoine and Onn, Shmuel and Pokutta, Sebastian and Pournin, Lionel},
      title = {Kissing Polytopes}
    }

13. Braun, G., Guzmán, C., and Pokutta, S. (2024). Corrections to “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization Via Information Theory.” IEEE Transactions on Information Theory, 70, 5408–5409. DOI: 10.1109/TIT.2024.3357200
    [BibTeX]

    @article{2024_BraunGuzmanPokutta_Oraclecomplexity,
      year = {2024},
      journal = {IEEE Transactions on Information Theory},
      date = {2024-06-21},
      month = jul,
      volume = {70},
      pages = {5408-5409},
      doi = {10.1109/TIT.2024.3357200},
      author = {Braun, Gábor and Guzmán, Cristóbal and Pokutta, Sebastian},
      title = {Corrections to “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization Via Information Theory”}
    }

14. Pokutta, S. (2023). The Frank-Wolfe Algorithm: a Short Introduction. Jahresbericht Der Deutschen Mathematiker-Vereinigung, 126(1), 3–35. DOI: 10.1365/s13291-023-00275-x [URL] [arXiv]
    [BibTeX]

    @article{2023_Pokutta_Frankwolfealgorithm,
      year = {2024},
      journal = {Jahresbericht der Deutschen Mathematiker-Vereinigung},
      date = {2023-12-13},
      month = mar,
      volume = {126},
      number = {1},
      pages = {3–35},
      doi = {10.1365/s13291-023-00275-x},
      url = {https://link.springer.com/article/10.1365/s13291-023-00275-x/fulltext.html},
      archiveprefix = {arXiv},
      eprint = {2311.05313},
      arxiv = {arXiv:2311.05313},
      primaryclass = {math.OC},
      author = {Pokutta, Sebastian},
      title = {The Frank-Wolfe Algorithm: a Short Introduction}
    }

15. Designolle, S., Vértesi, T., and Pokutta, S. (2024). Symmetric Multipartite Bell Inequalities Via Frank-Wolfe Algorithms. Physics Review A, 109. [arXiv]
    [BibTeX]

    @article{2024_DesignolleVertesiPokutta_SymmetricBellinequalities,
      year = {2024},
      journal = {Physics Review A},
      month = feb,
      volume = {109},
      archiveprefix = {arXiv},
      eprint = {2310.20677},
      arxiv = {arXiv:2310.20677},
      primaryclass = {quant-ph},
      author = {Designolle, Sébastien and Vértesi, Tamás and Pokutta, Sebastian},
      title = {Symmetric Multipartite Bell Inequalities Via Frank-Wolfe Algorithms}
    }

16. Bestuzheva, K., Gleixner, A., and Achterberg, T. (2024). Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms. Mathematical Programming. DOI: https://doi.org/10.1007/s10107-024-02104-0 [arXiv]
    [BibTeX]

    @article{2022_BestuzhevaGleixnerAchterberg_Rltcutsbilinear,
      year = {2024},
      journal = {Mathematical Programming},
      doi = {https://doi.org/10.1007/s10107-024-02104-0},
      archiveprefix = {arXiv},
      eprint = {2211.13545},
      arxiv = {arXiv:2211.13545},
      primaryclass = {math.OC},
      author = {Bestuzheva, Ksenia and Gleixner, Ambros and Achterberg, Tobias},
      title = {Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms}
    }

17. Bolusani, S., Besançon, M., Gleixner, A., Berthold, T., D’Ambrosio, C., Muñoz, G., Paat, J., and Thomopulos, D. (2024). The MIP Workshop 2023 Computational Competition on Reoptimization. Mathematical Programming Computation. DOI: 10.1007/s12532-024-00256-w [arXiv]
    [BibTeX]

    @article{2023_BolusaniEtAl_Mipreoptimization,
      year = {2024},
      journal = {Mathematical Programming Computation},
      date = {2024-06-06},
      doi = {10.1007/s12532-024-00256-w},
      archiveprefix = {arXiv},
      eprint = {2311.14834},
      arxiv = {arXiv:2311.14834},
      primaryclass = {math.OC},
      author = {Bolusani, Suresh and Besançon, Mathieu and Gleixner, Ambros and Berthold, Timo and D'Ambrosio, Claudia and Muñoz, Gonzalo and Paat, Joseph and Thomopulos, Dimitri},
      title = {The MIP Workshop 2023 Computational Competition on Reoptimization}
    }

18. Chmiela, A., Muñoz, G., and Serrano, F. (2024). Monoidal Strengthening and Unique Lifting in MIQCPs. Mathematical Programming B. DOI: 10.1007/s10107-024-02112-0 [URL]
    [BibTeX]

    @article{2023_ChmielaMuozSerrano_Monoidalstrengthening,
      year = {2024},
      journal = {Mathematical Programming B},
      doi = {10.1007/s10107-024-02112-0},
      url = {https://gonzalomunoz.org/monoidalforMIQCP.pdf},
      author = {Chmiela, Antonia and Muñoz, Gonzalo and Serrano, Felipe},
      title = {Monoidal Strengthening and Unique Lifting in MIQCPs}
    }

19. Eifler, L., and Gleixner, A. (2024). Safe and Verified Gomory Mixed Integer Cuts in a Rational MIP Framework. SIAM Journal on Optimization, 34(1), 742–763. DOI: 10.1137/23M156046X [URL] [arXiv]
    [BibTeX]

    @article{2023_EiflerGleixner_Gomorycuts,
      year = {2024},
      journal = {SIAM Journal on Optimization},
      date = {2024-02-16},
      volume = {34},
      number = {1},
      pages = {742-763},
      doi = {10.1137/23M156046X},
      note = {ZIB report 23-09},
      url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-90159},
      archiveprefix = {arXiv},
      eprint = {2303.12365},
      arxiv = {arXiv:2303.12365},
      primaryclass = {math.OC},
      author = {Eifler, Leon and Gleixner, Ambros},
      title = {Safe and Verified Gomory Mixed Integer Cuts in a Rational MIP Framework}
    }

20. Eifler, L., Nicolas-Thouvenin, J., and Gleixner, A. (2024). Combining Precision Boosting with LP Iterative Refinement for Exact Linear Optimization. INFORMS Journal on Computing. DOI: 10.1007/s10107-024-02104-0 [arXiv]
    [BibTeX]

    @article{2023_EiflerNicolasGleixner_Precisionboostinglp,
      year = {2024},
      journal = {INFORMS Journal on Computing},
      date = {2024-09-17},
      doi = {10.1007/s10107-024-02104-0},
      archiveprefix = {arXiv},
      eprint = {2311.08037},
      arxiv = {arXiv:2311.08037},
      primaryclass = {math.OC},
      author = {Eifler, Leon and Nicolas-Thouvenin, Jules and Gleixner, Ambros},
      title = {Combining Precision Boosting with LP Iterative Refinement for Exact Linear Optimization}
    }

21. Tjusila, G., Besançon, M., Turner, M., and Koch, T. (2024). How Many Clues To Give? A Bilevel Formulation For The Minimum Sudoku Clue Problem. Operations Research Letters. DOI: 10.1016/j.orl.2024.107105 [URL] [arXiv]
    [BibTeX]

    @article{2024_GennesaretBesanconTurnerKoch_Bilevelsudokuclue,
      year = {2024},
      journal = {Operations Research Letters},
      date = {2024-03-07},
      doi = {10.1016/j.orl.2024.107105},
      url = {https://sciencedirect.com/science/article/abs/pii/S0167637724000415},
      archiveprefix = {arXiv},
      eprint = {2305.01697},
      arxiv = {arXiv:2305.01697},
      primaryclass = {math.OC},
      author = {Tjusila, Gennesaret and Besançon, Mathieu and Turner, Mark and Koch, Thorsten},
      title = {How Many Clues To Give? A Bilevel Formulation For The Minimum Sudoku Clue Problem.}
    }

22. Kreimeier, T., Pokutta, S., Walther, A., and Woodstock, Z. (2023). On a Frank-Wolfe Approach for Abs-smooth Functions. Optimization Methods and Software. [arXiv]
    [BibTeX]

    @article{2023_KreimeierPokuttaWaltherWoodstock_Frankwolfeabssmooth,
      year = {2023},
      journal = {Optimization Methods and Software},
      month = dec,
      archiveprefix = {arXiv},
      eprint = {2303.09881},
      arxiv = {arXiv:2303.09881},
      primaryclass = {math.OC},
      author = {Kreimeier, Timo and Pokutta, Sebastian and Walther, Andrea and Woodstock, Zev},
      title = {On a Frank-Wolfe Approach for Abs-smooth Functions},
      date = {2023-03-17}
    }

23. Designolle, S., Iommazzo, G., Besançon, M., Knebel, S., Gelß, P., and Pokutta, S. (2023). Improved Local Models and New Bell Inequalities Via Frank-Wolfe Algorithms. Physical Review Research, 5(4). DOI: 10.1103/PhysRevResearch.5.043059 [arXiv] [slides] [code]
    [BibTeX]

    @article{2023_DesignolleEtAl_LocalmodelsBellinequalities,
      year = {2023},
      journal = {Physical Review Research},
      month = oct,
      volume = {5},
      number = {4},
      doi = {10.1103/PhysRevResearch.5.043059},
      archiveprefix = {arXiv},
      eprint = {2302.04721},
      arxiv = {arXiv:2302.04721},
      primaryclass = {quant-ph},
      author = {Designolle, Sébastien and Iommazzo, Gabriele and Besançon, Mathieu and Knebel, Sebastian and Gelß, Patrick and Pokutta, Sebastian},
      title = {Improved Local Models and New Bell Inequalities Via Frank-Wolfe Algorithms},
      code = {https://github.com/ZIB-IOL/BellPolytopes.jl},
      slides = {https://www.pokutta.com/slides/20230808-tokyo-bell.pdf},
      date = {2023-02-09}
    }

24. Besançon, M., Dias Garcia, J., Legat, B., and Sharma, A. (2023). Flexible Differentiable Optimization Via Model Transformations. INFORMS Journal on Computing. DOI: 10.1287/ijoc.2022.0283 [URL] [arXiv]
    [BibTeX]

    @article{2022_BesanconJoaquimBenotAkshay_Differentiableoptimization,
      year = {2023},
      journal = {INFORMS Journal on Computing},
      month = aug,
      doi = {10.1287/ijoc.2022.0283},
      url = {https://pubsonline.informs.org/doi/epdf/10.1287/ijoc.2022.0283},
      archiveprefix = {arXiv},
      eprint = {2206.06135},
      arxiv = {arXiv:2206.06135},
      primaryclass = {cs.LG},
      author = {Besançon, Mathieu and Dias Garcia, Joaquim and Legat, Benoît and Sharma, Akshay},
      title = {Flexible Differentiable Optimization Via Model Transformations}
    }

25. Hunkenschröder, C., Pokutta, S., and Weismantel, R. (2023). Minimizing a Low-dimensional Convex Function Over a High-dimensional Cube. SIAM Journal on Optimization, 33(2), 538–552. DOI: 10.1137/22M1489988 [arXiv]
    [BibTeX]

    @article{2022_HunkenschrderPokuttaWeismantel_Convexoptimization,
      year = {2023},
      journal = {SIAM Journal on Optimization},
      date = {2023-05-26},
      month = jun,
      volume = {33},
      number = {2},
      pages = {538-552},
      doi = {10.1137/22M1489988},
      archiveprefix = {arXiv},
      eprint = {2204.05266},
      arxiv = {arXiv:2204.05266},
      primaryclass = {math.OC},
      author = {Hunkenschröder, Christoph and Pokutta, Sebastian and Weismantel, Robert},
      title = {Minimizing a Low-dimensional Convex Function Over a High-dimensional Cube}
    }

26. Bestuzheva, K., Gleixner, A., and Vigerske, S. (2023). A Computational Study of Perspective Cuts. Mathematical Programming Computation, 15, 703–731. DOI: 10.1007/s12532-023-00246-4 [URL] [arXiv]
    [BibTeX]

    @article{2021_BestuzhevaGleixnerVigerske_Perspectivecuts,
      year = {2023},
      journal = {Mathematical Programming Computation},
      date = {2023-08-21},
      volume = {15},
      pages = {703-731},
      doi = {10.1007/s12532-023-00246-4},
      note = {ZIB report 21-07},
      url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-81821},
      archiveprefix = {arXiv},
      eprint = {2103.09573},
      arxiv = {arXiv:2103.09573},
      primaryclass = {math.OC},
      author = {Bestuzheva, Ksenia and Gleixner, Ambros and Vigerske, Stefan},
      title = {A Computational Study of Perspective Cuts}
    }

27. Gleixner, A., Gottwald, L., and Hoen, A. (2023). PaPILO: a Parallel Presolving Library for Integer and Linear Programming with Multiprecision Support. INFORMS Journal on Computing. DOI: 10.1287/ijoc.2022.0171 [arXiv]
    [BibTeX]

    @article{2022_GleixnerGottwaldHoen_PapiloMultiprecision,
      year = {2023},
      journal = {INFORMS Journal on Computing},
      date = {2023-06-12},
      doi = {10.1287/ijoc.2022.0171},
      archiveprefix = {arXiv},
      eprint = {2206.10709},
      arxiv = {arXiv:2206.10709},
      primaryclass = {math.OC},
      author = {Gleixner, Ambros and Gottwald, Leona and Hoen, Alexander},
      title = {PaPILO: a Parallel Presolving Library for Integer and Linear Programming with Multiprecision Support}
    }

28. Berthold, T., Mexi, G., and Salvagnin, D. (2023). Using Multiple Reference Vectors and Objective Scaling in the Feasibility Pump. EURO Journal on Computational Optimization, 11. DOI: 10.1016/j.ejco.2023.100066
    [BibTeX]

    @article{2023_BertholdMexiSalvagnin_Multiplereferencevectors,
      year = {2023},
      journal = {EURO Journal on Computational Optimization},
      volume = {11},
      doi = {10.1016/j.ejco.2023.100066},
      author = {Berthold, Timo and Mexi, Gioni and Salvagnin, Domenico},
      title = {Using Multiple Reference Vectors and Objective Scaling in the Feasibility Pump}
    }

29. Bestuzheva, K., Chmiela, A., Müller, B., Serrano, F., Vigerske, S., and Wegscheider, F. (2023). Global Optimization of Mixed-integer Nonlinear Programs with SCIP 8.0. Journal of Global Optimization. DOI: 10.1007/s10898-023-01345-1 [URL] [arXiv]
    [BibTeX]

    @article{2023_BestuzhevaEtAl_GlobaloptimizationScip80,
      year = {2023},
      journal = {Journal of Global Optimization},
      doi = {10.1007/s10898-023-01345-1},
      note = {ZIB report 23-01},
      url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-89348},
      archiveprefix = {arXiv},
      eprint = {2301.00587},
      arxiv = {arXiv:2301.00587},
      primaryclass = {math.OC},
      author = {Bestuzheva, Ksenia and Chmiela, Antonia and Müller, Benjamin and Serrano, Felipe and Vigerske, Stefan and Wegscheider, Fabian},
      title = {Global Optimization of Mixed-integer Nonlinear Programs with SCIP 8.0},
      date = {2023-01-03}
    }

30. Bestuzheva, K., Besançon, M., Chen, W.-K., Chmiela, A., Donkiewicz, T., van Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., Gottwald, L., Graczyk, C., Halbig, K., Hoen, A., Hojny, C., van der Hulst, R., Koch, T., Lübbecke, M., Maher, S. J., … Witzig, J. (2023). Enabling Research Through the SCIP Optimization Suite 8.0. ACM Transactions on Mathematical Software. DOI: 10.1145/3585516 [arXiv]
    [BibTeX]

    @article{2023_BestuzhevaEtAl_ResearchScip,
      year = {2023},
      journal = {ACM Transactions on Mathematical Software},
      date = {2023-03-10},
      doi = {10.1145/3585516},
      archiveprefix = {arXiv},
      eprint = {2303.07101},
      arxiv = {arXiv:2303.07101},
      primaryclass = {math.OC},
      author = {Bestuzheva, Ksenia and Besançon, Mathieu and Chen, Wei-Kun and Chmiela, Antonia and Donkiewicz, Tim and van Doornmalen, Jasper and Eifler, Leon and Gaul, Oliver and Gamrath, Gerald and Gleixner, Ambros and Gottwald, Leona and Graczyk, Christoph and Halbig, Katrin and Hoen, Alexander and Hojny, Christopher and van der Hulst, Rolf and Koch, Thorsten and Lübbecke, Marco and Maher, Stephen J. and Matter, Frederic and Mühmer, Erik and Müller, Benjamin and Pfetsch, Marc and Rehfeld, Daniel and Schlein, Steffan and Schlösser, Franziska and Serrano, Felipe and Shinano, Yuji and Sofranac, Boro and Turner, Mark and Vigerske, Stefan and Wegscheider, Fabian and Wellner, Philipp and Weninger, Dieter and Witzig, Jakob},
      title = {Enabling Research Through the SCIP Optimization Suite 8.0}
    }

31. Combettes, C., and Pokutta, S. (2023). Revisiting the Approximate Carathéodory Problem Via the Frank-Wolfe Algorithm. Mathematical Programming A, 197, 191–214. DOI: 10.1007/s10107-021-01735-x [URL] [arXiv] [slides] [code] [video]
    [BibTeX]

    @article{2023_CombettesPokutta_RevisitingApproximateCaratheodory,
      year = {2023},
      journal = {Mathematical Programming A},
      volume = {197},
      pages = {191-214},
      doi = {10.1007/s10107-021-01735-x},
      url = {https://rdcu.be/cCnPL},
      archiveprefix = {arXiv},
      eprint = {1911.04415},
      arxiv = {arXiv:1911.04415},
      primaryclass = {math.OC},
      author = {Combettes, Cyrille and Pokutta, Sebastian},
      title = {Revisiting the Approximate Carathéodory Problem Via the Frank-Wolfe Algorithm},
      code = {https://colab.research.google.com/drive/1GLGRTc2jFYy9CqqoVnZgIFVQgAC0c3aZ},
      slides = {https://app.box.com/s/f0zuvr45qa6etidd06i1wart58o7bc8t},
      video = {https://youtube.com/watch?v=VB1e0HrDmVo}
    }

32. Eifler, L., and Gleixner, A. (2022). A Computational Status Update for Exact Rational Mixed Integer Programming. Mathematical Programming, 197, 793–812. DOI: 10.1007/s10107-021-01749-5 [arXiv]
    [BibTeX]

    @article{2023_EiflerGleixner_Exactrationalmip,
      year = {2023},
      journal = {Mathematical Programming},
      date = {2022-01-07},
      volume = {197},
      pages = {793-812},
      doi = {10.1007/s10107-021-01749-5},
      archiveprefix = {arXiv},
      eprint = {2101.09141},
      arxiv = {arXiv:2101.09141},
      primaryclass = {math.OC},
      author = {Eifler, Leon and Gleixner, Ambros},
      title = {A Computational Status Update for Exact Rational Mixed Integer Programming}
    }

33. Sofranac, B., Gleixner, A., and Pokutta, S. (2022). Accelerating Domain Propagation: An Efficient GPU-parallel Algorithm Over Sparse Matrices. Parallel Computing, 109, 102874. DOI: 10.1016/j.parco.2021.102874 [URL] [arXiv] [summary]
    [BibTeX]

    @article{2020_SofranacGleixnerPokutta_Domainpropagation,
      year = {2022},
      journal = {Parallel Computing},
      month = dec,
      volume = {109},
      pages = {102874},
      doi = {10.1016/j.parco.2021.102874},
      url = {https://www.sciencedirect.com/science/article/pii/S0167819121001149},
      archiveprefix = {arXiv},
      eprint = {2009.07785},
      arxiv = {arXiv:2009.07785},
      primaryclass = {cs.DC},
      author = {Sofranac, Boro and Gleixner, Ambros and Pokutta, Sebastian},
      title = {Accelerating Domain Propagation: An Efficient GPU-parallel Algorithm Over Sparse Matrices},
      summary = {https://pokutta.com/blog/research/2020/09/20/gpu-prob.html}
    }

34. Wilken, S. E., Besançon, M., Kratochvíl, M., Kuate, C. A. F., Trefois, C., Gu, W., and Ebenhöh, O. (2022). Interrogating the Effect of Enzyme Kinetics on Metabolism Using Differentiable Constraint-based Models. Metabolic Engineering.
    [BibTeX]

    @article{2022_ElmoEtAl_Enzymekineticsmetabolism,
      year = {2022},
      journal = {Metabolic Engineering},
      month = nov,
      author = {Wilken, St. Elmo and Besançon, Mathieu and Kratochvíl, Miroslav and Kuate, Chilperic Armel Foko and Trefois, Christophe and Gu, Wei and Ebenhöh, Oliver},
      title = {Interrogating the Effect of Enzyme Kinetics on Metabolism Using Differentiable Constraint-based Models}
    }

35. Sofranac, B., Gleixner, A., and Pokutta, S. (2022). An Algorithm-independent Measure of Progress for Linear Constraint Propagation. Constraints, 27, 432–455. DOI: 10.1007/s10601-022-09338-9 [arXiv]
    [BibTeX]

    @article{2021_SofranacGleixnerPokutta_Progressmeasure,
      year = {2022},
      journal = {Constraints},
      date = {2022-10-12},
      month = sep,
      volume = {27},
      pages = {432-455},
      doi = {10.1007/s10601-022-09338-9},
      archiveprefix = {arXiv},
      eprint = {2106.07573},
      arxiv = {arXiv:2106.07573},
      primaryclass = {math.OC},
      author = {Sofranac, Boro and Gleixner, Ambros and Pokutta, Sebastian},
      title = {An Algorithm-independent Measure of Progress for Linear Constraint Propagation}
    }

36. Besançon, M., Carderera, A., and Pokutta, S. (2022). FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank-Wolfe Algorithms and Conditional Gradients. INFORMS Journal on Computing. [URL] [arXiv] [summary] [slides] [code]
    [BibTeX]

    @article{2021_BesanconCardereraPokutta_Frankwolfetoolbox,
      year = {2022},
      journal = {INFORMS Journal on Computing},
      month = feb,
      url = {https://pubsonline.informs.org/doi/abs/10.1287/ijoc.2022.1191},
      archiveprefix = {arXiv},
      eprint = {2104.06675},
      arxiv = {arXiv:2104.06675},
      primaryclass = {math.OC},
      author = {Besançon, Mathieu and Carderera, Alejandro and Pokutta, Sebastian},
      title = {FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank-Wolfe Algorithms and Conditional Gradients},
      code = {https://github.com/ZIB-IOL/FrankWolfe.jl},
      slides = {https://pokutta.com/slides/20210710_FW-simpleSteps-SelfConcordance.pdf},
      summary = {https://pokutta.com/blog/research/2021/04/20/FrankWolfejl.html}
    }

37. Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2022). Restarting Frank-Wolfe. Journal of Optimization Theory and Applications, 192, 799–829. DOI: 10.1007/s10957-021-01989-7 [URL] [arXiv] [slides]
    [BibTeX]

    @article{2019_KerdrexDaspremontPokutta_RestartingFrankWolfe,
      year = {2022},
      journal = {Journal of Optimization Theory and Applications},
      volume = {192},
      pages = {799-829},
      doi = {10.1007/s10957-021-01989-7},
      url = {https://dx.doi.org/10.1007/s10957-021-01989-7},
      archiveprefix = {arXiv},
      eprint = {1810.02429},
      arxiv = {arXiv:1810.02429},
      primaryclass = {math.OC},
      author = {Kerdreux, Thomas and d'Aspremont, Alexandre and Pokutta, Sebastian},
      title = {Restarting Frank-Wolfe},
      slides = {https://app.box.com/s/prd32r6xmuef2k4gah23rd0egllz9rv5}
    }

38. Chmiela, A., Muñoz, G., and Serrano, F. (2022). On the Implementation and Strengthening of Intersection Cuts for QCQPs. Mathematical Programming B, 197, 549–586. DOI: 10.1007/s10107-022-01808-5
    [BibTeX]

    @article{2022_ChmielaMuozSerrano_Intersectioncutsqcqps,
      year = {2022},
      journal = {Mathematical Programming B},
      volume = {197},
      pages = {549-586},
      doi = {10.1007/s10107-022-01808-5},
      author = {Chmiela, Antonia and Muñoz, Gonzalo and Serrano, Felipe},
      title = {On the Implementation and Strengthening of Intersection Cuts for QCQPs}
    }

39. Eifler, L., Gleixner, A., and Pulaj, J. (2022). A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture. ACM Transactions on Mathematical Software, 48(2), 1–12. DOI: 10.1145/3485630 [arXiv]
    [BibTeX]

    @article{2022_EiflerGleixnerPulaj_Safeintegerprogramming,
      year = {2022},
      journal = {ACM Transactions on Mathematical Software},
      date = {2022-05-26},
      volume = {48},
      number = {2},
      pages = {1-12},
      doi = {10.1145/3485630},
      archiveprefix = {arXiv},
      eprint = {1809.01572},
      arxiv = {arXiv:1809.01572},
      primaryclass = {math.CO},
      author = {Eifler, Leon and Gleixner, Ambros and Pulaj, Jonad},
      title = {A Safe Computational Framework for Integer Programming Applied to Chvátal's Conjecture}
    }

40. Müller, B., Muñoz, G., Gasse, M., Gleixner, A., Lodi, A., and Serrano, F. (2022). On Generalized Surrogate Duality in Mixed-integer Nonlinear Programming. Mathematical Programming, 192(1), 89–118. DOI: 10.1007/s10107-021-01691-6 [arXiv]
    [BibTeX]

    @article{2022_MllerEtAl_Generalizedsurrogateduality,
      year = {2022},
      journal = {Mathematical Programming},
      volume = {192},
      number = {1},
      pages = {89-118},
      doi = {10.1007/s10107-021-01691-6},
      archiveprefix = {arXiv},
      eprint = {1912.00356},
      arxiv = {arXiv:1912.00356},
      primaryclass = {math.OC},
      author = {Müller, Benjamin and Muñoz, Gonzalo and Gasse, Maxime and Gleixner, Ambros and Lodi, Andrea and Serrano, Felipe},
      title = {On Generalized Surrogate Duality in Mixed-integer Nonlinear Programming}
    }

41. Rehfeld, D., Hobbie, H., Schönheit, D., Koch, T., Möst, D., and Gleixner, A. (2022). A Massively Parallel Interior-point Solver for LPs with Generalized Arrowhead Structure, and Applications to Energy System Models. European Journal of Operational Research, 296(1), 60–71. DOI: 10.1016/j.ejor.2021.06.063
    [BibTeX]

    @article{2022_RehfeldtEtAl_Parallelinteriorpoint,
      year = {2022},
      journal = {European Journal of Operational Research},
      volume = {296},
      number = {1},
      pages = {60-71},
      doi = {10.1016/j.ejor.2021.06.063},
      author = {Rehfeld, Daniel and Hobbie, Hannes and Schönheit, David and Koch, Thorsten and Möst, Dominik and Gleixner, Ambros},
      title = {A Massively Parallel Interior-point Solver for LPs with Generalized Arrowhead Structure, and Applications to Energy System Models}
    }

42. Combettes, C., and Pokutta, S. (2021). Complexity of Linear Minimization and Projection on Some Sets. Operations Research Letters, 49(4). [arXiv] [code]
    [BibTeX]

    @article{2021_CombettesPokutta_ComplexityLinearMinimization,
      year = {2021},
      journal = {Operations Research Letters},
      month = jul,
      volume = {49},
      number = {4},
      archiveprefix = {arXiv},
      eprint = {2101.10040},
      arxiv = {arXiv:2101.10040},
      primaryclass = {math.OC},
      author = {Combettes, Cyrille and Pokutta, Sebastian},
      title = {Complexity of Linear Minimization and Projection on Some Sets},
      code = {https://github.com/cyrillewcombettes/complexity},
      date = {2021-01-25}
    }

43. Kerdreux, T., Roux, C., d’Aspremont, A., and Pokutta, S. (2021). Linear Bandits on Uniformly Convex Sets. Journal of Machine Learning Research, 22(284), 1–23. [URL] [arXiv] [summary]
    [BibTeX]

    @article{2021_KerdreuxRouxDaspremontPokutta_Linearbandits,
      year = {2021},
      journal = {Journal of Machine Learning Research},
      month = mar,
      volume = {22},
      number = {284},
      pages = {1–23},
      url = {http://jmlr.org/papers/v22/21-0277.html},
      archiveprefix = {arXiv},
      eprint = {2103.05907},
      arxiv = {arXiv:2103.05907},
      primaryclass = {cs.LG},
      author = {Kerdreux, Thomas and Roux, Christophe and d'Aspremont, Alexandre and Pokutta, Sebastian},
      title = {Linear Bandits on Uniformly Convex Sets},
      summary = {https://www.pokutta.com/blog/research/2021/04/03/linearBandits.html},
      date = {2021-03-11}
    }

44. Anari, N., Haghtalab, N., Naor, S., Pokutta, S., Singh, M., and Torrico Palacios, A. (2021). Structured Robust Submodular Maximization: Offline and Online Algorithms. INFORMS Journal on Computing, 33(4), 1259–1684. [URL] [arXiv]
    [BibTeX]

    @article{2019_AnariHaghtalabNaorPokuttaSinghTorrico_StructuredRobustSubmodular,
      year = {2021},
      journal = {INFORMS Journal on Computing},
      volume = {33},
      number = {4},
      pages = {1259-1684},
      url = {https://pubsonline.informs.org/doi/abs/10.1287/ijoc.2020.0998},
      archiveprefix = {arXiv},
      eprint = {1710.04740},
      arxiv = {arXiv:1710.04740},
      primaryclass = {cs.DS},
      author = {Anari, N. and Haghtalab, N. and Naor, S. and Pokutta, Sebastian and Singh, Mohit and Torrico Palacios, Alfredo},
      title = {Structured Robust Submodular Maximization: Offline and Online Algorithms}
    }

45. Ramin, E., Bestuzheva, K., Gargalo, C., Ramin, D., Schneider, C., Ramin, P., Flores-Alsina, X., Andersen, M., and Gernaey, K. (2021). Incremental Design of Water Symbiosis Networks with Prior Knowledge: the Case of an Industrial Park in Kenya. Science of the Total Environment, 751. DOI: 10.1016/j.scitotenv.2020.141706
    [BibTeX]

    @article{2021_RaminEtAl_Incrementalwatersymbiosis,
      year = {2021},
      journal = {Science of the Total Environment},
      date = {2021-01-10},
      volume = {751},
      doi = {10.1016/j.scitotenv.2020.141706},
      author = {Ramin, Elham and Bestuzheva, Ksenia and Gargalo, Carina and Ramin, Danial and Schneider, Carina and Ramin, Pedram and Flores-Alsina, Xavier and Andersen, Maj and Gernaey, Krist},
      title = {Incremental Design of Water Symbiosis Networks with Prior Knowledge: the Case of an Industrial Park in Kenya}
    }

46. Braun, G., Pokutta, S., and Zink, D. (2019). Affine Reductions for LPs and SDPs. Mathematical Programming, 173, 281–312. DOI: 10.1007/s10107-017-1221-9 [URL] [arXiv]
    [BibTeX]

    @article{2014_BraunPokuttaZink_Affinereductions,
      year = {2019},
      journal = {Mathematical Programming},
      volume = {173},
      pages = {281–312},
      doi = {10.1007/s10107-017-1221-9},
      url = {http://rdcu.be/EPf9},
      archiveprefix = {arXiv},
      eprint = {1410.8816},
      arxiv = {arXiv:1410.8816},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian and Zink, Daniel},
      title = {Affine Reductions for LPs and SDPs}
    }

47. Braun, G., Pokutta, S., and Zink, D. (2019). Lazifying Conditional Gradient Algorithms. The Journal of Machine Learning Research, 20(71), 1–42. [URL] [arXiv]
    [BibTeX]

    @article{2016_BraunPokuttaZink_Lazifyinggradientalgorithms,
      year = {2019},
      journal = {The Journal of Machine Learning Research},
      volume = {20},
      number = {71},
      pages = {1–42},
      url = {https://jmlr.org/papers/v20/18-114.html},
      archiveprefix = {arXiv},
      eprint = {1610.05120},
      arxiv = {arXiv:1610.05120},
      primaryclass = {cs.DS},
      author = {Braun, Gábor and Pokutta, Sebastian and Zink, Daniel},
      title = {Lazifying Conditional Gradient Algorithms}
    }

48. Braun, G., Pokutta, S., and Roy, A. (2018). Strong Reductions for Extended Formulations. Mathematical Programming, 172, 591–620. DOI: 10.1007/s10107-018-1316-y [arXiv]
    [BibTeX]

    @article{2015_BraunPokuttaRoy_Strongreductions,
      year = {2018},
      journal = {Mathematical Programming},
      month = nov,
      volume = {172},
      pages = {591–620},
      doi = {10.1007/s10107-018-1316-y},
      archiveprefix = {arXiv},
      eprint = {1512.04932},
      arxiv = {arXiv:1512.04932},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian and Roy, Aurko},
      title = {Strong Reductions for Extended Formulations}
    }

49. Le Bodic, P., Pfetsch, M., Pavelka, J., and Pokutta, S. (2018). Solving MIPs Via Scaling-based Augmentation. Discrete Optimization, 27, 1–25. DOI: 10.1016/j.disopt.2017.08.004 [arXiv]
    [BibTeX]

    @article{2018_LebodicPfetschPavelkaPokutta_SolvingMIPs,
      year = {2018},
      journal = {Discrete Optimization},
      volume = {27},
      pages = {1-25},
      doi = {10.1016/j.disopt.2017.08.004},
      archiveprefix = {arXiv},
      eprint = {1509.03206},
      arxiv = {arXiv:1509.03206},
      primaryclass = {math.OC},
      author = {Le Bodic, P. and Pfetsch, Marc and Pavelka, Jeff and Pokutta, Sebastian},
      title = {Solving MIPs Via Scaling-based Augmentation}
    }

50. Braun, G., Brown-Cohen, J., Huq, A., Pokutta, S., Raghavendra, P., Roy, A., Weitz, B., and Zink, D. (2017). The Matching Problem Has No Small Symmetric SDP. Mathematical Programming, 165, 643–662. DOI: 10.1007/s10107-016-1098-z [arXiv]
    [BibTeX]

    @article{2015_BraunEtAl_MatchingproblemSdp,
      year = {2017},
      journal = {Mathematical Programming},
      month = oct,
      volume = {165},
      pages = {643–662},
      doi = {10.1007/s10107-016-1098-z},
      archiveprefix = {arXiv},
      eprint = {1504.00703},
      arxiv = {arXiv:1504.00703},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Brown-Cohen, Jonah and Huq, Arefin and Pokutta, Sebastian and Raghavendra, Prasad and Roy, Aurko and Weitz, Benjamin and Zink, Daniel},
      title = {The Matching Problem Has No Small Symmetric SDP}
    }

51. Braun, G., Guzmán, C., and Pokutta, S. (2017). Unifying Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization. IEEE Transactions on Information Theory, 63(7), 4709–4724. DOI: 10.1109/TIT.2017.2701343 [URL] [arXiv]
    [BibTeX]

    @article{2014_BraunGuzmanPokutta_Lowerboundsoraclecomplexity,
      year = {2017},
      journal = {IEEE Transactions on Information Theory},
      month = jul,
      volume = {63},
      number = {7},
      pages = {4709-4724},
      doi = {10.1109/TIT.2017.2701343},
      url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7919238},
      archiveprefix = {arXiv},
      eprint = {1407.5144},
      arxiv = {arXiv:1407.5144},
      primaryclass = {math.OC},
      author = {Braun, Gábor and Guzmán, Cristóbal and Pokutta, Sebastian},
      title = {Unifying Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization}
    }

52. Christensen, H., Khan, A., Pokutta, S., and Tetali, P. (2017). Approximation and Online Algorithms for Multidimensional Bin Packing: a Survey. Computer Science Review, 24, 63–79. [URL]
    [BibTeX]

    @article{2017_ChristensenEtAl_MultidimensionalBinPacking,
      year = {2017},
      journal = {Computer Science Review},
      month = may,
      volume = {24},
      pages = {63–79},
      url = {http://www.sciencedirect.com/science/article/pii/S1574013716301356},
      author = {Christensen, H. and Khan, A. and Pokutta, Sebastian and Tetali, P.},
      title = {Approximation and Online Algorithms for Multidimensional Bin Packing: a Survey}
    }

53. Braun, G., Jain, R., Lee, T., and Pokutta, S. (2017). Information-theoretic Approximations of the Nonnegative Rank. Computational Complexity, 26, 147–197. DOI: 10.1007/s00037-016-0125-z [URL]
    [BibTeX]

    @article{2017_BraunRahulTroyPokutta_Informationtheoreticnonnegativerank,
      year = {2017},
      journal = {Computational Complexity},
      volume = {26},
      pages = {147–197},
      doi = {10.1007/s00037-016-0125-z},
      url = {https://eccc.weizmann.ac.il/report/2013/158},
      author = {Braun, Gábor and Jain, Rahul and Lee, Troy and Pokutta, Sebastian},
      title = {Information-theoretic Approximations of the Nonnegative Rank}
    }

54. Roy, A., and Pokutta, S. (2017). Hierarchical Clustering Via Spreading Metrics. Journal of Machine Learning Research, 18, 1–35. [URL] [arXiv]
    [BibTeX]

    @article{2017_RoyPokutta_HierarchicalClustering,
      year = {2017},
      journal = {Journal of Machine Learning Research},
      volume = {18},
      pages = {1-35},
      url = {https://jmlr.org/papers/v18/17-081.html},
      archiveprefix = {arXiv},
      eprint = {1610.09269},
      arxiv = {arXiv:1610.09269},
      primaryclass = {cs.LG},
      author = {Roy, Aurko and Pokutta, Sebastian},
      title = {Hierarchical Clustering Via Spreading Metrics}
    }

55. Braun, G., Firorini, S., and Pokutta, S. (2016). Average Case Polyhedral Complexity of the Maximum Stable Set Problem. Mathematical Programming, 160(1), 407–431. DOI: 10.1007/s10107-016-0989-3 [URL] [arXiv]
    [BibTeX]

    @article{2013_BraunSamuelPokutta_Averagepolyhedralcomplexity,
      year = {2016},
      journal = {Mathematical Programming},
      month = mar,
      volume = {160},
      number = {1},
      pages = {407–431},
      doi = {10.1007/s10107-016-0989-3},
      url = {https://rdcu.be/7uOy},
      archiveprefix = {arXiv},
      eprint = {1311.4001},
      arxiv = {arXiv:1311.4001},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Firorini, Samuel and Pokutta, Sebastian},
      title = {Average Case Polyhedral Complexity of the Maximum Stable Set Problem}
    }

56. Braun, G., and Pokutta, S. (2016). Common Information and Unique Disjointness. Algorithmica, 76(3), 597–629. DOI: 10.1007/s00453-016-0132-0 [URL]
    [BibTeX]

    @article{2016_BraunPokutta_CommoninformationDisjointness,
      year = {2016},
      journal = {Algorithmica},
      month = feb,
      volume = {76},
      number = {3},
      pages = {597–629},
      doi = {10.1007/s00453-016-0132-0},
      url = {https://rdcu.be/6b9u},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {Common Information and Unique Disjointness}
    }

57. Braun, G., and Pokutta, S. (2016). A Polyhedral Characterization of Border Bases. SIAM Journal on Discrete Mathematics, 30(1), 239–265. DOI: 10.1137/140977990 [arXiv]
    [BibTeX]

    @article{2009_BraunPokutta_BorderbasesOrderidealsPolyhedral,
      year = {2016},
      journal = {SIAM Journal on Discrete Mathematics},
      volume = {30},
      number = {1},
      pages = {239–265},
      doi = {10.1137/140977990},
      archiveprefix = {arXiv},
      eprint = {0912.1502},
      arxiv = {arXiv:0912.1502},
      primaryclass = {math.AC},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {A Polyhedral Characterization of Border Bases}
    }

58. Braun, G., and Pokutta, S. (2015). The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes. IEEE Transactions on Information Theory, 61(10), 5754–5764. DOI: 10.1109/TIT.2015.2465864 [URL] [arXiv]
    [BibTeX]

    @article{2014_BraunPokutta_Matchingpolytope,
      year = {2015},
      journal = {IEEE Transactions on Information Theory},
      month = oct,
      volume = {61},
      number = {10},
      pages = {5754-5764},
      doi = {10.1109/TIT.2015.2465864},
      url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7182355},
      archiveprefix = {arXiv},
      eprint = {1403.6710},
      arxiv = {arXiv:1403.6710},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes}
    }

59. Braun, G., Firorini, S., Pokutta, S., and Steurer, D. (2015). Approximation Limits of Linear Programs (beyond Hierarchies). Mathematics of Operations Research, 40(3), 756–772. DOI: 10.1287/moor.2014.0694 [arXiv]
    [BibTeX]

    @article{2012_BraunSamuelPokuttaSteurer_Approximationlimits,
      year = {2015},
      journal = {Mathematics of Operations Research},
      month = aug,
      volume = {40},
      number = {3},
      pages = {756-772},
      doi = {10.1287/moor.2014.0694},
      archiveprefix = {arXiv},
      eprint = {1204.0957},
      arxiv = {arXiv:1204.0957},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Firorini, Samuel and Pokutta, Sebastian and Steurer, David},
      title = {Approximation Limits of Linear Programs (beyond Hierarchies)}
    }

60. Braun, G., Pokutta, S., and Xie, Y. (2015). Info-greedy Sequential Adaptive Compressed Sensing. IEEE Journal of Selected Topics in Signal Processing, 9(4), 601–611. DOI: 10.1109/JSTSP.2015.2400428 [arXiv]
    [BibTeX]

    @article{2014_BraunPokuttaYao_Infogreedycompressedsensing,
      year = {2015},
      journal = {IEEE Journal of Selected Topics in Signal Processing},
      month = jun,
      volume = {9},
      number = {4},
      pages = {601–611},
      doi = {10.1109/JSTSP.2015.2400428},
      archiveprefix = {arXiv},
      eprint = {1407.0731},
      arxiv = {arXiv:1407.0731},
      primaryclass = {cs.IT},
      author = {Braun, Gábor and Pokutta, Sebastian and Xie, Yao},
      title = {Info-greedy Sequential Adaptive Compressed Sensing}
    }

61. Braun, G., and Pokutta, S. (2011). Random Half-integral Polytopes. Operations Research Letters, 39(3), 204–207. DOI: 10.1016/j.orl.2011.03.003 [URL]
    [BibTeX]

    @article{2011_BraunPokutta_Randomhalfintegralpolytopes,
      year = {2011},
      journal = {Operations Research Letters},
      month = may,
      volume = {39},
      number = {3},
      pages = {204–207},
      doi = {10.1016/j.orl.2011.03.003},
      url = {https://optimization-online.org/?p=2010/11/2813},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {Random Half-integral Polytopes}
    }

62. Braun, G., and Pokutta, S. (2010). Rank of Random Half-integral Polytopes. Electronic Notes in Discrete Mathematics, 36, 415–422. DOI: 10.1016/j.endm.2010.05.053 [URL]
    [BibTeX]

    @article{2011_BraunPokutta_Randomhalfintegralpolytopes:1,
      year = {2010},
      journal = {Electronic Notes in Discrete Mathematics},
      date = {2010-08-01},
      month = aug,
      volume = {36},
      pages = {415–422},
      doi = {10.1016/j.endm.2010.05.053},
      url = {https://optimization-online.org/?p=2010/11/2813},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {Rank of Random Half-integral Polytopes}
    }