List of Publications

This page lists both peer-reviewed publications and preprints by IOL Lab members. Also check out our Google Scholar profile for up-to-date statistics on citations.

Preprints

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

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

Göß, A., Martin, A., Pokutta, S., and Sharma, K. (2024). Norm-induced Cuts: Optimization with Lipschitzian Black-box Functions. [URL] [arXiv]

[BibTeX]

@misc{2024_AdrianMartinPokuttaSharma_Norminducedcuts,
  url = {https://opus4.kobv.de/opus4-trr154/files/518/nic_preprint.pdf},
  archiveprefix = {arXiv},
  eprint = {2403.11546},
  primaryclass = {math.OC},
  year = {2024},
  author = {Göß, Adrian and Martin, Alexander and Pokutta, Sebastian and Sharma, Kartikey},
  title = {Norm-induced Cuts: Optimization with Lipschitzian Black-box Functions}
}

Díaz, A. E., Gupta, P., Cecchelli, D. M., Parczyk, O., and Sgueglia, A. (2024). Dirac’s Theorem for Graphs of Bounded Bandwidth. [arXiv]

[BibTeX]

@misc{2024_AlbertoEtAl_Diractheorembandwidth,
  archiveprefix = {arXiv},
  eprint = {2407.05889},
  primaryclass = {math.CO},
  year = {2024},
  author = {Díaz, Alberto Espuny and Gupta, Pranshu and Cecchelli, Domenico Mergoni and Parczyk, Olaf and Sgueglia, Amédeo},
  title = {Dirac's Theorem for Graphs of Bounded Bandwidth}
}

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

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

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

Illingworth, F., Lang, R., Müyesser, A., Parczyk, O., and Sgueglia, A. (2024). Spanning Spheres in Dirac Hypergraphs. [arXiv]

[BibTeX]

@misc{2024_FreddieEtAl_Spanningspheresdirac,
  archiveprefix = {arXiv},
  eprint = {2407.06275},
  primaryclass = {math.CO},
  year = {2024},
  author = {Illingworth, Freddie and Lang, Richard and Müyesser, Alp and Parczyk, Olaf and Sgueglia, Amédeo},
  title = {Spanning Spheres in Dirac Hypergraphs}
}

Goerigk, M., Hartisch, M., Merten, S., and Sharma, K. (2024). Feature-Based Interpretable Optimization. [arXiv]

[BibTeX]

@misc{2024_GoerigkHartischMertenSharma_Featureinterpretableoptimization,
  archiveprefix = {arXiv},
  eprint = {2409.01869},
  primaryclass = {math.OC},
  year = {2024},
  author = {Goerigk, Marc and Hartisch, Michael and Merten, Sebastian and Sharma, Kartikey},
  title = {Feature-Based Interpretable Optimization}
}

Głuch, G., Turan, B., Nagarajan, S. G., and Pokutta, S. (2024). The Good, the Bad and the Ugly: Watermarks, Transferable Attacks and Adversarial Defenses. [arXiv]

[BibTeX]

@misc{2024_GrzegorzTuranNagarajanPokutta_Watermarksadversarialdefenses,
  archiveprefix = {arXiv},
  eprint = {2410.08864},
  primaryclass = {cs.LG},
  year = {2024},
  author = {Głuch, Grzegorz and Turan, Berkant and Nagarajan, Sai Ganesh and Pokutta, Sebastian},
  title = {The Good, the Bad and the Ugly: Watermarks, Transferable Attacks and Adversarial Defenses}
}

Halbig, K., Hoen, A., Gleixner, A., Witzig, J., and Weninger, D. (2024). A Diving Heuristic for Mixed-integer Problems with Unbounded Semi-continuous Variables. [arXiv]

[BibTeX]

@misc{2024_HalbigEtAl_Divingheuristic,
  archiveprefix = {arXiv},
  eprint = {2403.19411},
  primaryclass = {math.OC},
  year = {2024},
  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}
}

Hoen, A., Kamp, D., and Gleixner, A. (2024). MIP-DD: A Delta Debugger for Mixed Integer Programming Solvers. [arXiv]

[BibTeX]

@misc{2024_HoenKampGleixner_Mipdebugger,
  archiveprefix = {arXiv},
  eprint = {2405.19770},
  primaryclass = {math.OC},
  year = {2024},
  author = {Hoen, Alexander and Kamp, Dominik and Gleixner, Ambros},
  title = {MIP-DD: A Delta Debugger for Mixed Integer Programming Solvers}
}

Kiem, A., Parczyk, O., and Spiegel, C. (2024). Forcing Graphs to Be Forcing. [arXiv]

[BibTeX]

@misc{2024_KiemParczykSpiegel_Forcing,
  archiveprefix = {arXiv},
  eprint = {2412.12904},
  primaryclass = {math.CO},
  year = {2024},
  author = {Kiem, Aldo and Parczyk, Olaf and Spiegel, Christoph},
  title = {Forcing Graphs to Be Forcing}
}

Liu, Y.-C., and Shang, J. (2024). Beating the Optimal Verification of Entangled States Via Collective Strategies. [arXiv]

[BibTeX]

@misc{2024_LiuShang_Collectiveverification,
  archiveprefix = {arXiv},
  eprint = {2410.00554},
  primaryclass = {quant-ph},
  year = {2024},
  author = {Liu, Ye-Chao and Shang, Jiangwei},
  title = {Beating the Optimal Verification of Entangled States Via Collective Strategies}
}

Mexi, G., Serrano, F., Berthold, T., Gleixner, A., and Nordström, J. (2024). Cut-based Conflict Analysis in Mixed Integer Programming. [arXiv]

[BibTeX]

@misc{2024_MexiSerranoBertholdGleixnerNordstroem_Cutbasedconflictanalysis,
  archiveprefix = {arXiv},
  eprint = {2410.15110},
  primaryclass = {math.OC},
  year = {2024},
  author = {Mexi, Gioni and Serrano, Felipe and Berthold, Timo and Gleixner, Ambros and Nordström, Jakob},
  title = {Cut-based Conflict Analysis in Mixed Integer Programming}
}

Mundinger, K., Zimmer, M., and Pokutta, S. (2024). Neural Parameter Regression for Explicit Representations of PDE Solution Operators. [arXiv]

[BibTeX]

@misc{2024_MundingerZimmerPokutta_Neuralparameterregression,
  archiveprefix = {arXiv},
  eprint = {2403.12764},
  primaryclass = {cs.LG},
  year = {2024},
  author = {Mundinger, Konrad and Zimmer, Max and Pokutta, Sebastian},
  title = {Neural Parameter Regression for Explicit Representations of PDE Solution Operators}
}

Parczyk, O., and Spiegel, C. (2024). An Unsure Note on an Un-Schur Problem. [arXiv]

[BibTeX]

@misc{2024_ParczykSpiegel_UnSchur,
  archiveprefix = {arXiv},
  eprint = {2410.22024},
  primaryclass = {math.CO},
  year = {2024},
  author = {Parczyk, Olaf and Spiegel, Christoph},
  title = {An Unsure Note on an Un-Schur Problem}
}

Haase, J., and Pokutta, S. (2024). Human-AI Co-Creativity: Exploring Synergies Across Levels of Creative Collaboration. [arXiv]

[BibTeX]

@misc{2024_Pokutta_HumanAICOcreative,
  archiveprefix = {arXiv},
  eprint = {2411.12527},
  primaryclass = {cs.HC},
  year = {2024},
  author = {Haase, Jennifer and Pokutta, Sebastian},
  title = {Human-AI Co-Creativity: Exploring Synergies Across Levels of Creative Collaboration}
}

Roux, C., Zimmer, M., and Pokutta, S. (2024). On the Byzantine-resilience of Distillation-based Federated Learning. [arXiv]

[BibTeX]

@misc{2024_RouxZimmerPokutta_Byzantineresilience,
  archiveprefix = {arXiv},
  eprint = {2402.12265},
  primaryclass = {cs.LG},
  year = {2024},
  author = {Roux, Christophe and Zimmer, Max and Pokutta, Sebastian},
  title = {On the Byzantine-resilience of Distillation-based Federated Learning}
}

Sadiku, S., Wagner, M., Nagarajan, S. G., and Pokutta, S. (2024). S-CFE: Simple Counterfactual Explanations. [arXiv]

[BibTeX]

@misc{2024_SadikuEtAl_Counterfactualexplanations,
  archiveprefix = {arXiv},
  eprint = {2410.15723},
  primaryclass = {cs.LG},
  year = {2024},
  author = {Sadiku, Shpresim and Wagner, Moritz and Nagarajan, Sai Ganesh and Pokutta, Sebastian},
  title = {S-CFE: Simple Counterfactual Explanations}
}

Wirth, E., Besançon, M., and Pokutta, S. (2024). The Pivoting Framework: Frank-Wolfe Algorithms with Active Set Size Control. [arXiv]

[BibTeX]

@misc{2024_WirthBesanconPokutta_Pivotingframework,
  archiveprefix = {arXiv},
  eprint = {2407.11760},
  primaryclass = {math.OC},
  year = {2024},
  author = {Wirth, Elias and Besançon, Mathieu and Pokutta, Sebastian},
  title = {The Pivoting Framework: Frank-Wolfe Algorithms with Active Set Size Control}
}

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

Xu, L., and D’Ambrosio, C. (2024). Formulations of the Continuous Set-covering Problem on Networks: a Comparative Study. [arXiv]

[BibTeX]

@misc{2024_XuDAmbrosio_FormulationsContinuousSetCovering,
  archiveprefix = {arXiv},
  eprint = {2404.10467},
  primaryclass = {math.OC},
  year = {2024},
  author = {Xu, Liding and D'Ambrosio, Claudia},
  title = {Formulations of the Continuous Set-covering Problem on Networks: a Comparative Study}
}

Xu, L., and Liberti, L. (2024). Relaxations for Binary Polynomial Optimization Via Signed Certificates. [arXiv]

[BibTeX]

@misc{2024_XuLiberti_RelaxationsBinaryPolynomial,
  archiveprefix = {arXiv},
  eprint = {2405.13447},
  primaryclass = {math.OC},
  year = {2024},
  author = {Xu, Liding and Liberti, Leo},
  title = {Relaxations for Binary Polynomial Optimization Via Signed Certificates}
}

Prause, F. (2023). A Multi-Swap Heuristic for Rolling Stock Rotation Planning with Predictive Maintenance (ZIB Report No. 23-29). Zuse Institute Berlin. [URL]

[BibTeX]

@techreport{2023_Prause_Multiswapheuristic,
  year = {2023},
  institution = {Zuse Institute Berlin},
  type = {ZIB Report},
  month = dec,
  number = {23-29},
  url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-93133},
  author = {Prause, Felix},
  title = {A Multi-Swap Heuristic for Rolling Stock Rotation Planning with Predictive Maintenance}
}

Prause, F., and Borndörfer, R. (2023). Construction of a Test Library for the Rolling Stock Rotation Problem with Predictive Maintenance (ZIB Report No. 23-20). Zuse Institute Berlin. [URL]

[BibTeX]

@techreport{2023_PrauseBorndoerfer_Rsrppredictivemaintenance,
  year = {2023},
  institution = {Zuse Institute Berlin},
  type = {ZIB Report},
  month = jul,
  number = {23-20},
  url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-91734},
  author = {Prause, Felix and Borndörfer, Ralf},
  title = {Construction of a Test Library for the Rolling Stock Rotation Problem with Predictive Maintenance}
}

Kerdreux, T., Scieur, D., d’Aspremont, A., and Pokutta, S. (2023). Strong Convexity of Feasible Sets in Riemannian Manifolds. [arXiv]

[BibTeX]

@misc{2022_KerdreuxScieurDaspremontPokutta_StrongconvexityRiemannianmanifolds,
  archiveprefix = {arXiv},
  eprint = {2312.03583},
  primaryclass = {math.OC},
  year = {2023},
  author = {Kerdreux, Thomas and Scieur, Damien and d'Aspremont, Alexandre and Pokutta, Sebastian},
  title = {Strong Convexity of Feasible Sets in Riemannian Manifolds}
}

Böttcher, J., Frankl, N., Cecchelli, D. M., Skokan, J., and Parczyk, O. (2023). Graphs with Large Minimum Degree and No Small Odd Cycles Are 3-colourable. [arXiv]

[BibTeX]

@misc{2023_BoettcherEtAl_Graphs3colourable,
  archiveprefix = {arXiv},
  eprint = {2302.01875},
  primaryclass = {math.CO},
  year = {2023},
  author = {Böttcher, Julia and Frankl, Nóra and Cecchelli, Domenico Mergoni and Skokan, Jozef and Parczyk, Olaf},
  title = {Graphs with Large Minimum Degree and No Small Odd Cycles Are 3-colourable}
}

Gelß, P., Klein, R., Matera, S., and Schmidt, B. (2023). Quantum Dynamics of Coupled Excitons and Phonons in Chain-like Systems: Tensor Train Approaches and Higher-order Propagators. [arXiv]

[BibTeX]

@misc{2023_GelssKleinMateraSchmidt_QuantumdynamicsTensortrain,
  archiveprefix = {arXiv},
  eprint = {2302.03568},
  primaryclass = {quant-ph},
  year = {2023},
  author = {Gelß, Patrick and Klein, Rupert and Matera, Sebastian and Schmidt, Burkhard},
  title = {Quantum Dynamics of Coupled Excitons and Phonons in Chain-like Systems: Tensor Train Approaches and Higher-order Propagators}
}

Klus, S., and Gelß, P. (2023). Continuous Optimization Methods for the Graph Isomorphism Problem. [arXiv]

[BibTeX]

@misc{2023_KlusGelss_Continuousgraphisomorphism,
  archiveprefix = {arXiv},
  eprint = {2311.16912},
  primaryclass = {cs.DM},
  year = {2023},
  author = {Klus, Stefan and Gelß, Patrick},
  title = {Continuous Optimization Methods for the Graph Isomorphism Problem}
}

Martínez-Rubio, D., Roux, C., Criscitiello, C., and Pokutta, S. (2023). Accelerated Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties. [arXiv]

[BibTeX]

@misc{2023_MartinezrubioRouxCriscitielloPokutta_Riemannianminmax,
  archiveprefix = {arXiv},
  eprint = {2305.16186},
  primaryclass = {math.OC},
  year = {2023},
  author = {Martínez-Rubio, David and Roux, Christophe and Criscitiello, Christopher and Pokutta, Sebastian},
  title = {Accelerated Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties}
}

Mattos, L., Cecchelli, D. M., and Parczyk, O. (2023). On Product Schur Triples in the Integers. [arXiv]

[BibTeX]

@misc{2023_MattosDomenicoParczyk_Productschurtriples,
  archiveprefix = {arXiv},
  eprint = {2311.18796},
  primaryclass = {math.CO},
  year = {2023},
  author = {Mattos, Letícia and Cecchelli, Domenico Mergoni and Parczyk, Olaf},
  title = {On Product Schur Triples in the Integers}
}

Sadiku, S., Wagner, M., and Pokutta, S. (2023). Group-wise Sparse and Explainable Adversarial Attacks. [arXiv]

[BibTeX]

@misc{2023_SadikuWagnerPokutta_Groupwisesparseattacks,
  archiveprefix = {arXiv},
  eprint = {2311.17434},
  primaryclass = {cs.CV},
  year = {2023},
  author = {Sadiku, Shpresim and Wagner, Moritz and Pokutta, Sebastian},
  title = {Group-wise Sparse and Explainable Adversarial Attacks}
}

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

[BibTeX]

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

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},
  primaryclass = {cs.RO},
  year = {2023},
  author = {Turner, Mark and Berthold, Timo and Besançon, Mathieu and Koch, Thorsten},
  title = {Branching Via Cutting Plane Selection: Improving Hybrid Branching}
}

Turner, M., Chmiela, A., Koch, T., and Winkler, M. (2023). PySCIPOpt-ML: Embedding Trained Machine Learning Models Into Mixed-integer Programs. [arXiv]

[BibTeX]

@misc{2023_TurnerChmielaKochMichael_Pyscipoptml,
  archiveprefix = {arXiv},
  eprint = {2312.08074},
  primaryclass = {math.OC},
  year = {2023},
  author = {Turner, Mark and Chmiela, Antonia and Koch, Thorsten and Winkler, Michael},
  title = {PySCIPOpt-ML: Embedding Trained Machine Learning Models Into Mixed-integer Programs}
}

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

[BibTeX]

@misc{2023_WirthJavierPokutta_Affineinvariantconvergence,
  archiveprefix = {arXiv},
  eprint = {2310.04096},
  primaryclass = {math.OC},
  year = {2023},
  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}
}

Woodstock, Z., and Pokutta, S. (2023). Splitting the Conditional Gradient Algorithm. [arXiv]

[BibTeX]

@misc{2023_WoodstockPokutta_Conditionalgradientnonconvex,
  archiveprefix = {arXiv},
  eprint = {2311.05381},
  primaryclass = {math.OC},
  year = {2023},
  author = {Woodstock, Zev and Pokutta, Sebastian},
  title = {Splitting the Conditional Gradient Algorithm}
}

Zimmer, M., Andoni, M., Spiegel, C., and Pokutta, S. (2023). PERP: Rethinking the Prune-Retrain Paradigm in the Era of LLMs. [arXiv] [code]

[BibTeX]

@misc{2023_ZimmerAndoniSpiegelPokutta_PerpPruneRetrain,
  archiveprefix = {arXiv},
  eprint = {2312.15230},
  primaryclass = {cs.CL},
  year = {2023},
  author = {Zimmer, Max and Andoni, Megi and Spiegel, Christoph and Pokutta, Sebastian},
  title = {PERP: Rethinking the Prune-Retrain Paradigm in the Era of LLMs},
  code = {https://github.com/ZIB-IOL/PERP}
}

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

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

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

Gelß, P., Klus, S., Knebel, S., Shakibaei, Z., and Pokutta, S. (2022). Low-rank Tensor Decompositions of Quantum Circuits. [arXiv]

[BibTeX]

@misc{2022_GelssKlusShakibaeiPokutta_Lowranktensordecompositions,
  archiveprefix = {arXiv},
  eprint = {2205.09882},
  primaryclass = {quant-ph},
  year = {2022},
  author = {Gelß, Patrick and Klus, Stefan and Knebel, Sebastian and Shakibaei, Zarin and Pokutta, Sebastian},
  title = {Low-rank Tensor Decompositions of Quantum Circuits}
}

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

Zimmer, M., Spiegel, C., and Pokutta, S. (2022). Compression-aware Training of Neural Networks Using Frank-Wolfe. [arXiv]

[BibTeX]

@misc{2022_ZimmerSpiegelPokutta_Compressionawaretraining,
  archiveprefix = {arXiv},
  eprint = {2205.11921},
  primaryclass = {cs.LG},
  year = {2022},
  author = {Zimmer, Max and Spiegel, Christoph and Pokutta, Sebastian},
  title = {Compression-aware Training of Neural Networks Using Frank-Wolfe}
}

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 = {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 Rehfeldt, 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}
}

Bolusani, S., Coniglio, S., Ralphs, T. K., and Tahernejad, S. (2021). A Unified Framework for Multistage Mixed Integer Linear Optimization. [arXiv]

[BibTeX]

@misc{2021_BolusaniConiglioRalphsTahernejad_Unifiedmultistagemilp,
  archiveprefix = {arXiv},
  eprint = {2104.09003},
  primaryclass = {math.OC},
  year = {2021},
  author = {Bolusani, Suresh and Coniglio, Stefano and Ralphs, Ted K. and Tahernejad, Sahar},
  title = {A Unified Framework for Multistage Mixed Integer Linear Optimization}
}

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

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

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

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

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

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

Pokutta, S., Spiegel, C., and Zimmer, M. (2020). Deep Neural Network Training with Frank-Wolfe. [arXiv] [summary] [code]

[BibTeX]

@misc{2020_PokuttaSpiegelZimmer_Frankwolfeneuralnetworks,
  archiveprefix = {arXiv},
  eprint = {2010.07243},
  primaryclass = {cs.LG},
  year = {2020},
  author = {Pokutta, Sebastian and Spiegel, Christoph and Zimmer, Max},
  title = {Deep Neural Network Training with Frank-Wolfe},
  code = {https://github.com/ZIB-IOL/StochasticFrankWolfe},
  summary = {https://pokutta.com/blog/research/2020/11/11/NNFW.html}
}

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

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

Conference Proceedings

Wäldchen, S., Sharma, K., Turan, B., Zimmer, M., and Pokutta, S. (2024). Interpretability Guarantees with Merlin-Arthur Classifiers. Proceedings of the International Conference on Artificial Intelligence and Statistics. [arXiv]

[BibTeX]

@inproceedings{2022_WaeldchenEtAl_Interpretabilityguarantees,
  year = {2024},
  booktitle = {Proceedings of the International Conference on Artificial Intelligence and Statistics},
  archiveprefix = {arXiv},
  eprint = {2206.00759},
  primaryclass = {cs.LG},
  author = {Wäldchen, Stephan and Sharma, Kartikey and Turan, Berkant and Zimmer, Max and Pokutta, Sebastian},
  title = {Interpretability Guarantees with Merlin-Arthur Classifiers}
}

Hendrych, D., Besançon, M., and Pokutta, S. (2024). 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}
}

Kiem, A., Pokutta, S., and Spiegel, C. (2024). The Four-color Ramsey Multiplicity of Triangles. Proceedings of the Discrete Mathematics Days. [URL] [arXiv] [code]

[BibTeX]

@inproceedings{2023_KiemPokuttaSpiegel_4colorramsey,
  year = {2024},
  booktitle = {Proceedings of the Discrete Mathematics Days},
  url = {https://dmd2024.web.uah.es/files/abstracts/paper_3.pdf},
  archiveprefix = {arXiv},
  eprint = {2312.08049},
  primaryclass = {math.CO},
  author = {Kiem, Aldo and Pokutta, Sebastian and Spiegel, Christoph},
  title = {The Four-color Ramsey Multiplicity of Triangles},
  code = {https://github.com/FordUniver/kps_trianglemult}
}

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

Zimmer, M., Spiegel, C., and Pokutta, S. (2024). Sparse Model Soups: A Recipe for Improved Pruning Via Model Averaging. Proceedings of the International Conference on Learning Representations. [URL] [arXiv]

[BibTeX]

@inproceedings{2023_ZimmerSpiegelPokutta_Sparsemodelsoups,
  year = {2024},
  booktitle = {Proceedings of the International Conference on Learning Representations},
  url = {https://iclr.cc/virtual/2024/poster/17433},
  archiveprefix = {arXiv},
  eprint = {2306.16788},
  primaryclass = {cs.LG},
  author = {Zimmer, Max and Spiegel, Christoph and Pokutta, Sebastian},
  title = {Sparse Model Soups: A Recipe for Improved Pruning Via Model Averaging}
}

Eifler, L., Witzig, J., and Gleixner, A. (2024). 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},
  booktitle = {Proceedings of the International Symposium on Combinatorial Optimization},
  doi = {10.1007/978-3-031-60924-4_8},
  archiveprefix = {arXiv},
  eprint = {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}
}

Ghannam, M., Mexi, G., Lam, E., and Gleixner, A. (2024). 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},
  booktitle = {Proceedings of the INFORMS Optimization Society Conference},
  url = {https://sites.google.com/view/ios2024refereed},
  archiveprefix = {arXiv},
  eprint = {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}
}

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

Kiem, A., Pokutta, S., and Spiegel, C. (2024). Categorification of Flag Algebras. Proceedings of the Discrete Mathematics Days. [URL]

[BibTeX]

@inproceedings{2024_KiemPokuttaSpiegel_Categorificationflagalgebras,
  year = {2024},
  booktitle = {Proceedings of the Discrete Mathematics Days},
  url = {https://dmd2024.web.uah.es/files/abstracts/paper_47.pdf},
  author = {Kiem, Aldo and Pokutta, Sebastian and Spiegel, Christoph},
  title = {Categorification of Flag Algebras}
}

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

Mundinger, K., Pokutta, S., Spiegel, C., and Zimmer, M. (2024). Extending the Continuum of Six-Colorings. Proceedings of the Discrete Mathematics Days. [URL] [arXiv]

[BibTeX]

@inproceedings{2024_MundingerPokuttaSpiegelZimmer_SixcoloringsExpansion:1,
  year = {2024},
  booktitle = {Proceedings of the Discrete Mathematics Days},
  url = {https://dmd2024.web.uah.es/files/abstracts/paper_27.pdf},
  archiveprefix = {arXiv},
  eprint = {2404.05509},
  primaryclass = {math.CO},
  author = {Mundinger, Konrad and Pokutta, Sebastian and Spiegel, Christoph and Zimmer, Max},
  title = {Extending the Continuum of Six-Colorings}
}

Pauls, J., Zimmer, M., Kelly, U. M., Schwartz, M., Saatchi, S., Ciais, P., Pokutta, S., Brandt, M., and Gieseke, F. (2024). Estimating Canopy Height at Scale. Proceedings of the International Conference on Machine Learning. [arXiv] [code]

[BibTeX]

@inproceedings{2024_PaulsEtAl_Canopyheightestimation,
  year = {2024},
  booktitle = {Proceedings of the International Conference on Machine Learning},
  archiveprefix = {arXiv},
  eprint = {2406.01076},
  primaryclass = {cs.CV},
  author = {Pauls, Jan and Zimmer, Max and Kelly, Una M and Schwartz, Martin and Saatchi, Sassan and Ciais, Philippe and Pokutta, Sebastian and Brandt, Martin and Gieseke, Fabian},
  title = {Estimating Canopy Height at Scale},
  code = {https://github.com/AI4Forest/Global-Canopy-Height-Map}
}

Sharma, K., Hendrych, D., Besançon, M., and Pokutta, S. (2024). 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}
}

Zimmer, M., Spiegel, C., and Pokutta, S. (2023). How I Learned to Stop Worrying and Love Retraining. Proceedings of the International Conference on Learning Representations. [URL] [arXiv] [code]

[BibTeX]

@inproceedings{2021_ZimmerSpiegelPokutta_Retrainingpruning,
  year = {2023},
  booktitle = {Proceedings of the International Conference on Learning Representations},
  url = {https://iclr.cc/virtual/2023/poster/10914},
  archiveprefix = {arXiv},
  eprint = {2111.00843},
  primaryclass = {cs.LG},
  author = {Zimmer, Max and Spiegel, Christoph and Pokutta, Sebastian},
  title = {How I Learned to Stop Worrying and Love Retraining},
  code = {https://github.com/ZIB-IOL/BIMP}
}

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},
  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},
  primaryclass = {math.OC},
  author = {Bestuzheva, Ksenia and Gleixner, Ambros and Achterberg, Tobias},
  title = {Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms}
}

Martínez-Rubio, D., and Pokutta, S. (2023). 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}
}

Parczyk, O., Pokutta, S., Spiegel, C., and Szabó, T. (2023). Fully Computer-assisted Proofs in Extremal Combinatorics. Proceedings of the AAAI Conference on Artificial Intelligence. DOI: 10.1609/aaai.v37i10.26470 [URL] [arXiv] [code]

[BibTeX]

@inproceedings{2022_ParczykPokuttaSpiegelSzabo_Ramseymultiplicityheuristics:1,
  year = {2023},
  booktitle = {Proceedings of the AAAI Conference on Artificial Intelligence},
  doi = {10.1609/aaai.v37i10.26470},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/26470},
  archiveprefix = {arXiv},
  eprint = {2206.04036},
  primaryclass = {math.CO},
  author = {Parczyk, Olaf and Pokutta, Sebastian and Spiegel, Christoph and Szabó, Tibor},
  title = {Fully Computer-assisted Proofs in Extremal Combinatorics},
  code = {https://zenodo.org/record/6602512#.YyvFhi8Rr5g}
}

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

Wirth, E., Kera, H., and Pokutta, S. (2023). 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}
}

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

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},
  booktitle = {Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
  pages = {114-123},
  doi = {10.1007/978-3-031-33271-5_8},
  archiveprefix = {arXiv},
  eprint = {2304.03755},
  primaryclass = {math.OC},
  author = {Chmiela, Antonia and Gleixner, Ambros and Lichocki, Pawel and Pokutta, Sebastian},
  title = {Online Learning for Scheduling MIP Heuristics}
}

Chmiela, A., Muñoz, G., and Serrano, F. (2023). 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},
  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}
}

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

Ghannam, M., and Gleixner, A. (2023). 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},
  primaryclass = {cs.NE},
  author = {Ghannam, Mohammed and Gleixner, Ambros},
  title = {Hybrid Genetic Search for Dynamic Vehicle Routing with Time Windows}
}

Martínez-Rubio, D., Wirth, E., and Pokutta, S. (2023). 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}
}

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

Mexi, G., Besançon, M., Bolusani, S., Chmiela, A., Hoen, A., and Gleixner, A. (2023). 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. [arXiv]

[BibTeX]

@inproceedings{2023_MexiEtAl_Scyllaheuristic,
  year = {2023},
  booktitle = {Proceedings of the Conference of the Society for Operations Research in Germany},
  archiveprefix = {arXiv},
  eprint = {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}
}

Rué, J. J., and Spiegel, C. (2023). The Rado Multiplicity Problem in Vector Spaces Over Finite Fields. Proceedings of the European Conference on Combinatorics, Graph Theory and Applications. DOI: 10.5817/CZ.MUNI.EUROCOMB23-108 [URL] [arXiv] [code]

[BibTeX]

@inproceedings{2023_RueSpiegel_Radomultiplicity,
  year = {2023},
  booktitle = {Proceedings of the European Conference on Combinatorics, Graph Theory and Applications},
  doi = {10.5817/CZ.MUNI.EUROCOMB23-108},
  url = {https://journals.muni.cz/eurocomb/article/view/35642},
  archiveprefix = {arXiv},
  eprint = {2304.00400},
  primaryclass = {math.CO},
  author = {Rué, Juan José and Spiegel, Christoph},
  title = {The Rado Multiplicity Problem in Vector Spaces Over Finite Fields},
  code = {https://github.com/FordUniver/rs_radomult_23}
}

Thuerck, D., Sofranac, B., Pfetsch, M., and Pokutta, S. (2023). Learning Cuts Via Enumeration Oracles. Proceedings of the Conference on Neural Information Processing Systems. [arXiv]

[BibTeX]

@inproceedings{2023_ThuerckSofranacPfetschPokutta_Learningcutsenumeration,
  year = {2023},
  booktitle = {Proceedings of the Conference on Neural Information Processing Systems},
  archiveprefix = {arXiv},
  eprint = {2305.12197},
  primaryclass = {math.OC},
  author = {Thuerck, Daniel and Sofranac, Boro and Pfetsch, Marc and Pokutta, Sebastian},
  title = {Learning Cuts Via Enumeration Oracles}
}

Turner, M., Berthold, T., and Besançon, M. (2023). 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},
  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}
}

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

Búi, M. N., Combettes, P. L., and Woodstock, Z. (2022). 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}
}

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

Macdonald, J., Besançon, M., and Pokutta, S. (2022). 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}
}

Tsuji, K., Tanaka, K., and Pokutta, S. (2022). Pairwise Conditional Gradients without Swap Steps and Sparser Kernel Herding. Proceedings of the International Conference on Machine Learning. [arXiv] [summary] [slides] [code] [video]

[BibTeX]

@inproceedings{2021_TsujiTanakaPokutta_Pairwiseconditionalgradients,
  year = {2022},
  booktitle = {Proceedings of the International Conference on Machine Learning},
  archiveprefix = {arXiv},
  eprint = {2110.12650},
  primaryclass = {cond-mat.quant-gas},
  author = {Tsuji, Kazuma and Tanaka, Ken'ichiro and Pokutta, Sebastian},
  title = {Pairwise Conditional Gradients without Swap Steps and Sparser Kernel Herding},
  code = {https://github.com/ZIB-IOL/FrankWolfe.jl},
  slides = {https://pokutta.com/slides/20220624_ICML2022_BPCG.pdf},
  summary = {https://pokutta.com/blog/research/2022/05/21/bpcg-abstract.html},
  video = {https://slideslive.com/38983561}
}

Parczyk, O., Pokutta, S., Spiegel, C., and Szabó, T. (2022). New Ramsey Multiplicity Bounds and Search Heuristics. Proceedings of the Discrete Mathematics Days. [arXiv] [code]

[BibTeX]

@inproceedings{2022_ParczykPokuttaSpiegelSzabo_Ramseymultiplicityheuristics:2,
  year = {2022},
  booktitle = {Proceedings of the Discrete Mathematics Days},
  archiveprefix = {arXiv},
  eprint = {2206.04036},
  primaryclass = {math.CO},
  author = {Parczyk, Olaf and Pokutta, Sebastian and Spiegel, Christoph and Szabó, Tibor},
  title = {New Ramsey Multiplicity Bounds and Search Heuristics},
  code = {https://zenodo.org/record/6602512#.YyvFhi8Rr5g}
}

Wäldchen, S., Huber, F., and Pokutta, S. (2022). Training Characteristic Functions with Reinforcement Learning: XAI-methods Play Connect Four. Proceedings of the International Conference on Machine Learning. [arXiv] [poster] [video]

[BibTeX]

@inproceedings{2022_WaeldchenHuberPokutta_CharacteristicfunctionsReinforcementlearning,
  year = {2022},
  booktitle = {Proceedings of the International Conference on Machine Learning},
  archiveprefix = {arXiv},
  eprint = {2202.11797},
  primaryclass = {cs.LG},
  author = {Wäldchen, Stephan and Huber, Felix and Pokutta, Sebastian},
  title = {Training Characteristic Functions with Reinforcement Learning: XAI-methods Play Connect Four},
  poster = {https://pokutta.com/slides/20220712_icml_poster_conn4.pdf},
  video = {https://slideslive.com/38983111}
}

Wirth, E., and Pokutta, S. (2022). 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}
}

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

[BibTeX]

@inproceedings{2023_BestuzhevaGleixnerVlker_Soncconstraints,
  year = {2022},
  booktitle = {Proceedings of the Proceedings of the Hungarian Global Optimization Workshop HUGO 2022},
  pages = {41-44},
  url = {https://inf.u-szeged.hu/hugo/},
  archiveprefix = {arXiv},
  eprint = {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}
}

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

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

Carderera, A., Diakonikolas, J., Lin, C. Y., and Pokutta, S. (2021, February). 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}
}

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

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

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

Combettes, C., and Pokutta, S. (2020, March). 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}
}

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

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

Hoppmann-Baum, K., Mexi, G., Burdakov, O., Casselgren, C. J., and Koch, T. (2020). Minimum Cycle Partition with Length Requirements. Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 12296, 273–282. DOI: 10.1007/978-3-030-58942-4_18

[BibTeX]

@inproceedings{2020_HoppmannEtAl_Minimumcyclepartition,
  year = {2020},
  booktitle = {Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
  volume = {12296},
  pages = {273-282},
  doi = {10.1007/978-3-030-58942-4_18},
  author = {Hoppmann-Baum, Kai and Mexi, Gioni and Burdakov, Oleg and Casselgren, Carl Johan and Koch, Thorsten},
  title = {Minimum Cycle Partition with Length Requirements}
}

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},
  pages = {1-11},
  doi = {10.1109/IA351965.2020.00007},
  archiveprefix = {arXiv},
  eprint = {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}
}

Ziemke, T., Sering, L., Vargas Koch, L., Zimmer, M., Nagel, K., and Skutella, M. (2020). Flows Over Time As Continuous Limits of Packet-based Network Simulations. Proceedings of the EURO Working Group on Transportation Meeting.

[BibTeX]

@inproceedings{2021_ZiemkeEtAl_Flowscontinuouslimits:1,
  year = {2020},
  booktitle = {Proceedings of the EURO Working Group on Transportation Meeting},
  author = {Ziemke, Theresa and Sering, Leon and Vargas Koch, Laura and Zimmer, Max and Nagel, Kai and Skutella, Martin},
  title = {Flows Over Time As Continuous Limits of Packet-based Network Simulations}
}

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

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

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

Diakonikolas, J., Carderera, A., and Pokutta, S. (2019). 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}
}

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},
  primaryclass = {math.OC},
  author = {Kerdreux, Thomas and d'Aspremont, Alexandre and Pokutta, Sebastian},
  title = {Restarting Frank-Wolfe},
  slides = {https://app.box.com/s/prd32r6xmuef2k4gah23rd0egllz9rv5}
}

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

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

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

Arumugam, K., Kadampot, I., Tahmasbi, M., Shah, S., Bloch, M., and Pokutta, S. (2017). Modulation Recognition Using Side Information and Hybrid Learning. Proceedings of the Proceedings of IEEE DySPAN.

[BibTeX]

@inproceedings{2017_ArumugamKadampotTahmasbiShahBlochPokutta_ModulationRecognition,
  year = {2017},
  booktitle = {Proceedings of the Proceedings of IEEE DySPAN},
  author = {Arumugam, K. and Kadampot, I. and Tahmasbi, M. and Shah, S. and Bloch, M. and Pokutta, Sebastian},
  title = {Modulation Recognition Using Side Information and Hybrid Learning}
}

Kusch, C., Rué, J. J., Spiegel, C., and Szabó, T. (2017). Random Strategies Are Nearly Optimal for Generalized Van Der Waerden Games. Proceedings of the European Conference on Combinatorics, Graph Theory and Applications. [URL] [arXiv]

[BibTeX]

@inproceedings{2017_KuschRueSpiegelSzabo_Uniformrandomstrategy:1,
  year = {2017},
  booktitle = {Proceedings of the European Conference on Combinatorics, Graph Theory and Applications},
  url = {https://dmg.tuwien.ac.at/eurocomb2017/index.php/accepted-papers/},
  archiveprefix = {arXiv},
  eprint = {2411.02622},
  primaryclass = {cs.LG},
  author = {Kusch, Christopher and Rué, Juan José and Spiegel, Christoph and Szabó, Tibor},
  title = {Random Strategies Are Nearly Optimal for Generalized Van Der Waerden Games}
}

Lan, G., Pokutta, S., Zhou, Y., and Zink, D. (2017). 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}
}

Roy, A., Xu, H., and Pokutta, S. (2017). Reinforcement Learning Under Model Mismatch. Proceedings of the Conference on Neural Information Processing Systems. [arXiv]

[BibTeX]

@inproceedings{2017_RoyXuPokutta_ReinforcementLearning,
  year = {2017},
  booktitle = {Proceedings of the Conference on Neural Information Processing Systems},
  archiveprefix = {arXiv},
  eprint = {1706.04711},
  primaryclass = {cs.LG},
  author = {Roy, Aurko and Xu, Huan and Pokutta, Sebastian},
  title = {Reinforcement Learning Under Model Mismatch}
}

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},
  primaryclass = {cs.CC},
  author = {Braun, Gábor and Pokutta, Sebastian and Roy, Aurko},
  title = {Strong Reductions for Extended Formulations}
}

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 [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}
}

Roy, A., and Pokutta, S. (2016). 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}
}

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

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 [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}
}

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

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

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

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

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)}
}

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

[BibTeX]

@inproceedings{2011_BraunPokutta_Randomhalfintegralpolytopes:1,
  year = {2010},
  booktitle = {Proceedings of the Electronic Notes in Discrete Mathematics},
  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}
}

Full Articles

Abbas, A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D. J., Elmegreen, B. G., Franco, N., Fratini, F., Fuller, B., Gacon, J., Gonciulea, C., Gribling, S., Gupta, S., Hadfield, S., Heese, R., … Zoufal, C. (2024). Challenges and Opportunities in Quantum Optimization. Nature Reviews Physics. DOI: https://doi.org/10.1038/s42254-024-00770-9 [arXiv]

[BibTeX]

@article{2023_AmiraEtAl_Quantumoptimization,
  year = {2024},
  journal = {Nature Reviews Physics},
  month = sep,
  doi = {https://doi.org/10.1038/s42254-024-00770-9},
  archiveprefix = {arXiv},
  eprint = {2312.02279},
  primaryclass = {quant-ph},
  author = {Abbas, Amira and Ambainis, Andris and Augustino, Brandon and Bärtschi, Andreas and Buhrman, Harry and Coffrin, Carleton and Cortiana, Giorgio and Dunjko, Vedran and Egger, Daniel J. and Elmegreen, Bruce G. and Franco, Nicola and Fratini, Filippo and Fuller, Bryce and Gacon, Julien and Gonciulea, Constantin and Gribling, Sander and Gupta, Swati and Hadfield, Stuart and Heese, Raoul and Kircher, Gerhard and Kleinert, Thomas and Koch, Thorsten and Korpas, Georgios and Lenk, Steve and Marecek, Jakub and Markov, Vanio and Mazzola, Guglielmo and Mensa, Stefano and Mohseni, Naeimeh and Nannicini, Giacomo and O'Meara, Corey and Peña Tapia, Elena and Pokutta, Sebastian and Proissl, Manuel and Rebentrost, Patrick and Sahin, Emre and Symons, Benjamin C. B. and Tornow, Sabine and Valls, Victor and Woerner, Stefan and Wolf-Bauwens, Mira L. and Yard, Jon and Yarkoni, Sheir and Zechiel, Dirk and Zhuk, Sergiy and Zoufal, Christa},
  title = {Challenges and Opportunities in Quantum Optimization}
}

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

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},
  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”}
}

Pokutta, S. (2024). 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},
  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}
}

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},
  primaryclass = {math.OC},
  author = {Bestuzheva, Ksenia and Gleixner, Ambros and Achterberg, Tobias},
  title = {Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms}
}

Deza, A., Pokutta, S., and Pournin, L. (2024). The Complexity of Geometric Scaling. Operations Research Letters, 52. DOI: 10.1016/j.orl.2023.11.010 [arXiv]

[BibTeX]

@article{2022_DezaPokuttaPournin_Geometricscaling,
  year = {2024},
  journal = {Operations Research Letters},
  volume = {52},
  doi = {10.1016/j.orl.2023.11.010},
  archiveprefix = {arXiv},
  eprint = {2205.04063},
  primaryclass = {math.OC},
  author = {Deza, Antoine and Pokutta, Sebastian and Pournin, Lionel},
  title = {The Complexity of Geometric Scaling}
}

Parczyk, O., Pokutta, S., Spiegel, C., and Szabó, T. (2024). New Ramsey Multiplicity Bounds and Search Heuristics. Foundations of Computational Mathematics. DOI: 10.1007/s10208-024-09675-6 [arXiv] [code]

[BibTeX]

@article{2022_ParczykPokuttaSpiegelSzabo_Ramseymultiplicityheuristics,
  year = {2024},
  journal = {Foundations of Computational Mathematics},
  doi = {10.1007/s10208-024-09675-6},
  archiveprefix = {arXiv},
  eprint = {2206.04036},
  primaryclass = {math.CO},
  author = {Parczyk, Olaf and Pokutta, Sebastian and Spiegel, Christoph and Szabó, Tibor},
  title = {New Ramsey Multiplicity Bounds and Search Heuristics},
  code = {https://zenodo.org/record/6602512#.YyvFhi8Rr5g}
}

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},
  doi = {10.1007/s12532-024-00256-w},
  archiveprefix = {arXiv},
  eprint = {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}
}

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

Deza, A., Onn, S., Pokutta, S., and Pournin, L. (2024). 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}
}

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},
  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},
  primaryclass = {math.OC},
  author = {Eifler, Leon and Gleixner, Ambros},
  title = {Safe and Verified Gomory Mixed Integer Cuts in a Rational MIP Framework}
}

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},
  doi = {10.1007/s10107-024-02104-0},
  archiveprefix = {arXiv},
  eprint = {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}
}

Gelß, P., Issagali, A., and Kornhuber, R. (2024). Fredholm Integral Equations for Function Approximation and the Training of Neural Networks. SIAM Journal on Mathematics of Data Science. DOI: 10.1137/23M156642X [URL] [arXiv]

[BibTeX]

@article{2023_GelssIssagaliKornhuber_Fredholmneuralnetworks,
  year = {2024},
  journal = {SIAM Journal on Mathematics of Data Science},
  doi = {10.1137/23M156642X},
  url = {https://epubs.siam.org/doi/abs/10.1137/23M156642X},
  archiveprefix = {arXiv},
  eprint = {2303.05262},
  primaryclass = {math.NA},
  author = {Gelß, Patrick and Issagali, Aizhan and Kornhuber, Ralf},
  title = {Fredholm Integral Equations for Function Approximation and the Training of Neural Networks}
}

Stengl, S.-M., Gelß, P., Klus, S., and Pokutta, S. (2024). Existence and Uniqueness of Solutions of the Koopman–von Neumann Equation on Bounded Domains. Journal of Physics A: Mathematical and Theoretical. DOI: 10.1088/1751-8121/ad6f7d [URL] [arXiv]

[BibTeX]

@article{2023_StenglGelssKlusPokutta_Koopmanvonneumann,
  year = {2024},
  journal = {Journal of Physics A: Mathematical and Theoretical},
  doi = {10.1088/1751-8121/ad6f7d},
  url = {https://iopscience.iop.org/article/10.1088/1751-8121/ad6f7d},
  archiveprefix = {arXiv},
  eprint = {2306.13504},
  primaryclass = {math.AP},
  author = {Stengl, Steven-Marian and Gelß, Patrick and Klus, Stefan and Pokutta, Sebastian},
  title = {Existence and Uniqueness of Solutions of the Koopman--von Neumann Equation on Bounded Domains}
}

Stengl, S.-M. (2024). An Alternative Formulation of the Quantum Phase Estimation Using Projection-based Tensor Decompositions. Quantum Information Processing, 23. DOI: 10.1007/s11128-024-04347-4 [URL] [arXiv]

[BibTeX]

@article{2023_Stengl_Quantumphaseestimation,
  year = {2024},
  journal = {Quantum Information Processing},
  volume = {23},
  doi = {10.1007/s11128-024-04347-4},
  url = {https://link.springer.com/article/10.1007/s11128-024-04347-4},
  archiveprefix = {arXiv},
  eprint = {2303.05894},
  primaryclass = {quant-ph},
  author = {Stengl, Steven-Marian},
  title = {An Alternative Formulation of the Quantum Phase Estimation Using Projection-based Tensor Decompositions}
}

Designolle, S., Vértesi, T., and Pokutta, S. (2024). 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}
}

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},
  doi = {10.1016/j.orl.2024.107105},
  url = {https://sciencedirect.com/science/article/abs/pii/S0167637724000415},
  archiveprefix = {arXiv},
  eprint = {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.}
}

Mundinger, K., Pokutta, S., Spiegel, C., and Zimmer, M. (2024). Extending the Continuum of Six-Colorings. Geombinatorics Quarterly, XXXIV. [URL] [arXiv]

[BibTeX]

@article{2024_MundingerPokuttaSpiegelZimmer_SixcoloringsExpansion,
  year = {2024},
  journal = {Geombinatorics Quarterly},
  volume = {XXXIV},
  url = {https://geombina.uccs.edu/past-issues/volume-xxxiv},
  archiveprefix = {arXiv},
  eprint = {2404.05509},
  primaryclass = {math.CO},
  author = {Mundinger, Konrad and Pokutta, Sebastian and Spiegel, Christoph and Zimmer, Max},
  title = {Extending the Continuum of Six-Colorings}
}

Vu‐Han, T. L., Sunkara, V., Bermudez‐Schettino, R., Schwechten, J., Runge, R., Perka, C., Winkler, T., Pokutta, S., Weiß, C., and Pumberger, M. (2024). Feature Engineering for the Prediction of Scoliosis in 5q‐Spinal Muscular Atrophy. Journal of Cachexia, Sarcopenia and Muscle. DOI: 10.1002/jcsm.13599 [URL]

[BibTeX]

@article{2024_Pokutta_PredictionScoliosis,
  year = {2024},
  journal = {Journal of Cachexia, Sarcopenia and Muscle},
  doi = {10.1002/jcsm.13599},
  url = {https://onlinelibrary.wiley.com/doi/pdf/10.1002/jcsm.13599},
  author = {Vu‐Han, Tu‐Lan and Sunkara, Vikram and Bermudez‐Schettino, Rodrigo and Schwechten, Jakob and Runge, Robin and Perka, Carsten and Winkler, Tobias and Pokutta, Sebastian and Weiß, Claudia and Pumberger, Matthias},
  title = {Feature Engineering for the Prediction of Scoliosis in 5q‐Spinal Muscular Atrophy}
}

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

Kevin-Martin, A., Bärmann, A., Braun, K., Liers, F., Pokutta, S., Schneider, O., Sharma, K., and Tschuppik, S. (2023). Data-driven Distributionally Robust Optimization Over Time. INFORMS Journal on Optimization, 5(4), 376–394. DOI: 10.1287/ijoo.2023.0091 [URL] [arXiv]

[BibTeX]

@article{2023_KevinEtAl_Datadrivendistributionallyrobust,
  year = {2023},
  journal = {INFORMS Journal on Optimization},
  month = oct,
  volume = {5},
  number = {4},
  pages = {376-394},
  doi = {10.1287/ijoo.2023.0091},
  url = {https://pubsonline.informs.org/doi/pdf/10.1287/ijoo.2023.0091},
  archiveprefix = {arXiv},
  eprint = {2304.05377},
  primaryclass = {math.OC},
  author = {Kevin-Martin, Aigner and Bärmann, Andreas and Braun, Kristin and Liers, Frauke and Pokutta, Sebastian and Schneider, Oskar and Sharma, Kartikey and Tschuppik, Sebastian},
  title = {Data-driven Distributionally Robust Optimization Over Time}
}

Bienstock, D., Muñoz, G., and Pokutta, S. (2023). Principled Deep Neural Network Training Through Linear Programming. Discrete Optimization, 49. DOI: 10.1016/j.disopt.2023.100795 [arXiv] [summary]

[BibTeX]

@article{2018_DanielGonzaloPokutta_Polyhedraltraining,
  year = {2023},
  journal = {Discrete Optimization},
  month = aug,
  volume = {49},
  doi = {10.1016/j.disopt.2023.100795},
  archiveprefix = {arXiv},
  eprint = {1810.03218},
  primaryclass = {cs.LG},
  author = {Bienstock, Daniel and Muñoz, Gonzalo and Pokutta, Sebastian},
  title = {Principled Deep Neural Network Training Through Linear Programming},
  summary = {https://www.pokutta.com/blog/research/2018/10/12/DNN-learning-lp-abstract.html}
}

Besançon, M., Garcia, J. D., 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},
  primaryclass = {cs.LG},
  author = {Besançon, Mathieu and Garcia, Joaquim Dias and Legat, Benoît and Sharma, Akshay},
  title = {Flexible Differentiable Optimization Via Model Transformations}
}

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

Liberti, L., Iommazzo, G., Lavor, C., and Maculan, N. (2023). Cycle-based Formulations in Distance Geometry. Open Journal of Mathematical Optimization, 4(1). DOI: 10.5802/ojmo.18 [arXiv]

[BibTeX]

@article{2020_LibertiIommazzoLavorMaculan_Cycledistancegeometry_1,
  year = {2023},
  journal = {Open Journal of Mathematical Optimization},
  volume = {4},
  number = {1},
  doi = {10.5802/ojmo.18},
  archiveprefix = {arXiv},
  eprint = {2006.11523},
  primaryclass = {math.OC},
  author = {Liberti, Leo and Iommazzo, Gabriele and Lavor, Carlile and Maculan, Nelson},
  title = {Cycle-based Formulations in Distance Geometry}
}

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},
  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},
  primaryclass = {math.OC},
  author = {Bestuzheva, Ksenia and Gleixner, Ambros and Vigerske, Stefan},
  title = {A Computational Study of Perspective Cuts}
}

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},
  doi = {10.1287/ijoc.2022.0171},
  archiveprefix = {arXiv},
  eprint = {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}
}

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

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

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},
  doi = {10.1145/3585516},
  archiveprefix = {arXiv},
  eprint = {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 Rehfeldt, 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}
}

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

Eifler, L., and Gleixner, A. (2023). 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},
  volume = {197},
  pages = {793-812},
  doi = {10.1007/s10107-021-01749-5},
  archiveprefix = {arXiv},
  eprint = {2101.09141},
  primaryclass = {math.OC},
  author = {Eifler, Leon and Gleixner, Ambros},
  title = {A Computational Status Update for Exact Rational Mixed Integer Programming}
}

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

Kruser, J., Sharma, K., Holl, J., and Nohadani, O. (2023). Identifying Patterns of Medical Intervention in Acute Respiratory Failure: A Retrospective Observational Study. Critical Care Explorations.

[BibTeX]

@article{2023_KruserSharmaHollNohadani_Medicalinterventionpatterns,
  year = {2023},
  journal = {Critical Care Explorations},
  author = {Kruser, Jacqueline and Sharma, Kartikey and Holl, Jane and Nohadani, Omid},
  title = {Identifying Patterns of Medical Intervention in Acute Respiratory Failure: A Retrospective Observational Study}
}

Riedel, J., Gelß, P., Klein, R., and Schmidt, B. (2023). WaveTrain: A Python Package for Numerical Quantum Mechanics of Chain-like Systems Based on Tensor Trains. The Journal of Chemical Physics, 158(16), 164801. DOI: 10.1063/5.0147314 [URL] [arXiv]

[BibTeX]

@article{2023_RiedelGelssKleinSchmidt_Wavetrain,
  year = {2023},
  journal = {The Journal of Chemical Physics},
  volume = {158},
  number = {16},
  pages = {164801},
  doi = {10.1063/5.0147314},
  url = {https://pubs.aip.org/aip/jcp/article/158/16/164801/2887212/WaveTrain-A-Python-package-for-numerical-quantum},
  archiveprefix = {arXiv},
  eprint = {2302.03725},
  primaryclass = {quant-ph},
  author = {Riedel, Jerome and Gelß, Patrick and Klein, Rupert and Schmidt, Burkhard},
  title = {WaveTrain: A Python Package for Numerical Quantum Mechanics of Chain-like Systems Based on Tensor Trains}
}

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

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

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},
  primaryclass = {math.OC},
  author = {Kerdreux, Thomas and d'Aspremont, Alexandre and Pokutta, Sebastian},
  title = {Restarting Frank-Wolfe},
  slides = {https://app.box.com/s/prd32r6xmuef2k4gah23rd0egllz9rv5}
}

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 [arXiv] [summary]

[BibTeX]

@article{2020_SofranacGleixnerPokutta_Domainpropagation,
  year = {2022},
  journal = {Parallel Computing},
  volume = {109},
  pages = {102874},
  doi = {10.1016/j.parco.2021.102874},
  archiveprefix = {arXiv},
  eprint = {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}
}

Bolusani, S., and Ralphs, T. K. (2022). A Framework for Generalized Benders’ Decomposition and Its Applications to Multilevel Optimization. Mathematical Programming, 196, 389–426. DOI: 10.1007/s10107-021-01763-7 [arXiv]

[BibTeX]

@article{2021_BolusaniRalphs_Generalizedbendersdecomposition,
  year = {2022},
  journal = {Mathematical Programming},
  volume = {196},
  pages = {389-426},
  doi = {10.1007/s10107-021-01763-7},
  archiveprefix = {arXiv},
  eprint = {2104.06496},
  primaryclass = {math.OC},
  author = {Bolusani, Suresh and Ralphs, Ted K.},
  title = {A Framework for Generalized Benders' Decomposition and Its Applications to Multilevel Optimization}
}

Gelß, P., Klein, R., Matera, S., and Schmidt, B. (2022). Solving the Time-independent Schrödinger Equation for Chains of Coupled Excitons and Phonons Using Tensor Trains. The Journal of Chemical Physics, 156, 024109. DOI: 10.1063/5.0074948 [URL] [arXiv]

[BibTeX]

@article{2021_GelssKleinMateraSchmidt_Tensortrainschrdinger,
  year = {2022},
  journal = {The Journal of Chemical Physics},
  volume = {156},
  pages = {024109},
  doi = {10.1063/5.0074948},
  url = {https://pubs.aip.org/aip/jcp/article/156/2/024109/2839835/Solving-the-time-independent-Schrodinger-equation},
  archiveprefix = {arXiv},
  eprint = {2109.15104},
  primaryclass = {physics.comp-ph},
  author = {Gelß, Patrick and Klein, Rupert and Matera, Sebastian and Schmidt, Burkhard},
  title = {Solving the Time-independent Schrödinger Equation for Chains of Coupled Excitons and Phonons Using Tensor Trains}
}

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},
  volume = {27},
  pages = {432-455},
  doi = {10.1007/s10601-022-09338-9},
  archiveprefix = {arXiv},
  eprint = {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}
}

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

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},
  volume = {48},
  number = {2},
  pages = {1-12},
  doi = {10.1145/3485630},
  archiveprefix = {arXiv},
  eprint = {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}
}

Hoppmann-Baum, K., Burdakov, O., Mexi, G., Casselgren, C. J., and Koch, T. (2022). Length-Constrained Cycle Partition with an Application to UAV Routing. Optimization Methods and Software. DOI: 10.1080/10556788.2022.2053972

[BibTeX]

@article{2022_HoppmannEtAl_CyclepartitionUavrouting,
  year = {2022},
  journal = {Optimization Methods and Software},
  doi = {10.1080/10556788.2022.2053972},
  author = {Hoppmann-Baum, Kai and Burdakov, Oleg and Mexi, Gioni and Casselgren, Carl Johan and Koch, Thorsten},
  title = {Length-Constrained Cycle Partition with an Application to UAV Routing}
}

Iommazzo, G., D’Ambrosio, C., Frangioni, A., and Liberti, L. (2022). Algorithm Configuration Problem. In Encyclopedia of Optimization (pp. 1–8). DOI: 10.1007/978-3-030-54621-2_749-1 [arXiv]

[BibTeX]

@incollection{2022_IommazzoDAmbrosioFrangioniLiberti_Algorithmconfiguration,
  year = {2022},
  booktitle = {Encyclopedia of Optimization},
  pages = {1-8},
  doi = {10.1007/978-3-030-54621-2_749-1},
  archiveprefix = {arXiv},
  eprint = {2403.00898},
  primaryclass = {cs.AI},
  author = {Iommazzo, Gabriele and D'Ambrosio, Claudia and Frangioni, Antonio and Liberti, Leo},
  title = {Algorithm Configuration Problem}
}

Kossen, T., Hirzel, M. A., Madai, V. I., Boenisch, F., Hennemuth, A., Hildebrand, K., Pokutta, S., Sharma, K., Hilbert, A., Sobesky, J., Galinovic, I., Khalil, A. A., Fiebach, J. B., and Frey, D. (2022). Towards Sharing Brain Images: Differentially Private TOF-MRA Images with Segmentation Labels Using Generative Adversarial Networks. Frontiers in Artificial Intelligence. DOI: 10.3389/frai.2022.813842

[BibTeX]

@article{2022_KossenEtAl_Brainimagesharing,
  year = {2022},
  journal = {Frontiers in Artificial Intelligence},
  doi = {10.3389/frai.2022.813842},
  author = {Kossen, Tabea and Hirzel, Manuel A. and Madai, Vince I. and Boenisch, Franziska and Hennemuth, Anja and Hildebrand, Kristian and Pokutta, Sebastian and Sharma, Kartikey and Hilbert, Adam and Sobesky, Jan and Galinovic, Ivana and Khalil, Ahmed A. and Fiebach, Jochen B. and Frey, Dietmar},
  title = {Towards Sharing Brain Images: Differentially Private TOF-MRA Images with Segmentation Labels Using Generative Adversarial Networks}
}

Nohadani, O., and Sharma, K. (2022). Optimization Under Connected Uncertainty. INFORMS Journal on Optimization. DOI: 10.1287/ijoo.2021.0067 [arXiv]

[BibTeX]

@article{2022_NohadaniSharma_Connecteduncertainty,
  year = {2022},
  journal = {INFORMS Journal on Optimization},
  doi = {10.1287/ijoo.2021.0067},
  archiveprefix = {arXiv},
  eprint = {2202.10602},
  primaryclass = {math.OC},
  author = {Nohadani, Omid and Sharma, Kartikey},
  title = {Optimization Under Connected Uncertainty}
}

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

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

Pokutta, S. (2021). Mathematik, Machine Learning Und Artificial Intelligence. Mitteilungen Der DMV. [URL]

[BibTeX]

@article{2021_Pokutta_MathematikMachineLearning,
  year = {2021},
  journal = {Mitteilungen der DMV},
  month = jan,
  url = {https://app.box.com/s/8u6fsucm78e1shyyzoghxar40f7xk6ni},
  author = {Pokutta, Sebastian},
  title = {Mathematik, Machine Learning Und Artificial Intelligence}
}

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

Nüske, F., Gelß, P., Klus, S., and Clementi, C. (2021). Tensor-based Computation of Metastable and Coherent Sets. Physica D: Nonlinear Phenomena, 427, 133018. DOI: 10.1016/j.physd.2021.133018 [URL] [arXiv]

[BibTeX]

@article{2019_NueskeGelssKlusClementi_Tensorkoopman,
  year = {2021},
  journal = {Physica D: Nonlinear Phenomena},
  volume = {427},
  pages = {133018},
  doi = {10.1016/j.physd.2021.133018},
  url = {https://sciencedirect.com/science/article/abs/pii/S0167278921001755},
  archiveprefix = {arXiv},
  eprint = {1908.04741},
  primaryclass = {math.NA},
  author = {Nüske, Feliks and Gelß, Patrick and Klus, Stefan and Clementi, Cecilia},
  title = {Tensor-based Computation of Metastable and Coherent Sets}
}

Gelß, P., Klus, S., Schuster, I., and Schütte, C. (2021). Feature Space Approximation for Kernel-based Supervised Learning. Knowledge-Based Systems, 221, 106935. DOI: 10.1016/j.knosys.2021.106935 [URL] [arXiv]

[BibTeX]

@article{2020_GelssKlusSchusterSchuette_Featureapproximation,
  year = {2021},
  journal = {Knowledge-Based Systems},
  volume = {221},
  pages = {106935},
  doi = {10.1016/j.knosys.2021.106935},
  url = {https://sciencedirect.com/science/article/abs/pii/S0950705121001982},
  archiveprefix = {arXiv},
  eprint = {2011.12651},
  primaryclass = {stat.ML},
  author = {Gelß, Patrick and Klus, Stefan and Schuster, Ingmar and Schütte, Christof},
  title = {Feature Space Approximation for Kernel-based Supervised Learning}
}

Klus, S., Gelß, P., Nüske, F., and Noé, F. (2021). Symmetric and Antisymmetric Kernels for Machine Learning Problems in Quantum Physics and Chemistry. Machine Learning: Science and Technology, 2(4), 18958. DOI: 10.1088/2632-2153/ac14ad [URL] [arXiv]

[BibTeX]

@article{2021_KlusGelssNueskeNoe_Symmetricantisymmetrickernels,
  year = {2021},
  journal = {Machine Learning: Science and Technology},
  volume = {2},
  number = {4},
  pages = {18958},
  doi = {10.1088/2632-2153/ac14ad},
  url = {https://iopscience.iop.org/article/10.1088/2632-2153/ac14ad},
  archiveprefix = {arXiv},
  eprint = {2103.17233},
  primaryclass = {quant-ph},
  author = {Klus, Stefan and Gelß, Patrick and Nüske, Feliks and Noé, Frank},
  title = {Symmetric and Antisymmetric Kernels for Machine Learning Problems in Quantum Physics and Chemistry}
}

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

Ziemke, T., Sering, L., Vargas Koch, L., Zimmer, M., Nagel, K., and Skutella, M. (2021). Flows Over Time As Continuous Limits of Packet-based Network Simulations. Transportation Research Procedia, 52, 123–130. DOI: 10.1016/j.trpro.2021.01.014 [URL]

[BibTeX]

@article{2021_ZiemkeEtAl_Flowscontinuouslimits,
  year = {2021},
  journal = {Transportation Research Procedia},
  volume = {52},
  pages = {123-130},
  doi = {10.1016/j.trpro.2021.01.014},
  url = {https://sciencedirect.com/science/article/pii/S2352146521000284},
  author = {Ziemke, Theresa and Sering, Leon and Vargas Koch, Laura and Zimmer, Max and Nagel, Kai and Skutella, Martin},
  title = {Flows Over Time As Continuous Limits of Packet-based Network Simulations}
}

Kusch, C., Rué, J. J., Spiegel, C., and Szabó, T. (2019-09). On the Optimality of the Uniform Random Strategy. Random Structures & Algorithms, 55(2), 371–401. DOI: 10.1002/rsa.20829 [URL] [arXiv]

[BibTeX]

@article{2017_KuschRueSpiegelSzabo_Uniformrandomstrategy,
  year = {2019-09},
  journal = {Random Structures & Algorithms},
  volume = {55},
  number = {2},
  pages = {371-401},
  doi = {10.1002/rsa.20829},
  url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/rsa.20829},
  archiveprefix = {arXiv},
  eprint = {2411.02622},
  primaryclass = {cs.LG},
  author = {Kusch, Christopher and Rué, Juan José and Spiegel, Christoph and Szabó, Tibor},
  title = {On the Optimality of the Uniform Random Strategy}
}

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 [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}
}

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},
  primaryclass = {cs.DS},
  author = {Braun, Gábor and Pokutta, Sebastian and Zink, Daniel},
  title = {Lazifying Conditional Gradient Algorithms}
}

Klus, S., and Gelß, P. (2019). Tensor-based Algorithms for Image Classification. Algorithms, 12(11), 240. DOI: 10.3390/a12110240 [URL] [arXiv]

[BibTeX]

@article{2019_KlusGelss_Tensoralgorithmsclassification,
  year = {2019},
  journal = {Algorithms},
  volume = {12},
  number = {11},
  pages = {240},
  doi = {10.3390/a12110240},
  url = {https://mdpi.com/1999-4893/12/11/240},
  archiveprefix = {arXiv},
  eprint = {1910.02150},
  primaryclass = {cs.LG},
  author = {Klus, Stefan and Gelß, Patrick},
  title = {Tensor-based Algorithms for Image Classification}
}

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},
  primaryclass = {cs.CC},
  author = {Braun, Gábor and Pokutta, Sebastian and Roy, Aurko},
  title = {Strong Reductions for Extended Formulations}
}

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},
  primaryclass = {math.OC},
  author = {Le Bodic, P. and Pfetsch, Marc and Pavelka, Jeff and Pokutta, Sebastian},
  title = {Solving MIPs Via Scaling-based Augmentation}
}

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

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 [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}
}

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

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},
  primaryclass = {cs.LG},
  author = {Roy, Aurko and Pokutta, Sebastian},
  title = {Hierarchical Clustering Via Spreading Metrics}
}

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 [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}
}

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

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},
  primaryclass = {math.AC},
  author = {Braun, Gábor and Pokutta, Sebastian},
  title = {A Polyhedral Characterization of Border Bases}
}

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},
  primaryclass = {cs.CC},
  author = {Braun, Gábor and Firorini, Samuel and Pokutta, Sebastian and Steurer, David},
  title = {Approximation Limits of Linear Programs (beyond Hierarchies)}
}

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},
  primaryclass = {cs.IT},
  author = {Braun, Gábor and Pokutta, Sebastian and Xie, Yao},
  title = {Info-greedy Sequential Adaptive Compressed Sensing}
}

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