Continuous Optimization

📝 Publications and preprints

Preprints

1. Besançon, M., Designolle, S., Halbey, J., Hendrych, D., Kuzinowicz, D., Pokutta, S., Troppens, H., Viladrich, D., and Wirth, E. (2025). Improved Algorithms and Novel Applications of the FrankWolfe.jl Library. [arXiv]
   [BibTeX]

   @misc{2025_BesanconEtAl_Frankwolfelibrary,
     archiveprefix = {arXiv},
     eprint = {2501.14613},
     primaryclass = {math.OC},
     year = {2025},
     author = {Besançon, Mathieu and Designolle, Sébastien and Halbey, Jannis and Hendrych, Deborah and Kuzinowicz, Dominik and Pokutta, Sebastian and Troppens, Hannah and Viladrich, Daniel and Wirth, Elias},
     title = {Improved Algorithms and Novel Applications of the FrankWolfe.jl Library},
     date = {2025-01-24}
   }

2. Hendrych, D., Besançon, M., Martínez-Rubio, D., and Pokutta, S. (2025). Secant Line Search for Frank-Wolfe Algorithms. [arXiv]
   [BibTeX]

   @misc{2025_HendrychBesanconMartinezrubioPokutta_Secantfrankwolfe,
     archiveprefix = {arXiv},
     eprint = {2501.18775},
     primaryclass = {math.OC},
     year = {2025},
     author = {Hendrych, Deborah and Besançon, Mathieu and Martínez-Rubio, David and Pokutta, Sebastian},
     title = {Secant Line Search for Frank-Wolfe Algorithms},
     date = {2025-01-30}
   }

3. Roux, C., Martínez-Rubio, D., and Pokutta, S. (2025). Implicit Riemannian Optimism with Applications to Min-Max Problems. [arXiv]
   [BibTeX]

   @misc{2025_RouxMartinezrubioPokutta_ImplicitRiemannian,
     archiveprefix = {arXiv},
     eprint = {2501.18381},
     primaryclass = {math.OC},
     year = {2025},
     author = {Roux, Christophe and Martínez-Rubio, David and Pokutta, Sebastian},
     title = {Implicit Riemannian Optimism with Applications to Min-Max Problems},
     date = {2025-01-30}
   }

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

   @misc{2023_DesignolleVertesiPokutta_Grothendieckconstants,
     archiveprefix = {arXiv},
     eprint = {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}
   }

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

   @misc{2024_BraunPokuttaWoodstock_Blockiterativeanalysis,
     archiveprefix = {arXiv},
     eprint = {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}
   }

6. Wirth, E., Pena, J., and Pokutta, S. (2024). Fast Convergence of Frank-Wolfe Algorithms on Polytopes. [arXiv]
   [BibTeX]

   @misc{2024_WirthJavierPokutta_Frankwolfeconvergence,
     archiveprefix = {arXiv},
     eprint = {2406.18789},
     primaryclass = {math.OC},
     year = {2024},
     author = {Wirth, Elias and Pena, Javier and Pokutta, Sebastian},
     title = {Fast Convergence of Frank-Wolfe Algorithms on Polytopes},
     date = {2024-06-26}
   }

7. 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,
     archiveprefix = {arXiv},
     eprint = {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}
   }

8. 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,
     archiveprefix = {arXiv},
     eprint = {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}
   }

9. 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,
     archiveprefix = {arXiv},
     eprint = {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}
   }

10. Hendrych, D., Troppens, H., Besançon, M., and Pokutta, S. (2022). Convex Integer Optimization with Frank-Wolfe Methods. [arXiv] [slides] [code]
    [BibTeX]

    @misc{2022_HendrychTroppensBesanconPokutta_Convexintegerfrankwolfe,
      archiveprefix = {arXiv},
      eprint = {2208.11010},
      primaryclass = {math.OC},
      year = {2022},
      author = {Hendrych, Deborah and Troppens, Hannah and Besançon, Mathieu and Pokutta, Sebastian},
      title = {Convex Integer Optimization with Frank-Wolfe Methods},
      code = {https://github.com/ZIB-IOL/Boscia.jl},
      slides = {https://pokutta.com/slides/20220915_boscia.pdf},
      date = {2022-08-23}
    }

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

    @misc{2021_BraunPokutta_DualpricesFrankwolfe,
      archiveprefix = {arXiv},
      eprint = {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}
    }

12. Carderera, A., Pokutta, S., Schütte, C., and Weiser, M. (2021). CINDy: Conditional Gradient-based Identification of Non-linear Dynamics – Noise-robust Recovery. [arXiv]
    [BibTeX]

    @misc{2021_CardereraPokuttaSchutteWeiser_CINDy,
      archiveprefix = {arXiv},
      eprint = {2101.02630},
      primaryclass = {math.DS},
      year = {2021},
      author = {Carderera, Alejandro and Pokutta, Sebastian and Schütte, Christof and Weiser, Martin},
      title = {CINDy: Conditional Gradient-based Identification of Non-linear Dynamics -- Noise-robust Recovery},
      date = {2021-01-07}
    }

13. Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2021). Local and Global Uniform Convexity Conditions. [arXiv]
    [BibTeX]

    @misc{2021_KerdrexDaspremontPokutta_LocalGlobalUniform,
      archiveprefix = {arXiv},
      eprint = {2102.05134},
      primaryclass = {math.OC},
      year = {2021},
      author = {Kerdreux, Thomas and d'Aspremont, Alexandre and Pokutta, Sebastian},
      title = {Local and Global Uniform Convexity Conditions},
      date = {2021-02-09}
    }

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

    @misc{2021_RouxWirthPokuttaKerdreux_Onlinebanditminimax,
      archiveprefix = {arXiv},
      eprint = {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}
    }

15. Carderera, A., and Pokutta, S. (2020). Second-order Conditional Gradient Sliding. [arXiv] [code]
    [BibTeX]

    @misc{2020_CarderaPokutta_SecondOrderConditional,
      archiveprefix = {arXiv},
      eprint = {2002.08907},
      primaryclass = {math.OC},
      year = {2020},
      author = {Carderera, Alejandro and Pokutta, Sebastian},
      title = {Second-order Conditional Gradient Sliding},
      code = {https://github.com/pokutta/Second-order-Conditional-Gradients},
      date = {2020-02-20}
    }

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

    @misc{2020_CombettesSpiegelPokutta_Projectionfreeadaptivegradients,
      archiveprefix = {arXiv},
      eprint = {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}
    }

17. 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},
      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}
    }

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

    @misc{2010_BraunPokutta_PolyhedralApproach,
      archiveprefix = {arXiv},
      eprint = {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}
    }

Conference proceedings

1. 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 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},
     archiveprefix = {arXiv},
     eprint = {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}
   }

2. Wirth, E., Besançon, M., and Pokutta, S. (2024, July 16). The Pivoting Framework: Frank-Wolfe Algorithms with Active Set Size Control. Proceedings of the International Conference on Artificial Intelligence and Statistics. [arXiv]
   [BibTeX]

   @inproceedings{2024_WirthBesanconPokutta_Pivotingframework,
     year = {2025},
     booktitle = {Proceedings of the International Conference on Artificial Intelligence and Statistics},
     archiveprefix = {arXiv},
     eprint = {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},
     date = {2024-07-16}
   }

3. Hendrych, D., Besançon, M., and Pokutta, S. (2023, December 18). Solving the Optimal Experiment Design Problem with Mixed-integer Convex Methods. Proceedings of the Symposium on Experimental Algorithms. DOI: 10.4230/LIPIcs.SEA.2024.16 [arXiv] [code]
   [BibTeX]

   @inproceedings{2023_HendrychBesanconPokutta_Optimalexperimentdesign,
     year = {2024},
     booktitle = {Proceedings of the Symposium on Experimental Algorithms},
     doi = {10.4230/LIPIcs.SEA.2024.16},
     archiveprefix = {arXiv},
     eprint = {2312.11200},
     primaryclass = {math.OC},
     author = {Hendrych, Deborah and Besançon, Mathieu and Pokutta, Sebastian},
     title = {Solving the Optimal Experiment Design Problem with Mixed-integer Convex Methods},
     code = {https://github.com/ZIB-IOL/OptimalDesignWithBoscia},
     date = {2023-12-18}
   }

4. Martínez-Rubio, D., Roux, C., and Pokutta, S. (2024, March 15). 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},
     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-15}
   }

5. Sharma, K., Hendrych, D., Besançon, M., and Pokutta, S. (2024, January 31). Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe. Proceedings of the INFORMS Optimization Society Conference. [arXiv]
   [BibTeX]

   @inproceedings{2024_SharmaHendrychBesanconPokutta_NetworkdesignMicoFrankwolfe,
     year = {2024},
     booktitle = {Proceedings of the INFORMS Optimization Society Conference},
     archiveprefix = {arXiv},
     eprint = {2402.00166},
     primaryclass = {math.OC},
     author = {Sharma, Kartikey and Hendrych, Deborah and Besançon, Mathieu and Pokutta, Sebastian},
     title = {Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe},
     date = {2024-01-31}
   }

6. Martínez-Rubio, D., and Pokutta, S. (2022, November 26). 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},
     url = {https://proceedings.mlr.press/v195/martinez-rubio23a/martinez-rubio23a.pdf},
     archiveprefix = {arXiv},
     eprint = {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},
     date = {2022-11-26}
   }

7. Wirth, E., Kera, H., and Pokutta, S. (2022, July 4). 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},
     archiveprefix = {arXiv},
     eprint = {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},
     date = {2022-07-04}
   }

8. Wirth, E., Kerdreux, T., and Pokutta, S. (2022, May 25). Acceleration of Frank-Wolfe Algorithms with Open Loop Step-sizes. Proceedings of the International Conference on Artificial Intelligence and Statistics. [arXiv]
   [BibTeX]

   @inproceedings{2022_WirthKerdreuxPokutta_Frankwolfeacceleration,
     year = {2023},
     booktitle = {Proceedings of the International Conference on Artificial Intelligence and Statistics},
     archiveprefix = {arXiv},
     eprint = {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},
     date = {2022-05-25}
   }

9. Criscitiello, C., Martínez-Rubio, D., and Boumal, N. (2023, July 24). 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},
     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-24}
   }

10. Martínez-Rubio, D., Wirth, E., and Pokutta, S. (2023, March 22). 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},
      archiveprefix = {arXiv},
      eprint = {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-22}
    }

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

    @inproceedings{2022_BiCombettesWoodstock_Blockactivatedminimization,
      year = {2022},
      booktitle = {Proceedings of the ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
      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},
      primaryclass = {math.OC},
      author = {Búi, M. N. and Combettes, Patrick L. and Woodstock, Zev},
      title = {Block-activated Algorithms for Multicomponent Fully Nonsmooth Minimization},
      date = {2021-02-28}
    }

12. Criado, F., Martínez-Rubio, D., and Pokutta, S. (2021, September 8). 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},
      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},
      date = {2021-09-08}
    }

13. Macdonald, J., Besançon, M., and Pokutta, S. (2021, October 15). 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},
      archiveprefix = {arXiv},
      eprint = {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},
      date = {2021-10-15}
    }

14. 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},
      archiveprefix = {arXiv},
      eprint = {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}
    }

15. 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},
      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}
    }

16. 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},
      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}
    }

17. Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2020, April 23). 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},
      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},
      date = {2020-04-23}
    }

18. 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},
      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}
    }

19. Diakonikolas, J., Carderera, A., and Pokutta, S. (2019, June 19). 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},
      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},
      date = {2019-06-19}
    }

20. Pokutta, S., Singh, M., and Torrico Palacios, A. (2020, February 10). 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},
      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-10}
    }

21. Braun, G., Pokutta, S., Tu, D., and Wright, S. (2018). 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},
      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},
      date = {2018-05-18}
    }

22. Anari, N., Haghtalab, N., Naor, S., Pokutta, S., Singh, M., and Torrico Palacios, A. (2017, October 12). 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},
      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},
      date = {2017-10-12}
    }

23. 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},
      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}
    }

24. Diakonikolas, J., Carderera, A., and Pokutta, S. (2019, June 19). Breaking the Curse of Dimensionality (Locally) to Accelerate Conditional Gradients. Proceedings of the OPTML Workshop Paper. [URL] [arXiv] [slides] [code]
    [BibTeX]

    @inproceedings{2019_DiakonikolasCardereraPokutta_BreakingCurse,
      year = {2019},
      booktitle = {Proceedings of the OPTML Workshop Paper},
      url = {https://opt-ml.org/papers/2019/paper_26.pdf},
      archiveprefix = {arXiv},
      eprint = {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}
    }

25. Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2018, October 4). 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},
      primaryclass = {math.OC},
      author = {Kerdreux, Thomas and d'Aspremont, Alexandre and Pokutta, Sebastian},
      title = {Restarting Frank-Wolfe},
      slides = {https://app.box.com/s/prd32r6xmuef2k4gah23rd0egllz9rv5},
      date = {2018-10-04}
    }

26. Pokutta, S., Singh, M., and Torrico Palacios, A. (2020, February 10). On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness. Proceedings of the OPTML Workshop Paper. [URL] [arXiv] [slides] [video]
    [BibTeX]

    @inproceedings{2019_PokuttaSinghTorrico_UnreasonableEffectiveness,
      year = {2019},
      booktitle = {Proceedings of the OPTML Workshop Paper},
      url = {https://opt-ml.org/papers/2019/paper_16.pdf},
      archiveprefix = {arXiv},
      eprint = {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-10}
    }

27. Pokutta, S., Singh, M., and Torrico Palacios, A. (2018, July 25). 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},
      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-25}
    }

28. Braun, G., Pokutta, S., and Zink, D. (2016). 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},
      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},
      date = {2016-10-17}
    }

29. 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},
      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}
    }

30. Braun, G., Pokutta, S., and Roy, A. (2015). 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},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian and Roy, Aurko},
      title = {Strong Reductions for Extended Formulations},
      date = {2015-12-15}
    }

31. Braun, G., Brown-Cohen, J., Huq, A., Pokutta, S., Raghavendra, P., Roy, A., Weitz, B., and Zink, D. (2015). The Matching Problem Has No Small Symmetric SDP. Proceedings of the Symposium on Discrete Algorithms, 1067–1078. DOI: 10.1137/1.9781611974331.ch75 [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},
      archiveprefix = {arXiv},
      eprint = {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},
      date = {2015-04-02}
    }

32. Roy, A., and Pokutta, S. (2016, October 28). 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},
      primaryclass = {cs.LG},
      author = {Roy, Aurko and Pokutta, Sebastian},
      title = {Hierarchical Clustering Via Spreading Metrics},
      date = {2016-10-28}
    }

33. Braun, G., Pokutta, S., and Zink, D. (2014). 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},
      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},
      date = {2014-10-31}
    }

34. Braun, G., and Pokutta, S. (2014). 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 [arXiv]
    [BibTeX]

    @inproceedings{2014_BraunPokutta_Matchingpolytope,
      year = {2015},
      booktitle = {Proceedings of the Symposium on Discrete Algorithms},
      pages = {837-846},
      doi = {10.1137/1.9781611973730.57},
      archiveprefix = {arXiv},
      eprint = {1403.6710},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {The Matching Polytope Does Not Admit Fully-polynomial Size Relaxation Schemes},
      date = {2014-03-26}
    }

35. Braun, G., Firorini, S., and Pokutta, S. (2013). 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},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Firorini, Samuel and Pokutta, Sebastian},
      title = {Average Case Polyhedral Complexity of the Maximum Stable Set Problem},
      date = {2013-11-15}
    }

36. Braun, G., Pokutta, S., and Xie, Y. (2014). Info-greedy Sequential Adaptive Compressed Sensing. Proceedings of the Allerton Conference on Communication, Control, and Computing (Allerton), 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 (Allerton)},
      pages = {858–865},
      doi = {10.1109/ALLERTON.2014.7028544},
      archiveprefix = {arXiv},
      eprint = {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}
    }

37. 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}
    }

38. 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},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {An Algebraic Approach to Symmetric Extended Formulations},
      date = {2012-06-27}
    }

39. 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},
      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. (2023). 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},
     archiveprefix = {arXiv},
     eprint = {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},
     date = {2023-10-06}
   }

2. Woodstock, Z., and Pokutta, S. (2023). 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},
     volume = {35},
     number = {1},
     pages = {347-368},
     doi = {10.1137/24M1638008},
     archiveprefix = {arXiv},
     eprint = {2311.05381},
     primaryclass = {math.OC},
     author = {Woodstock, Zev and Pokutta, Sebastian},
     title = {Splitting the Conditional Gradient Algorithm},
     date = {2023-11-09}
   }

3. 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 [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},
     archiveprefix = {arXiv},
     eprint = {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}
   }

4. 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”}
   }

5. 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},
     primaryclass = {math.OC},
     author = {Pokutta, Sebastian},
     title = {The Frank-Wolfe Algorithm: a Short Introduction}
   }

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

   @article{2023_DezaShmuelPokuttaPournin_Kissingpolytopes,
     year = {2024},
     journal = {SIAM Journal on Discrete Mathematics},
     archiveprefix = {arXiv},
     eprint = {2305.18597},
     primaryclass = {math.MG},
     author = {Deza, Antoine and Onn, Shmuel and Pokutta, Sebastian and Pournin, Lionel},
     title = {Kissing Polytopes},
     date = {2023-05-29}
   }

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

   @article{2024_DesignolleVertesiPokutta_SymmetricBellinequalities,
     year = {2024},
     journal = {Physics Review A},
     archiveprefix = {arXiv},
     eprint = {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},
     date = {2023-10-31}
   }

8. 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},
     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}
   }

9. Besançon, M., Dias Garcia, J., Legat, B., and Sharma, A. (2022). 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},
     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},
     date = {2022-06-10}
   }

10. 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},
      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}
    }

11. Combettes, C., and Pokutta, S. (2019). 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},
      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},
      date = {2019-11-11}
    }

12. 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},
      archiveprefix = {arXiv},
      eprint = {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}
    }

13. 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}
    }

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

    @article{2021_BesanconCardereraPokutta_Frankwolfetoolbox,
      year = {2022},
      journal = {INFORMS Journal on Computing},
      month = feb,
      archiveprefix = {arXiv},
      eprint = {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},
      date = {2021-04-14}
    }

15. Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2018). 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},
      primaryclass = {math.OC},
      author = {Kerdreux, Thomas and d'Aspremont, Alexandre and Pokutta, Sebastian},
      title = {Restarting Frank-Wolfe},
      slides = {https://app.box.com/s/prd32r6xmuef2k4gah23rd0egllz9rv5},
      date = {2018-10-04}
    }

16. 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},
      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}
    }

17. 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},
      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-10}
    }

18. Anari, N., Haghtalab, N., Naor, S., Pokutta, S., Singh, M., and Torrico Palacios, A. (2017). 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},
      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},
      date = {2017-10-12}
    }

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

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

20. Braun, G., Pokutta, S., and Zink, D. (2016). 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},
      primaryclass = {cs.DS},
      author = {Braun, Gábor and Pokutta, Sebastian and Zink, Daniel},
      title = {Lazifying Conditional Gradient Algorithms},
      date = {2016-10-17}
    }

21. Braun, G., Pokutta, S., and Roy, A. (2015). 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},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian and Roy, Aurko},
      title = {Strong Reductions for Extended Formulations},
      date = {2015-12-15}
    }

22. Le Bodic, P., Pfetsch, M., Pavelka, J., and Pokutta, S. (2015). 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},
      primaryclass = {math.OC},
      author = {Le Bodic, P. and Pfetsch, Marc and Pavelka, Jeff and Pokutta, Sebastian},
      title = {Solving MIPs Via Scaling-based Augmentation},
      date = {2015-09-10}
    }

23. Braun, G., Brown-Cohen, J., Huq, A., Pokutta, S., Raghavendra, P., Roy, A., Weitz, B., and Zink, D. (2015). 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},
      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},
      date = {2015-04-02}
    }

24. Braun, G., Guzmán, C., and Pokutta, S. (2014). 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 [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},
      archiveprefix = {arXiv},
      eprint = {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},
      date = {2014-07-19}
    }

25. Braun, G., Jain, R., Lee, T., and Pokutta, S. (2013). 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},
      date = {2013-11-18}
    }

26. Roy, A., and Pokutta, S. (2016). 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},
      primaryclass = {cs.LG},
      author = {Roy, Aurko and Pokutta, Sebastian},
      title = {Hierarchical Clustering Via Spreading Metrics},
      date = {2016-10-28}
    }

27. Braun, G., Firorini, S., and Pokutta, S. (2013). Average Case Polyhedral Complexity of the Maximum Stable Set Problem. Mathematical Programming, 160(1), 407–431. DOI: 10.1007/s10107-016-0989-3 [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},
      archiveprefix = {arXiv},
      eprint = {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},
      date = {2013-11-15}
    }

28. Braun, G., and Pokutta, S. (2013). 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://eccc.weizmann.ac.il/report/2013/056},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {Common Information and Unique Disjointness},
      date = {2013-04-05}
    }

29. Braun, G., and Pokutta, S. (2009). 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},
      primaryclass = {math.AC},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {A Polyhedral Characterization of Border Bases},
      date = {2009-12-08}
    }

30. Braun, G., Firorini, S., Pokutta, S., and Steurer, D. (2012). 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},
      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}
    }

31. Braun, G., Pokutta, S., and Xie, Y. (2014). 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},
      primaryclass = {cs.IT},
      author = {Braun, Gábor and Pokutta, Sebastian and Xie, Yao},
      title = {Info-greedy Sequential Adaptive Compressed Sensing},
      date = {2014-07-02}
    }

32. 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/2010/11/2813},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {Random Half-integral Polytopes}
    }

33. 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/2010/11/2813},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {Rank of Random Half-integral Polytopes}
    }