| Publication | Date of Publication | Type |
|---|
Kissing polytopes
SIAM Journal on Discrete Mathematics | 2024-10-22 | Paper |
Existence and uniqueness of solutions of the Koopman-von Neumann equation on bounded domains
Journal of Physics A: Mathematical and Theoretical | 2024-09-30 | Paper |
Corrections to: ``Lower bounds on the oracle complexity of nonsmooth convex optimization via information theory
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Scalable Frank-Wolfe on generalized self-concordant functions via simple steps
SIAM Journal on Optimization | 2024-07-16 | Paper |
FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank--Wolfe Algorithms and Conditional Gradients
| 2024-07-09 | Software |
The complexity of geometric scaling
Operations Research Letters | 2024-06-17 | Paper |
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
Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) | 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
Integration of Constraint Programming, Artificial Intelligence, and Operations Research | 2023-10-04 | Paper |
Principled deep neural network training through linear programming
Discrete Optimization | 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
SIAM Journal on Optimization | 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
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
An algorithm-independent measure of progress for linear constraint propagation
Constraints | 2023-01-11 | Paper |
Restarting algorithms: sometimes there is free lunch
| 2022-12-21 | Paper |
scientific article; zbMATH DE number 7626799 (Why is no real title available?)
| 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
INFORMS Journal on Computing | 2022-12-01 | Paper |
Conditional Gradient Methods
| 2022-11-25 | Paper |
Structured Robust Submodular Maximization: Offline and Online Algorithms
INFORMS Journal on Computing | 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
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Restarting Frank-Wolfe: faster rates under Hölderian error bounds
Journal of Optimization Theory and Applications | 2022-03-18 | Paper |
Complexity of linear minimization and projection on some sets
Operations Research Letters | 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
Mitteilungen der Deutschen Mathematiker-Vereinigung (DMV) | 2021-06-11 | Paper |
Frank-Wolfe for Generalized Self-Concordant Functions - Problem Instances
| 2021-05-28 | Dataset |
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 -\varepsilon\)
Mathematics of Operations Research | 2020-03-12 | Paper |
Revisiting the Approximate Carath\'eodory Problem via the Frank-Wolfe Algorithm
| 2019-11-11 | Paper |
scientific article; zbMATH DE number 7064051 (Why is no real title available?)
| 2019-06-07 | Paper |
Affine reductions for LPs and SDPs
Mathematical Programming. Series A. Series B | 2019-02-07 | Paper |
Detecting almost symmetries of graphs
Mathematical Programming Computation | 2018-11-09 | Paper |
Strong reductions for extended formulations
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study
Computational Management Science | 2018-10-10 | Paper |
Erratum to: ``Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study
Computational Management Science | 2018-10-10 | Paper |
Aggregation-based cutting-planes for packing and covering integer programs
Mathematical Programming. Series A. Series B | 2018-09-28 | Paper |
A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set
Operations Research Letters | 2018-09-28 | Paper |
Solving MIPs via scaling-based augmentation
Discrete Optimization | 2018-08-17 | Paper |
The matching problem has no small symmetric SDP
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Hierarchical clustering via spreading metrics
| 2018-04-17 | Paper |
The matching problem has no small symmetric SDP
Mathematical Programming. Series A. Series B | 2017-10-27 | Paper |
The matching polytope does not admit fully-polynomial size relaxation schemes
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory
IEEE Transactions on Information Theory | 2017-09-21 | Paper |
Approximation and online algorithms for multidimensional bin packing: a survey
Computer Science Review | 2017-08-31 | Paper |
Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem
Mathematical Methods of Operations Research | 2017-08-11 | Paper |
Information-theoretic approximations of the nonnegative rank
Computational Complexity | 2017-07-28 | Paper |
The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Average case polyhedral complexity of the maximum stable set problem
| 2017-03-22 | Paper |
Common information and unique disjointness
Algorithmica | 2016-11-29 | Paper |
Average case polyhedral complexity of the maximum stable set problem
Mathematical Programming. Series A. Series B | 2016-11-25 | Paper |
Strong reductions for extended formulations
Lecture Notes in Computer Science | 2016-08-10 | Paper |
Exponential lower bounds for polytopes in combinatorial optimization
Journal of the ACM | 2016-03-24 | Paper |
A Polyhedral Characterization of Border Bases
SIAM Journal on Discrete Mathematics | 2016-02-19 | Paper |
Approximation Limits of Linear Programs (Beyond Hierarchies)
Mathematics of Operations Research | 2015-11-04 | Paper |
On the existence of 0/1 polytopes with high semidefinite extension complexity
Mathematical Programming. Series A. Series B | 2015-10-14 | Paper |
Inapproximability of combinatorial problems via small LPs and SDPs
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs
Discrete Optimization | 2015-04-09 | Paper |
Design and verify: a new scheme for generating cutting-planes
Mathematical Programming. Series A. Series B | 2014-06-27 | Paper |
A note on the extension complexity of the knapsack polytope
Operations Research Letters | 2014-05-14 | Paper |
Linear vs. semidefinite extended formulations
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Strict linear prices in non-convex European day-ahead electricity markets
Optimization Methods & Software | 2014-02-07 | Paper |
On the existence of 0/1 polytopes with high semidefinite extension complexity
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Absolutely rigid fields and Shelah's absolutely rigid trees
| 2012-12-08 | Paper |
Rigid Abelian groups and the probabilistic method.
| 2012-12-08 | Paper |
An algebraic approach to symmetric extended formulations
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Cutting-planes for weakly-coupled \(0/1\) second order cone programs
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Rank of random half-integral polytopes. Extended abstract
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
On the membership problem for the \({0, 1/2}\)-closure
Operations Research Letters | 2012-04-05 | Paper |
Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank
Operations Research Letters | 2012-04-05 | Paper |
Reconstructing biochemical cluster networks
Journal of Mathematical Chemistry | 2012-01-13 | Paper |
Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube
Operations Research Letters | 2011-08-19 | Paper |
Random half-integral polytopes
Operations Research Letters | 2011-08-19 | Paper |
Design and verify: A new scheme for generating cutting-planes
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Products over countable domains.
| 2010-10-01 | Paper |
On the rank of cutting-plane proof systems
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
France Telecom workforce scheduling problem: a challenge
RAIRO - Operations Research | 2009-11-12 | Paper |
A polyhedral approach to computing border bases
| 2009-11-04 | Paper |
Approximate computation of zero-dimensional polynomial ideals
Journal of Symbolic Computation | 2009-10-09 | Paper |
Construction of dual modules using Martin's axiom.
Journal of Algebra | 2008-11-12 | Paper |
scientific article; zbMATH DE number 5270831 (Why is no real title available?)
| 2008-05-05 | Paper |
Absolute graphs with prescribed endomorphism monoid
Semigroup Forum | 2008-04-09 | Paper |
The Chase radical and reduced products.
Journal of Pure and Applied Algebra | 2007-09-03 | Paper |
Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe
| N/A | Paper |
Convergence and Trade-Offs in Riemannian Gradient Descent and Riemannian Proximal Point
| N/A | Paper |
Norm-induced Cuts: Optimization with Lipschitzian Black-box Functions
| N/A | Paper |
Extending the Continuum of Six-Colorings
| N/A | Paper |
The complexity of geometric scaling
| N/A | Paper |
Learning Cuts via Enumeration Oracles
| N/A | Paper |
Splitting the Conditional Gradient Algorithm
| N/A | Paper |
Strong Convexity of Sets in Riemannian Manifolds
| N/A | Paper |
Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods
| N/A | Paper |
