Gábor Braun

Cristóbal Guzmán

IEEE Trans. Inf. Theory, July, 2024

2019

Affine reductions for LPs and SDPs.

[BibT_eX]

[DOI]

Math. Program., 2019

Blended Conditonal Gradients.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

2018

Blended Conditional Gradients: the unconditioning of conditional gradients.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory.

[BibT_eX]

[DOI]

Cristóbal Guzmán

IEEE Trans. Inf. Theory, 2017

Information-theoretic approximations of the nonnegative rank.

[BibT_eX]

[DOI]

Comput. Complex., 2017

Lazifying Conditional Gradient Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Machine Learning, 2017

2016

A Polyhedral Characterization of Border Bases.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

An efficient high-probability algorithm for Linear Bandits.

[BibT_eX]

[DOI]

CoRR, 2016

The matching problem has no small symmetric SDP.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Strong Reductions for Extended Formulations.

[BibT_eX]

[DOI]

Aurko Roy

Proceedings of the Integer Programming and Combinatorial Optimization, 2016

2015

The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

An information diffusion Fano inequality.

[BibT_eX]

[DOI]

CoRR, 2015

Inapproximability of Combinatorial Problems via Small LPs and SDPs.

[BibT_eX]

[DOI]

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

The matching polytope does not admit fully-polynomial size relaxation schemes.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

LP and SDP inapproximability of combinatorial problems.

[BibT_eX]

[DOI]

CoRR, 2014

Average Case Polyhedral Complexity of the Maximum Stable Set Problem.

[BibT_eX]

[DOI]

Samuel Fiorini

Proceedings of the Approximation, 2014

Info-greedy sequential adaptive compressed sensing.

[BibT_eX]

[DOI]

Yao Xie

Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013

Common Information and Unique Disjointness.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

An Algebraic Approach to Symmetric Extended Formulations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Approximation Limits of Linear Programs (Beyond Hierarchies).

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Random half-integral polytopes.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2011

Breaking up Finite Automata Presentable torsion-Free Abelian Groups.

[BibT_eX]

[DOI]

Lutz Strüngmann

Int. J. Algebra Comput., 2011

2010

Rank of random half-integral polytopes - extended abstract -.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

2005

Random Orders and Gambler's Ruin.

[BibT_eX]

[DOI]

Andreas Blass