| Publication | Date of Publication | Type |
|---|
| FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank--Wolfe Algorithms and Conditional Gradients | 2024-07-09 | Software |
| ZIB-IOL/OptimalDesignWithBoscia: v0.1.1 | 2024-05-10 | Software |
| On a Frank-Wolfe approach for abs-smooth functions | 2024-02-28 | Software |
| Interpretability Guarantees with Merlin-Arthur Classifiers | 2024-02-27 | Software |
| The Frank-Wolfe algorithm: a short introduction | 2024-02-23 | Paper |
| Network Design with Integer Frank Wolfe | 2024-02-08 | Software |
| The Four-Color Ramsey Multiplicity of Triangles | 2023-12-13 | Paper |
| Accelerated Affine-Invariant Convergence Rates of the Frank-Wolfe Algorithm with Open-Loop Step-Sizes | 2023-10-06 | Paper |
| Online learning for scheduling MIP heuristics | 2023-10-04 | Paper |
| Principled deep neural network training through linear programming | 2023-09-28 | Paper |
| Existence and Uniqueness of Solutions of the Koopman--von Neumann Equation on Bounded Domains | 2023-06-23 | Paper |
| Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube | 2023-06-07 | Paper |
| Kissing polytopes | 2023-05-29 | Paper |
| Data-driven Distributionally Robust Optimization over Time | 2023-04-11 | Paper |
| Online Learning for Scheduling MIP Heuristics | 2023-04-04 | Software |
| Accelerated and Sparse Algorithms for Approximate Personalized PageRank and Beyond | 2023-03-22 | Paper |
| On a Frank-Wolfe Approach for Abs-smooth Functions | 2023-03-17 | Paper |
| Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm | 2023-03-14 | Paper |
| An algorithm-independent measure of progress for linear constraint propagation | 2023-01-11 | Paper |
| Restarting algorithms: sometimes there is free lunch | 2022-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5053323 | 2022-12-06 | Paper |
| Alternating Linear Minimization: Revisiting von Neumann's alternating projections | 2022-12-06 | Paper |
| FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank–Wolfe Algorithms and Conditional Gradients | 2022-12-01 | Paper |
| Conditional Gradient Methods | 2022-11-25 | Paper |
| Structured Robust Submodular Maximization: Offline and Online Algorithms | 2022-06-28 | Paper |
| New Ramsey Multiplicity Bounds and Search Heuristics | 2022-06-08 | Paper |
| Acceleration of Frank-Wolfe Algorithms with Open-Loop Step-Sizes | 2022-05-25 | Paper |
| New limits of treewidth-based tractability in optimization | 2022-03-22 | Paper |
| Restarting Frank-Wolfe: faster rates under Hölderian error bounds | 2022-03-18 | Paper |
| Complexity of linear minimization and projection on some sets | 2021-12-13 | Paper |
| Sparser Kernel Herding with Pairwise Conditional Gradients without Swap Steps | 2021-10-25 | Paper |
| Fast Algorithms for Packing Proportional Fairness and its Dual | 2021-09-08 | Paper |
| An Algorithm-Independent Measure of Progress for Linear Constraint Propagation | 2021-06-14 | Paper |
| Mathematics, machine learning and artificial intelligence | 2021-06-11 | Paper |
| FrankWolfe.jl: a high-performance and flexible toolbox for Frank-Wolfe algorithms and Conditional Gradients | 2021-04-14 | Paper |
| Learning to Schedule Heuristics in Branch-and-Bound | 2021-03-18 | Software |
| Linear Bandits on Uniformly Convex Sets | 2021-03-10 | Paper |
| Complexity of Linear Minimization and Projection on Some Sets | 2021-01-25 | Paper |
| CINDy: Conditional gradient-based Identification of Non-linear Dynamics -- Noise-robust recovery | 2021-01-07 | Paper |
| Dual Prices for Frank--Wolfe Algorithms | 2021-01-06 | Paper |
| Restarting Algorithms: Sometimes there is Free Lunch | 2020-06-26 | Paper |
| Projection-Free Optimization on Uniformly Convex Sets | 2020-04-23 | Paper |
| No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ | 2020-03-12 | Paper |
| Revisiting the Approximate Carath\'eodory Problem via the Frank-Wolfe Algorithm | 2019-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5381125 | 2019-06-07 | Paper |
| Affine reductions for LPs and SDPs | 2019-02-07 | Paper |
| Detecting almost symmetries of graphs | 2018-11-09 | Paper |
| Strong reductions for extended formulations | 2018-10-26 | Paper |
| Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study | 2018-10-10 | Paper |
| Erratum to: ``Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study | 2018-10-10 | Paper |
| Aggregation-based cutting-planes for packing and covering integer programs | 2018-09-28 | Paper |
| A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set | 2018-09-28 | Paper |
| Solving MIPs via scaling-based augmentation | 2018-08-17 | Paper |
| The matching problem has no small symmetric SDP | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4637003 | 2018-04-17 | Paper |
| The matching problem has no small symmetric SDP | 2017-10-27 | Paper |
| The matching polytope does not admit fully-polynomial size relaxation schemes | 2017-10-05 | Paper |
| Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory | 2017-09-21 | Paper |
| Approximation and online algorithms for multidimensional bin packing: a survey | 2017-08-31 | Paper |
| Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem | 2017-08-11 | Paper |
| Information-theoretic approximations of the nonnegative rank | 2017-07-28 | Paper |
| The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes | 2017-04-28 | Paper |
| Average Case Polyhedral Complexity of the Maximum Stable Set Problem | 2017-03-22 | Paper |
| Common information and unique disjointness | 2016-11-29 | Paper |
| Average case polyhedral complexity of the maximum stable set problem | 2016-11-25 | Paper |
| Strong reductions for extended formulations | 2016-08-10 | Paper |
| Exponential Lower Bounds for Polytopes in Combinatorial Optimization | 2016-03-24 | Paper |
| A Polyhedral Characterization of Border Bases | 2016-02-19 | Paper |
| Approximation Limits of Linear Programs (Beyond Hierarchies) | 2015-11-04 | Paper |
| On the existence of 0/1 polytopes with high semidefinite extension complexity | 2015-10-14 | Paper |
| Inapproximability of Combinatorial Problems via Small LPs and SDPs | 2015-08-21 | Paper |
| Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs | 2015-04-09 | Paper |
| Design and verify: a new scheme for generating cutting-planes | 2014-06-27 | Paper |
| A note on the extension complexity of the knapsack polytope | 2014-05-14 | Paper |
| Linear vs. semidefinite extended formulations | 2014-05-13 | Paper |
| Strict linear prices in non-convex European day-ahead electricity markets | 2014-02-07 | Paper |
| On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity | 2013-09-17 | Paper |
| Rigid abelian groups and the probabilistic method | 2012-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3144548 | 2012-12-08 | Paper |
| An Algebraic Approach to Symmetric Extended Formulations | 2012-11-02 | Paper |
| Rank of random half-integral polytopes — extended abstract — | 2012-05-13 | Paper |
| Cutting-planes for weakly-coupled 0/1 second order cone programs | 2012-05-13 | Paper |
| On the membership problem for the \({0, 1/2}\)-closure | 2012-04-05 | Paper |
| Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank | 2012-04-05 | Paper |
| Reconstructing biochemical cluster networks | 2012-01-13 | Paper |
| Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube | 2011-08-19 | Paper |
| Random half-integral polytopes | 2011-08-19 | Paper |
| Design and Verify: A New Scheme for Generating Cutting-Planes | 2011-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4931764 | 2010-10-01 | Paper |
| On the Rank of Cutting-Plane Proof Systems | 2010-06-22 | Paper |
| France Telecom workforce scheduling problem: a challenge | 2009-11-12 | Paper |
| A polyhedral approach to computing border bases | 2009-11-04 | Paper |
| Approximate computation of zero-dimensional polynomial ideals | 2009-10-09 | Paper |
| Construction of dual modules using Martin's axiom. | 2008-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5460263 | 2008-05-05 | Paper |
| Absolute graphs with prescribed endomorphism monoid | 2008-04-09 | Paper |
| The Chase radical and reduced products. | 2007-09-03 | Paper |
